./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_10-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_10-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY --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 acde98dd01af02b5a508b32116f1b2c3612f1f84e6ba2fe02fc76c333a1d32d3 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 07:51:47,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 07:51:47,719 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 07:51:47,759 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 07:51:47,760 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 07:51:47,762 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 07:51:47,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 07:51:47,768 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 07:51:47,770 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 07:51:47,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 07:51:47,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 07:51:47,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 07:51:47,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 07:51:47,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 07:51:47,780 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 07:51:47,782 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 07:51:47,783 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 07:51:47,785 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 07:51:47,788 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 07:51:47,791 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 07:51:47,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 07:51:47,796 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 07:51:47,798 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 07:51:47,799 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 07:51:47,804 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 07:51:47,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 07:51:47,805 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 07:51:47,807 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 07:51:47,807 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 07:51:47,809 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 07:51:47,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 07:51:47,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 07:51:47,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 07:51:47,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 07:51:47,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 07:51:47,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 07:51:47,823 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 07:51:47,824 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 07:51:47,824 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 07:51:47,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 07:51:47,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 07:51:47,829 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-07 07:51:47,883 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 07:51:47,886 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 07:51:47,887 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 07:51:47,887 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 07:51:47,889 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 07:51:47,890 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 07:51:47,890 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 07:51:47,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 07:51:47,891 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 07:51:47,891 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 07:51:47,892 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 07:51:47,893 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 07:51:47,893 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 07:51:47,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 07:51:47,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 07:51:47,894 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 07:51:47,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 07:51:47,894 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 07:51:47,895 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 07:51:47,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 07:51:47,895 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 07:51:47,896 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 07:51:47,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 07:51:47,896 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 07:51:47,897 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 07:51:47,897 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 07:51:47,897 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-07 07:51:47,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 07:51:47,898 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-07 07:51:47,898 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-07 07:51:47,898 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 07:51:47,899 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 07:51:47,899 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_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/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_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY 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 -> acde98dd01af02b5a508b32116f1b2c3612f1f84e6ba2fe02fc76c333a1d32d3 [2021-11-07 07:51:48,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 07:51:48,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 07:51:48,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 07:51:48,242 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 07:51:48,243 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 07:51:48,244 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/../../sv-benchmarks/c/recursive-simple/fibo_10-1.c [2021-11-07 07:51:48,320 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/data/c5ef460ea/a1b1e5cee2234f859a6285861575e926/FLAG312105dfd [2021-11-07 07:51:48,810 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 07:51:48,810 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2021-11-07 07:51:48,817 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/data/c5ef460ea/a1b1e5cee2234f859a6285861575e926/FLAG312105dfd [2021-11-07 07:51:49,196 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/data/c5ef460ea/a1b1e5cee2234f859a6285861575e926 [2021-11-07 07:51:49,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 07:51:49,201 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 07:51:49,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 07:51:49,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 07:51:49,210 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 07:51:49,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:51:49" (1/1) ... [2021-11-07 07:51:49,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69d0ea37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:49, skipping insertion in model container [2021-11-07 07:51:49,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:51:49" (1/1) ... [2021-11-07 07:51:49,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 07:51:49,248 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 07:51:49,536 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_79c1331e-0242-42ce-b2ef-011f670344b9/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2021-11-07 07:51:49,539 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 07:51:49,553 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 07:51:49,579 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_79c1331e-0242-42ce-b2ef-011f670344b9/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2021-11-07 07:51:49,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 07:51:49,597 INFO L208 MainTranslator]: Completed translation [2021-11-07 07:51:49,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:49 WrapperNode [2021-11-07 07:51:49,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 07:51:49,603 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 07:51:49,604 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 07:51:49,604 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 07:51:49,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:49" (1/1) ... [2021-11-07 07:51:49,622 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:49" (1/1) ... [2021-11-07 07:51:49,644 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 07:51:49,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 07:51:49,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 07:51:49,646 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 07:51:49,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:49" (1/1) ... [2021-11-07 07:51:49,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:49" (1/1) ... [2021-11-07 07:51:49,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:49" (1/1) ... [2021-11-07 07:51:49,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:49" (1/1) ... [2021-11-07 07:51:49,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:49" (1/1) ... [2021-11-07 07:51:49,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:49" (1/1) ... [2021-11-07 07:51:49,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:49" (1/1) ... [2021-11-07 07:51:49,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 07:51:49,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 07:51:49,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 07:51:49,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 07:51:49,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:49" (1/1) ... [2021-11-07 07:51:49,689 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 07:51:49,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:51:49,713 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 07:51:49,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 07:51:49,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 07:51:49,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 07:51:49,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 07:51:49,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 07:51:49,758 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2021-11-07 07:51:49,759 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2021-11-07 07:51:50,010 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 07:51:50,011 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-07 07:51:50,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:51:50 BoogieIcfgContainer [2021-11-07 07:51:50,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 07:51:50,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 07:51:50,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 07:51:50,019 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 07:51:50,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:51:49" (1/3) ... [2021-11-07 07:51:50,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9540400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:51:50, skipping insertion in model container [2021-11-07 07:51:50,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:51:49" (2/3) ... [2021-11-07 07:51:50,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9540400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:51:50, skipping insertion in model container [2021-11-07 07:51:50,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:51:50" (3/3) ... [2021-11-07 07:51:50,023 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2021-11-07 07:51:50,030 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 07:51:50,030 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 07:51:50,083 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 07:51:50,089 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-11-07 07:51:50,090 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 07:51:50,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 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-11-07 07:51:50,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 07:51:50,112 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:51:50,113 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:51:50,114 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:51:50,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:51:50,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1755511548, now seen corresponding path program 1 times [2021-11-07 07:51:50,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:51:50,131 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26815651] [2021-11-07 07:51:50,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:51:50,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:51:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:50,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-07 07:51:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:50,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:51:50,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:51:50,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26815651] [2021-11-07 07:51:50,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26815651] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:51:50,393 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:51:50,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 07:51:50,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051846892] [2021-11-07 07:51:50,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 07:51:50,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:51:50,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 07:51:50,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:51:50,427 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 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), 4 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-11-07 07:51:50,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:51:50,502 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2021-11-07 07:51:50,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 07:51:50,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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-11-07 07:51:50,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:51:50,514 INFO L225 Difference]: With dead ends: 34 [2021-11-07 07:51:50,514 INFO L226 Difference]: Without dead ends: 18 [2021-11-07 07:51:50,517 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:51:50,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-11-07 07:51:50,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-11-07 07:51:50,552 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-11-07 07:51:50,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-11-07 07:51:50,555 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2021-11-07 07:51:50,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:51:50,556 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-11-07 07:51:50,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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-11-07 07:51:50,556 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-11-07 07:51:50,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 07:51:50,558 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:51:50,558 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:51:50,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 07:51:50,559 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:51:50,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:51:50,560 INFO L85 PathProgramCache]: Analyzing trace with hash 2128459596, now seen corresponding path program 1 times [2021-11-07 07:51:50,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:51:50,561 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868283433] [2021-11-07 07:51:50,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:51:50,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:51:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:50,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-07 07:51:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:50,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 07:51:50,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:51:50,665 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868283433] [2021-11-07 07:51:50,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868283433] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:51:50,666 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:51:50,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 07:51:50,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133461896] [2021-11-07 07:51:50,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 07:51:50,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:51:50,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 07:51:50,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:51:50,671 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), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:51:50,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:51:50,692 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-11-07 07:51:50,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 07:51:50,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-11-07 07:51:50,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:51:50,695 INFO L225 Difference]: With dead ends: 24 [2021-11-07 07:51:50,695 INFO L226 Difference]: Without dead ends: 20 [2021-11-07 07:51:50,696 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 07:51:50,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-11-07 07:51:50,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-11-07 07:51:50,703 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-11-07 07:51:50,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-11-07 07:51:50,705 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2021-11-07 07:51:50,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:51:50,706 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-11-07 07:51:50,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 07:51:50,707 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-11-07 07:51:50,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 07:51:50,708 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:51:50,709 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:51:50,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 07:51:50,710 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:51:50,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:51:50,711 INFO L85 PathProgramCache]: Analyzing trace with hash -42544313, now seen corresponding path program 1 times [2021-11-07 07:51:50,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:51:50,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669187531] [2021-11-07 07:51:50,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:51:50,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:51:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:50,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-07 07:51:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:50,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:50,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-07 07:51:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:50,894 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 07:51:50,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:51:50,897 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669187531] [2021-11-07 07:51:50,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669187531] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:51:50,898 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552450937] [2021-11-07 07:51:50,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:51:50,899 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:51:50,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:51:50,905 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 07:51:50,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-07 07:51:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:51,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-07 07:51:51,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:51:51,188 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 07:51:51,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552450937] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:51:51,189 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 07:51:51,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-11-07 07:51:51,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898044921] [2021-11-07 07:51:51,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 07:51:51,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:51:51,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 07:51:51,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-07 07:51:51,194 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-07 07:51:51,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:51:51,312 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2021-11-07 07:51:51,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 07:51:51,313 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) Word has length 23 [2021-11-07 07:51:51,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:51:51,315 INFO L225 Difference]: With dead ends: 35 [2021-11-07 07:51:51,315 INFO L226 Difference]: Without dead ends: 20 [2021-11-07 07:51:51,316 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-11-07 07:51:51,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-11-07 07:51:51,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-11-07 07:51:51,323 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-11-07 07:51:51,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2021-11-07 07:51:51,325 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2021-11-07 07:51:51,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:51:51,325 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-11-07 07:51:51,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 9 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-07 07:51:51,326 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2021-11-07 07:51:51,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 07:51:51,328 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:51:51,329 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-11-07 07:51:51,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-07 07:51:51,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-11-07 07:51:51,548 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:51:51,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:51:51,549 INFO L85 PathProgramCache]: Analyzing trace with hash 170813287, now seen corresponding path program 1 times [2021-11-07 07:51:51,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:51:51,550 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746298896] [2021-11-07 07:51:51,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:51:51,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:51:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:51,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-07 07:51:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:51,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:51,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:51:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:51,752 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-07 07:51:51,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:51:51,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746298896] [2021-11-07 07:51:51,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746298896] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:51:51,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053543790] [2021-11-07 07:51:51,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:51:51,756 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:51:51,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:51:51,764 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 07:51:51,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-07 07:51:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:51,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-07 07:51:51,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:51:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-07 07:51:51,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053543790] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:51:51,953 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 07:51:51,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2021-11-07 07:51:51,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343790186] [2021-11-07 07:51:51,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 07:51:51,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:51:51,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 07:51:51,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-07 07:51:51,957 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 8 states, 7 states have (on average 3.0) 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-11-07 07:51:52,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:51:52,056 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2021-11-07 07:51:52,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 07:51:52,057 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) 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-11-07 07:51:52,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:51:52,060 INFO L225 Difference]: With dead ends: 38 [2021-11-07 07:51:52,060 INFO L226 Difference]: Without dead ends: 34 [2021-11-07 07:51:52,061 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-11-07 07:51:52,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-11-07 07:51:52,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-11-07 07:51:52,071 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-11-07 07:51:52,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2021-11-07 07:51:52,073 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2021-11-07 07:51:52,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:51:52,074 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2021-11-07 07:51:52,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) 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-11-07 07:51:52,075 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2021-11-07 07:51:52,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-07 07:51:52,078 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:51:52,078 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-11-07 07:51:52,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-07 07:51:52,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:51:52,304 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:51:52,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:51:52,305 INFO L85 PathProgramCache]: Analyzing trace with hash -187634876, now seen corresponding path program 2 times [2021-11-07 07:51:52,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:51:52,306 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93426298] [2021-11-07 07:51:52,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:51:52,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:51:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:52,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-07 07:51:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:52,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:52,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:52,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:51:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:52,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:51:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:52,529 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-07 07:51:52,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:51:52,530 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93426298] [2021-11-07 07:51:52,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93426298] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:51:52,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343998923] [2021-11-07 07:51:52,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-07 07:51:52,544 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:51:52,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:51:52,548 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 07:51:52,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-07 07:51:52,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-07 07:51:52,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 07:51:52,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-07 07:51:52,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:51:52,801 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-07 07:51:52,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343998923] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:51:52,802 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 07:51:52,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-11-07 07:51:52,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747835189] [2021-11-07 07:51:52,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 07:51:52,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:51:52,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 07:51:52,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-11-07 07:51:52,806 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 7 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2021-11-07 07:51:53,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:51:53,012 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2021-11-07 07:51:53,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 07:51:53,013 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 7 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) Word has length 37 [2021-11-07 07:51:53,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:51:53,015 INFO L225 Difference]: With dead ends: 69 [2021-11-07 07:51:53,015 INFO L226 Difference]: Without dead ends: 38 [2021-11-07 07:51:53,017 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2021-11-07 07:51:53,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-11-07 07:51:53,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-11-07 07:51:53,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2021-11-07 07:51:53,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2021-11-07 07:51:53,026 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2021-11-07 07:51:53,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:51:53,026 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2021-11-07 07:51:53,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 7 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2021-11-07 07:51:53,027 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2021-11-07 07:51:53,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-07 07:51:53,030 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:51:53,030 INFO L513 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:51:53,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-07 07:51:53,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:51:53,256 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:51:53,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:51:53,257 INFO L85 PathProgramCache]: Analyzing trace with hash -2015531204, now seen corresponding path program 3 times [2021-11-07 07:51:53,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:51:53,257 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387611595] [2021-11-07 07:51:53,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:51:53,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:51:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:53,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-07 07:51:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:53,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:53,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:53,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:53,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:51:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:53,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:51:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:53,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:51:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:53,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:53,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:51:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:53,575 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-11-07 07:51:53,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:51:53,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387611595] [2021-11-07 07:51:53,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387611595] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:51:53,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026695751] [2021-11-07 07:51:53,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 07:51:53,577 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:51:53,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:51:53,580 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 07:51:53,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-07 07:51:53,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-11-07 07:51:53,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 07:51:53,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-07 07:51:53,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:51:53,918 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-11-07 07:51:53,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026695751] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:51:53,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 07:51:53,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 13 [2021-11-07 07:51:53,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082489338] [2021-11-07 07:51:53,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 07:51:53,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:51:53,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 07:51:53,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-11-07 07:51:53,925 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 7 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2021-11-07 07:51:54,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:51:54,120 INFO L93 Difference]: Finished difference Result 85 states and 124 transitions. [2021-11-07 07:51:54,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 07:51:54,121 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 7 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) Word has length 65 [2021-11-07 07:51:54,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:51:54,132 INFO L225 Difference]: With dead ends: 85 [2021-11-07 07:51:54,132 INFO L226 Difference]: Without dead ends: 50 [2021-11-07 07:51:54,137 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-11-07 07:51:54,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-11-07 07:51:54,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2021-11-07 07:51:54,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (16), 9 states have call predecessors, (16), 7 states have call successors, (16) [2021-11-07 07:51:54,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2021-11-07 07:51:54,155 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 65 [2021-11-07 07:51:54,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:51:54,156 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2021-11-07 07:51:54,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 7 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2021-11-07 07:51:54,157 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2021-11-07 07:51:54,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-11-07 07:51:54,164 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:51:54,164 INFO L513 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:51:54,189 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-07 07:51:54,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-07 07:51:54,368 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:51:54,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:51:54,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1033750100, now seen corresponding path program 4 times [2021-11-07 07:51:54,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:51:54,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564164721] [2021-11-07 07:51:54,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:51:54,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:51:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:54,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-07 07:51:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:54,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:54,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:54,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:54,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:54,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:51:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:54,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:51:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:54,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:51:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:54,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:54,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:51:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:54,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-07 07:51:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:54,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:54,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:54,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:54,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:54,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:51:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:54,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:51:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:54,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:51:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:54,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:54,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:51:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:54,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-07 07:51:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:54,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2021-11-07 07:51:54,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:51:54,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564164721] [2021-11-07 07:51:54,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564164721] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:51:54,970 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029949411] [2021-11-07 07:51:54,970 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 07:51:54,970 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:51:54,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:51:54,972 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 07:51:54,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-07 07:51:55,106 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 07:51:55,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 07:51:55,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-07 07:51:55,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:51:55,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2021-11-07 07:51:55,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029949411] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:51:55,583 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 07:51:55,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 14 [2021-11-07 07:51:55,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290140810] [2021-11-07 07:51:55,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 07:51:55,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:51:55,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 07:51:55,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-11-07 07:51:55,594 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (19), 10 states have call predecessors, (19), 12 states have call successors, (19) [2021-11-07 07:51:55,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:51:55,801 INFO L93 Difference]: Finished difference Result 117 states and 176 transitions. [2021-11-07 07:51:55,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 07:51:55,802 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (19), 10 states have call predecessors, (19), 12 states have call successors, (19) Word has length 147 [2021-11-07 07:51:55,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:51:55,816 INFO L225 Difference]: With dead ends: 117 [2021-11-07 07:51:55,817 INFO L226 Difference]: Without dead ends: 113 [2021-11-07 07:51:55,818 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-11-07 07:51:55,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-11-07 07:51:55,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2021-11-07 07:51:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 68 states have internal predecessors, (82), 21 states have call successors, (21), 9 states have call predecessors, (21), 13 states have return successors, (56), 26 states have call predecessors, (56), 21 states have call successors, (56) [2021-11-07 07:51:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 159 transitions. [2021-11-07 07:51:55,862 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 159 transitions. Word has length 147 [2021-11-07 07:51:55,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:51:55,864 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 159 transitions. [2021-11-07 07:51:55,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (19), 10 states have call predecessors, (19), 12 states have call successors, (19) [2021-11-07 07:51:55,864 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 159 transitions. [2021-11-07 07:51:55,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2021-11-07 07:51:55,870 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:51:55,870 INFO L513 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:51:55,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-07 07:51:56,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:51:56,092 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:51:56,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:51:56,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1022210831, now seen corresponding path program 5 times [2021-11-07 07:51:56,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:51:56,093 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794761941] [2021-11-07 07:51:56,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:51:56,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:51:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-07 07:51:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:51:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:51:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:51:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:51:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-07 07:51:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:51:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:51:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-07 07:51:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:51:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:51:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:51:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:51:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-07 07:51:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:51:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:51:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:56,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 403 proven. 706 refuted. 0 times theorem prover too weak. 1471 trivial. 0 not checked. [2021-11-07 07:51:56,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:51:56,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794761941] [2021-11-07 07:51:56,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794761941] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:51:56,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656541709] [2021-11-07 07:51:56,918 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-07 07:51:56,919 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:51:56,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:51:56,924 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 07:51:56,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-07 07:51:57,180 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2021-11-07 07:51:57,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 07:51:57,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-07 07:51:57,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:51:57,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 630 proven. 571 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2021-11-07 07:51:57,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656541709] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:51:57,877 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 07:51:57,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 25 [2021-11-07 07:51:57,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969920788] [2021-11-07 07:51:57,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-07 07:51:57,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:51:57,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-07 07:51:57,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2021-11-07 07:51:57,881 INFO L87 Difference]: Start difference. First operand 104 states and 159 transitions. Second operand has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 25 states have internal predecessors, (64), 17 states have call successors, (22), 1 states have call predecessors, (22), 13 states have return successors, (33), 19 states have call predecessors, (33), 17 states have call successors, (33) [2021-11-07 07:51:58,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:51:58,553 INFO L93 Difference]: Finished difference Result 193 states and 365 transitions. [2021-11-07 07:51:58,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-07 07:51:58,554 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 25 states have internal predecessors, (64), 17 states have call successors, (22), 1 states have call predecessors, (22), 13 states have return successors, (33), 19 states have call predecessors, (33), 17 states have call successors, (33) Word has length 215 [2021-11-07 07:51:58,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:51:58,560 INFO L225 Difference]: With dead ends: 193 [2021-11-07 07:51:58,560 INFO L226 Difference]: Without dead ends: 95 [2021-11-07 07:51:58,563 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=388, Invalid=1418, Unknown=0, NotChecked=0, Total=1806 [2021-11-07 07:51:58,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-11-07 07:51:58,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2021-11-07 07:51:58,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 58 states have internal predecessors, (62), 15 states have call successors, (15), 12 states have call predecessors, (15), 8 states have return successors, (36), 13 states have call predecessors, (36), 15 states have call successors, (36) [2021-11-07 07:51:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2021-11-07 07:51:58,601 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 215 [2021-11-07 07:51:58,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:51:58,602 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2021-11-07 07:51:58,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 25 states have internal predecessors, (64), 17 states have call successors, (22), 1 states have call predecessors, (22), 13 states have return successors, (33), 19 states have call predecessors, (33), 17 states have call successors, (33) [2021-11-07 07:51:58,602 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2021-11-07 07:51:58,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2021-11-07 07:51:58,621 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:51:58,622 INFO L513 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:51:58,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-07 07:51:58,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:51:58,844 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:51:58,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:51:58,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1843553927, now seen corresponding path program 6 times [2021-11-07 07:51:58,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:51:58,845 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120858484] [2021-11-07 07:51:58,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:51:58,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:51:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-07 07:51:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:51:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:51:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:51:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:51:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-07 07:51:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:51:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:51:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-07 07:51:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:51:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:51:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:51:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:51:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-07 07:51:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:51:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:51:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:51:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:51:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-07 07:51:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:51:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:51:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-07 07:51:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:51:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:51:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:51:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:51:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:51:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:51:59,983 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 844 proven. 1612 refuted. 0 times theorem prover too weak. 4664 trivial. 0 not checked. [2021-11-07 07:51:59,983 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:51:59,984 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120858484] [2021-11-07 07:51:59,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120858484] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:51:59,984 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410329916] [2021-11-07 07:51:59,984 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-07 07:51:59,985 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:51:59,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:51:59,986 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 07:52:00,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-07 07:52:00,385 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2021-11-07 07:52:00,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 07:52:00,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-07 07:52:00,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:52:01,297 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 356 proven. 1124 refuted. 0 times theorem prover too weak. 5640 trivial. 0 not checked. [2021-11-07 07:52:01,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410329916] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:52:01,305 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 07:52:01,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10] total 26 [2021-11-07 07:52:01,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820321394] [2021-11-07 07:52:01,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-07 07:52:01,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:52:01,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-07 07:52:01,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2021-11-07 07:52:01,315 INFO L87 Difference]: Start difference. First operand 84 states and 113 transitions. Second operand has 26 states, 25 states have (on average 2.44) internal successors, (61), 26 states have internal predecessors, (61), 17 states have call successors, (21), 1 states have call predecessors, (21), 13 states have return successors, (34), 23 states have call predecessors, (34), 17 states have call successors, (34) [2021-11-07 07:52:01,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:52:01,968 INFO L93 Difference]: Finished difference Result 186 states and 295 transitions. [2021-11-07 07:52:01,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-07 07:52:01,969 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.44) internal successors, (61), 26 states have internal predecessors, (61), 17 states have call successors, (21), 1 states have call predecessors, (21), 13 states have return successors, (34), 23 states have call predecessors, (34), 17 states have call successors, (34) Word has length 351 [2021-11-07 07:52:01,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:52:01,972 INFO L225 Difference]: With dead ends: 186 [2021-11-07 07:52:01,972 INFO L226 Difference]: Without dead ends: 113 [2021-11-07 07:52:01,975 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=422, Invalid=1470, Unknown=0, NotChecked=0, Total=1892 [2021-11-07 07:52:01,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-11-07 07:52:02,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 101. [2021-11-07 07:52:02,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 70 states have internal predecessors, (75), 19 states have call successors, (19), 15 states have call predecessors, (19), 9 states have return successors, (42), 15 states have call predecessors, (42), 19 states have call successors, (42) [2021-11-07 07:52:02,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 136 transitions. [2021-11-07 07:52:02,016 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 136 transitions. Word has length 351 [2021-11-07 07:52:02,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:52:02,019 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 136 transitions. [2021-11-07 07:52:02,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.44) internal successors, (61), 26 states have internal predecessors, (61), 17 states have call successors, (21), 1 states have call predecessors, (21), 13 states have return successors, (34), 23 states have call predecessors, (34), 17 states have call successors, (34) [2021-11-07 07:52:02,020 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 136 transitions. [2021-11-07 07:52:02,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2021-11-07 07:52:02,043 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:52:02,043 INFO L513 BasicCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:52:02,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-07 07:52:02,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:52:02,268 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:52:02,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:52:02,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1550468663, now seen corresponding path program 7 times [2021-11-07 07:52:02,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:52:02,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158740834] [2021-11-07 07:52:02,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:52:02,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:52:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:03,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-07 07:52:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:03,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:03,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:03,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:03,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:03,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:03,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:03,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:03,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:03,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:03,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:03,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:03,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:03,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-07 07:52:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:03,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:03,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:03,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:03,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:03,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-07 07:52:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:03,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:03,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:03,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:03,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:03,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:03,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:03,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-07 07:52:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-07 07:52:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-07 07:52:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-07 07:52:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-07 07:52:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-07 07:52:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-07 07:52:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:04,712 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1691 proven. 3390 refuted. 0 times theorem prover too weak. 14022 trivial. 0 not checked. [2021-11-07 07:52:04,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:52:04,713 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158740834] [2021-11-07 07:52:04,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158740834] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:52:04,713 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765500961] [2021-11-07 07:52:04,713 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 07:52:04,714 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:52:04,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:52:04,716 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 07:52:04,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-07 07:52:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:05,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 1293 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-07 07:52:05,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:52:06,907 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 401 proven. 2942 refuted. 0 times theorem prover too weak. 15760 trivial. 0 not checked. [2021-11-07 07:52:06,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765500961] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:52:06,908 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 07:52:06,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 12] total 30 [2021-11-07 07:52:06,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629510947] [2021-11-07 07:52:06,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-07 07:52:06,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:52:06,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-07 07:52:06,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2021-11-07 07:52:06,914 INFO L87 Difference]: Start difference. First operand 101 states and 136 transitions. Second operand has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 30 states have internal predecessors, (69), 22 states have call successors, (25), 1 states have call predecessors, (25), 15 states have return successors, (42), 26 states have call predecessors, (42), 22 states have call successors, (42) [2021-11-07 07:52:07,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:52:07,791 INFO L93 Difference]: Finished difference Result 228 states and 374 transitions. [2021-11-07 07:52:07,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-07 07:52:07,792 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 30 states have internal predecessors, (69), 22 states have call successors, (25), 1 states have call predecessors, (25), 15 states have return successors, (42), 26 states have call predecessors, (42), 22 states have call successors, (42) Word has length 569 [2021-11-07 07:52:07,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:52:07,796 INFO L225 Difference]: With dead ends: 228 [2021-11-07 07:52:07,796 INFO L226 Difference]: Without dead ends: 138 [2021-11-07 07:52:07,800 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 734 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=558, Invalid=2094, Unknown=0, NotChecked=0, Total=2652 [2021-11-07 07:52:07,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-11-07 07:52:07,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 118. [2021-11-07 07:52:07,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 82 states have internal predecessors, (87), 23 states have call successors, (23), 18 states have call predecessors, (23), 10 states have return successors, (54), 17 states have call predecessors, (54), 23 states have call successors, (54) [2021-11-07 07:52:07,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 164 transitions. [2021-11-07 07:52:07,817 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 164 transitions. Word has length 569 [2021-11-07 07:52:07,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:52:07,818 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 164 transitions. [2021-11-07 07:52:07,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 30 states have internal predecessors, (69), 22 states have call successors, (25), 1 states have call predecessors, (25), 15 states have return successors, (42), 26 states have call predecessors, (42), 22 states have call successors, (42) [2021-11-07 07:52:07,818 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2021-11-07 07:52:07,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 924 [2021-11-07 07:52:07,829 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:52:07,830 INFO L513 BasicCegarLoop]: trace histogram [135, 135, 109, 67, 67, 67, 67, 67, 67, 67, 42, 26, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:52:07,881 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-07 07:52:08,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-07 07:52:08,044 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:52:08,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:52:08,045 INFO L85 PathProgramCache]: Analyzing trace with hash -586878367, now seen corresponding path program 8 times [2021-11-07 07:52:08,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:52:08,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737154063] [2021-11-07 07:52:08,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:52:08,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:52:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:09,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-07 07:52:09,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-07 07:52:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-07 07:52:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-07 07:52:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-07 07:52:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-07 07:52:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-07 07:52:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:10,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-07 07:52:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2021-11-07 07:52:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-07 07:52:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-07 07:52:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-07 07:52:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-07 07:52:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-07 07:52:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:11,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-07 07:52:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:12,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:12,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:12,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:12,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:12,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-07 07:52:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:12,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:12,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:12,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:12,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:12,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:12,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:12,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:12,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:12,081 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 3273 proven. 6787 refuted. 0 times theorem prover too weak. 40850 trivial. 0 not checked. [2021-11-07 07:52:12,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:52:12,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737154063] [2021-11-07 07:52:12,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737154063] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:52:12,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686347761] [2021-11-07 07:52:12,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-07 07:52:12,082 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:52:12,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:52:12,084 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 07:52:12,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-07 07:52:13,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-07 07:52:13,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 07:52:13,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 2079 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-07 07:52:13,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:52:15,562 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 724 proven. 5622 refuted. 0 times theorem prover too weak. 44564 trivial. 0 not checked. [2021-11-07 07:52:15,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686347761] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:52:15,562 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 07:52:15,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 13] total 34 [2021-11-07 07:52:15,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824331889] [2021-11-07 07:52:15,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-07 07:52:15,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:52:15,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-07 07:52:15,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=882, Unknown=0, NotChecked=0, Total=1122 [2021-11-07 07:52:15,568 INFO L87 Difference]: Start difference. First operand 118 states and 164 transitions. Second operand has 34 states, 33 states have (on average 2.303030303030303) internal successors, (76), 34 states have internal predecessors, (76), 25 states have call successors, (28), 1 states have call predecessors, (28), 17 states have return successors, (48), 30 states have call predecessors, (48), 25 states have call successors, (48) [2021-11-07 07:52:16,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:52:16,580 INFO L93 Difference]: Finished difference Result 266 states and 450 transitions. [2021-11-07 07:52:16,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-11-07 07:52:16,581 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.303030303030303) internal successors, (76), 34 states have internal predecessors, (76), 25 states have call successors, (28), 1 states have call predecessors, (28), 17 states have return successors, (48), 30 states have call predecessors, (48), 25 states have call successors, (48) Word has length 923 [2021-11-07 07:52:16,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:52:16,586 INFO L225 Difference]: With dead ends: 266 [2021-11-07 07:52:16,587 INFO L226 Difference]: Without dead ends: 159 [2021-11-07 07:52:16,593 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1250 GetRequests, 1192 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=712, Invalid=2828, Unknown=0, NotChecked=0, Total=3540 [2021-11-07 07:52:16,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-11-07 07:52:16,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 135. [2021-11-07 07:52:16,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 96 states have (on average 1.03125) internal successors, (99), 94 states have internal predecessors, (99), 27 states have call successors, (27), 21 states have call predecessors, (27), 11 states have return successors, (67), 19 states have call predecessors, (67), 27 states have call successors, (67) [2021-11-07 07:52:16,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 193 transitions. [2021-11-07 07:52:16,629 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 193 transitions. Word has length 923 [2021-11-07 07:52:16,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:52:16,634 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 193 transitions. [2021-11-07 07:52:16,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.303030303030303) internal successors, (76), 34 states have internal predecessors, (76), 25 states have call successors, (28), 1 states have call predecessors, (28), 17 states have return successors, (48), 30 states have call predecessors, (48), 25 states have call successors, (48) [2021-11-07 07:52:16,635 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 193 transitions. [2021-11-07 07:52:16,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1496 [2021-11-07 07:52:16,685 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:52:16,686 INFO L513 BasicCegarLoop]: trace histogram [219, 219, 177, 109, 109, 109, 109, 109, 109, 109, 68, 42, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:52:16,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-07 07:52:16,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-07 07:52:16,912 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:52:16,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:52:16,913 INFO L85 PathProgramCache]: Analyzing trace with hash -670718281, now seen corresponding path program 9 times [2021-11-07 07:52:16,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:52:16,913 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726837096] [2021-11-07 07:52:16,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:52:16,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:52:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:19,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-07 07:52:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:20,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-07 07:52:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-07 07:52:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-07 07:52:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-07 07:52:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-07 07:52:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-07 07:52:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-07 07:52:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:21,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2021-11-07 07:52:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-07 07:52:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-07 07:52:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-07 07:52:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-07 07:52:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2021-11-07 07:52:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:22,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-07 07:52:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-07 07:52:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-07 07:52:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-07 07:52:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-07 07:52:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-07 07:52:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-07 07:52:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2021-11-07 07:52:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-07 07:52:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-07 07:52:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-07 07:52:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-07 07:52:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-07 07:52:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-07 07:52:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-07 07:52:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-07 07:52:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:52:23,711 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 6145 proven. 13082 refuted. 0 times theorem prover too weak. 115377 trivial. 0 not checked. [2021-11-07 07:52:23,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:52:23,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726837096] [2021-11-07 07:52:23,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726837096] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:52:23,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761782157] [2021-11-07 07:52:23,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 07:52:23,713 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 07:52:23,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:52:23,716 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 07:52:23,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-07 07:52:25,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 104 check-sat command(s) [2021-11-07 07:52:25,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 07:52:25,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 1882 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-07 07:52:25,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:52:29,190 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 5994 proven. 991 refuted. 0 times theorem prover too weak. 127619 trivial. 0 not checked. [2021-11-07 07:52:29,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761782157] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 07:52:29,191 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 07:52:29,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 10] total 40 [2021-11-07 07:52:29,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640697825] [2021-11-07 07:52:29,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-07 07:52:29,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:52:29,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-07 07:52:29,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=1240, Unknown=0, NotChecked=0, Total=1560 [2021-11-07 07:52:29,197 INFO L87 Difference]: Start difference. First operand 135 states and 193 transitions. Second operand has 40 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 40 states have internal predecessors, (79), 19 states have call successors, (23), 1 states have call predecessors, (23), 21 states have return successors, (42), 36 states have call predecessors, (42), 19 states have call successors, (42) [2021-11-07 07:52:30,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:52:30,718 INFO L93 Difference]: Finished difference Result 343 states and 686 transitions. [2021-11-07 07:52:30,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-11-07 07:52:30,719 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 40 states have internal predecessors, (79), 19 states have call successors, (23), 1 states have call predecessors, (23), 21 states have return successors, (42), 36 states have call predecessors, (42), 19 states have call successors, (42) Word has length 1495 [2021-11-07 07:52:30,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:52:30,726 INFO L225 Difference]: With dead ends: 343 [2021-11-07 07:52:30,728 INFO L226 Difference]: Without dead ends: 191 [2021-11-07 07:52:30,734 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2003 GetRequests, 1930 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1021, Invalid=4529, Unknown=0, NotChecked=0, Total=5550 [2021-11-07 07:52:30,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-11-07 07:52:30,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 161. [2021-11-07 07:52:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 115 states have (on average 1.017391304347826) internal successors, (117), 113 states have internal predecessors, (117), 34 states have call successors, (34), 27 states have call predecessors, (34), 11 states have return successors, (71), 20 states have call predecessors, (71), 34 states have call successors, (71) [2021-11-07 07:52:30,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 222 transitions. [2021-11-07 07:52:30,765 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 222 transitions. Word has length 1495 [2021-11-07 07:52:30,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:52:30,768 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 222 transitions. [2021-11-07 07:52:30,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 40 states have internal predecessors, (79), 19 states have call successors, (23), 1 states have call predecessors, (23), 21 states have return successors, (42), 36 states have call predecessors, (42), 19 states have call successors, (42) [2021-11-07 07:52:30,769 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 222 transitions. [2021-11-07 07:52:30,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2021-11-07 07:52:30,785 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:52:30,785 INFO L513 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:52:30,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-07 07:52:30,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-07 07:52:30,992 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:52:30,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:52:30,993 INFO L85 PathProgramCache]: Analyzing trace with hash 15284780, now seen corresponding path program 10 times [2021-11-07 07:52:30,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:52:30,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043475454] [2021-11-07 07:52:30,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:52:30,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:52:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:52:31,449 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:52:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:52:32,863 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:52:32,863 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 07:52:32,865 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 07:52:32,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 07:52:32,874 INFO L731 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1] [2021-11-07 07:52:32,884 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 07:52:33,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:52:33 BoogieIcfgContainer [2021-11-07 07:52:33,322 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 07:52:33,323 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 07:52:33,324 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 07:52:33,324 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 07:52:33,325 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:51:50" (3/4) ... [2021-11-07 07:52:33,329 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-07 07:52:33,654 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/witness.graphml [2021-11-07 07:52:33,655 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 07:52:33,656 INFO L168 Benchmark]: Toolchain (without parser) took 44454.62 ms. Allocated memory was 96.5 MB in the beginning and 440.4 MB in the end (delta: 343.9 MB). Free memory was 61.9 MB in the beginning and 180.5 MB in the end (delta: -118.6 MB). Peak memory consumption was 225.4 MB. Max. memory is 16.1 GB. [2021-11-07 07:52:33,657 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 96.5 MB. Free memory was 68.3 MB in the beginning and 68.3 MB in the end (delta: 21.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 07:52:33,658 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.23 ms. Allocated memory is still 96.5 MB. Free memory was 61.7 MB in the beginning and 73.0 MB in the end (delta: -11.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-07 07:52:33,658 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.03 ms. Allocated memory is still 96.5 MB. Free memory was 73.0 MB in the beginning and 71.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 07:52:33,658 INFO L168 Benchmark]: Boogie Preprocessor took 35.31 ms. Allocated memory is still 96.5 MB. Free memory was 71.8 MB in the beginning and 70.9 MB in the end (delta: 917.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 07:52:33,659 INFO L168 Benchmark]: RCFGBuilder took 331.86 ms. Allocated memory is still 96.5 MB. Free memory was 70.5 MB in the beginning and 61.8 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-07 07:52:33,659 INFO L168 Benchmark]: TraceAbstraction took 43307.35 ms. Allocated memory was 96.5 MB in the beginning and 440.4 MB in the end (delta: 343.9 MB). Free memory was 61.4 MB in the beginning and 227.7 MB in the end (delta: -166.3 MB). Peak memory consumption was 324.9 MB. Max. memory is 16.1 GB. [2021-11-07 07:52:33,660 INFO L168 Benchmark]: Witness Printer took 331.51 ms. Allocated memory is still 440.4 MB. Free memory was 227.7 MB in the beginning and 180.5 MB in the end (delta: 47.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.1 GB. [2021-11-07 07:52:33,662 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.22 ms. Allocated memory is still 96.5 MB. Free memory was 68.3 MB in the beginning and 68.3 MB in the end (delta: 21.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 394.23 ms. Allocated memory is still 96.5 MB. Free memory was 61.7 MB in the beginning and 73.0 MB in the end (delta: -11.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 41.03 ms. Allocated memory is still 96.5 MB. Free memory was 73.0 MB in the beginning and 71.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 35.31 ms. Allocated memory is still 96.5 MB. Free memory was 71.8 MB in the beginning and 70.9 MB in the end (delta: 917.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 331.86 ms. Allocated memory is still 96.5 MB. Free memory was 70.5 MB in the beginning and 61.8 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 43307.35 ms. Allocated memory was 96.5 MB in the beginning and 440.4 MB in the end (delta: 343.9 MB). Free memory was 61.4 MB in the beginning and 227.7 MB in the end (delta: -166.3 MB). Peak memory consumption was 324.9 MB. Max. memory is 16.1 GB. * Witness Printer took 331.51 ms. Allocated memory is still 440.4 MB. Free memory was 227.7 MB in the beginning and 180.5 MB in the end (delta: 47.2 MB). Peak memory consumption was 48.2 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: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 10; [L27] CALL, EXPR fibo(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L8] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L10] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=9, fibo(n-1)=21, n=9] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=9, fibo(n-1)=21, fibo(n-2)=13, n=9] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=10, fibo(n-1)=34, n=10] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=10, fibo(n-1)=34, fibo(n-2)=21, n=10] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) [L27] int result = fibo(x); [L28] COND TRUE result == 55 [L29] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.7s, OverallIterations: 13, TraceHistogramMax: 219, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.1s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 292 SDtfs, 1338 SDslu, 1173 SDs, 0 SdLazy, 3490 SolverSat, 1641 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5295 GetRequests, 4961 SyntacticMatches, 3 SemanticMatches, 331 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4576 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=12, InterpolantAutomatonStates: 273, 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, 12 MinimizatonAttempts, 111 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 26.4s InterpolantComputationTime, 8928 NumberOfCodeBlocks, 7994 NumberOfCodeBlocksAsserted, 174 NumberOfCheckSat, 7697 ConstructedInterpolants, 0 QuantifiedInterpolants, 10169 SizeOfPredicates, 53 NumberOfNonLiveVariables, 6696 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 22 InterpolantComputations, 2 PerfectInterpolantSequences, 393728/431468 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-11-07 07:52:33,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c1331e-0242-42ce-b2ef-011f670344b9/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE