./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 f8e1c903 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_10-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX --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-f8e1c90 [2021-11-09 10:37:50,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-09 10:37:50,442 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-09 10:37:50,517 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-09 10:37:50,518 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-09 10:37:50,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-09 10:37:50,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-09 10:37:50,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-09 10:37:50,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-09 10:37:50,548 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-09 10:37:50,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-09 10:37:50,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-09 10:37:50,553 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-09 10:37:50,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-09 10:37:50,561 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-09 10:37:50,569 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-09 10:37:50,574 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-09 10:37:50,575 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-09 10:37:50,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-09 10:37:50,588 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-09 10:37:50,594 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-09 10:37:50,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-09 10:37:50,600 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-09 10:37:50,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-09 10:37:50,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-09 10:37:50,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-09 10:37:50,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-09 10:37:50,615 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-09 10:37:50,616 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-09 10:37:50,618 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-09 10:37:50,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-09 10:37:50,621 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-09 10:37:50,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-09 10:37:50,625 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-09 10:37:50,628 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-09 10:37:50,628 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-09 10:37:50,629 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-09 10:37:50,630 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-09 10:37:50,630 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-09 10:37:50,631 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-09 10:37:50,632 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-09 10:37:50,633 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-09 10:37:50,707 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-09 10:37:50,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-09 10:37:50,709 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-09 10:37:50,710 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-09 10:37:50,720 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-09 10:37:50,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-09 10:37:50,721 INFO L138 SettingsManager]: * Use SBE=true [2021-11-09 10:37:50,721 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-09 10:37:50,722 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-09 10:37:50,722 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-09 10:37:50,724 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-09 10:37:50,724 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-09 10:37:50,724 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-09 10:37:50,725 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-09 10:37:50,725 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-09 10:37:50,725 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-09 10:37:50,726 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-09 10:37:50,726 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-09 10:37:50,726 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-09 10:37:50,727 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-09 10:37:50,727 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-09 10:37:50,727 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-09 10:37:50,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 10:37:50,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-09 10:37:50,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-09 10:37:50,729 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-09 10:37:50,729 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-09 10:37:50,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-09 10:37:50,730 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-09 10:37:50,732 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-09 10:37:50,732 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-09 10:37:50,732 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-09 10:37:50,733 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_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/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_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX 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-09 10:37:51,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-09 10:37:51,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-09 10:37:51,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-09 10:37:51,170 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-09 10:37:51,171 INFO L275 PluginConnector]: CDTParser initialized [2021-11-09 10:37:51,173 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/../../sv-benchmarks/c/recursive-simple/fibo_10-1.c [2021-11-09 10:37:51,277 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/data/3d4d92d63/833b127daa63421d959affa0ec902707/FLAG98b02a8ef [2021-11-09 10:37:51,866 INFO L306 CDTParser]: Found 1 translation units. [2021-11-09 10:37:51,868 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2021-11-09 10:37:51,891 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/data/3d4d92d63/833b127daa63421d959affa0ec902707/FLAG98b02a8ef [2021-11-09 10:37:52,194 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/data/3d4d92d63/833b127daa63421d959affa0ec902707 [2021-11-09 10:37:52,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-09 10:37:52,201 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-09 10:37:52,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-09 10:37:52,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-09 10:37:52,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-09 10:37:52,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:37:52" (1/1) ... [2021-11-09 10:37:52,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3289a36e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:52, skipping insertion in model container [2021-11-09 10:37:52,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:37:52" (1/1) ... [2021-11-09 10:37:52,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-09 10:37:52,249 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-09 10:37:52,561 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_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2021-11-09 10:37:52,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 10:37:52,576 INFO L203 MainTranslator]: Completed pre-run [2021-11-09 10:37:52,597 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_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2021-11-09 10:37:52,598 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 10:37:52,630 INFO L208 MainTranslator]: Completed translation [2021-11-09 10:37:52,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:52 WrapperNode [2021-11-09 10:37:52,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-09 10:37:52,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-09 10:37:52,636 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-09 10:37:52,637 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-09 10:37:52,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:52" (1/1) ... [2021-11-09 10:37:52,657 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:52" (1/1) ... [2021-11-09 10:37:52,681 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-09 10:37:52,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-09 10:37:52,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-09 10:37:52,684 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-09 10:37:52,695 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:52" (1/1) ... [2021-11-09 10:37:52,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:52" (1/1) ... [2021-11-09 10:37:52,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:52" (1/1) ... [2021-11-09 10:37:52,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:52" (1/1) ... [2021-11-09 10:37:52,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:52" (1/1) ... [2021-11-09 10:37:52,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:52" (1/1) ... [2021-11-09 10:37:52,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:52" (1/1) ... [2021-11-09 10:37:52,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-09 10:37:52,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-09 10:37:52,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-09 10:37:52,734 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-09 10:37:52,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:52" (1/1) ... [2021-11-09 10:37:52,748 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 10:37:52,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 10:37:52,776 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-09 10:37:52,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-09 10:37:52,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-09 10:37:52,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-09 10:37:52,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-09 10:37:52,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-09 10:37:52,847 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2021-11-09 10:37:52,847 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2021-11-09 10:37:53,087 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-09 10:37:53,088 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-09 10:37:53,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:37:53 BoogieIcfgContainer [2021-11-09 10:37:53,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-09 10:37:53,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-09 10:37:53,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-09 10:37:53,098 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-09 10:37:53,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:37:52" (1/3) ... [2021-11-09 10:37:53,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497ff3db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:37:53, skipping insertion in model container [2021-11-09 10:37:53,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:52" (2/3) ... [2021-11-09 10:37:53,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497ff3db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:37:53, skipping insertion in model container [2021-11-09 10:37:53,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:37:53" (3/3) ... [2021-11-09 10:37:53,103 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2021-11-09 10:37:53,110 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-09 10:37:53,111 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-09 10:37:53,207 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-09 10:37:53,216 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-09 10:37:53,219 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-09 10:37:53,272 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-09 10:37:53,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-09 10:37:53,278 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:37:53,279 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:37:53,291 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:37:53,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:37:53,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1755511548, now seen corresponding path program 1 times [2021-11-09 10:37:53,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:37:53,328 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188474251] [2021-11-09 10:37:53,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:37:53,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:37:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:53,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-09 10:37:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:53,630 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-09 10:37:53,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:37:53,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188474251] [2021-11-09 10:37:53,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188474251] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:37:53,633 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:37:53,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 10:37:53,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489592829] [2021-11-09 10:37:53,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 10:37:53,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:37:53,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 10:37:53,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:37:53,679 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-09 10:37:53,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:37:53,739 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2021-11-09 10:37:53,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 10:37:53,742 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-09 10:37:53,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:37:53,753 INFO L225 Difference]: With dead ends: 34 [2021-11-09 10:37:53,753 INFO L226 Difference]: Without dead ends: 18 [2021-11-09 10:37:53,757 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-09 10:37:53,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-11-09 10:37:53,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-11-09 10:37:53,822 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-09 10:37:53,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-11-09 10:37:53,826 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2021-11-09 10:37:53,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:37:53,826 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-11-09 10:37:53,827 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-09 10:37:53,827 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-11-09 10:37:53,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-09 10:37:53,830 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:37:53,830 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:37:53,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-09 10:37:53,831 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:37:53,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:37:53,835 INFO L85 PathProgramCache]: Analyzing trace with hash 2128459596, now seen corresponding path program 1 times [2021-11-09 10:37:53,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:37:53,835 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103543233] [2021-11-09 10:37:53,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:37:53,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:37:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:53,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-09 10:37:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:53,955 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-09 10:37:53,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:37:53,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103543233] [2021-11-09 10:37:53,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103543233] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:37:53,958 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:37:53,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 10:37:53,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679352996] [2021-11-09 10:37:53,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 10:37:53,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:37:53,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 10:37:53,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:37:53,970 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-09 10:37:54,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:37:54,002 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-11-09 10:37:54,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 10:37:54,003 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-09 10:37:54,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:37:54,005 INFO L225 Difference]: With dead ends: 24 [2021-11-09 10:37:54,005 INFO L226 Difference]: Without dead ends: 20 [2021-11-09 10:37:54,006 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-09 10:37:54,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-11-09 10:37:54,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-11-09 10:37:54,014 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-09 10:37:54,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-11-09 10:37:54,016 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2021-11-09 10:37:54,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:37:54,017 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-11-09 10:37:54,018 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-09 10:37:54,019 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-11-09 10:37:54,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-09 10:37:54,022 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:37:54,023 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-09 10:37:54,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-09 10:37:54,025 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:37:54,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:37:54,026 INFO L85 PathProgramCache]: Analyzing trace with hash -42544313, now seen corresponding path program 1 times [2021-11-09 10:37:54,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:37:54,029 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734064920] [2021-11-09 10:37:54,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:37:54,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:37:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:54,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-09 10:37:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:54,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:37:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:54,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-09 10:37:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:54,234 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-09 10:37:54,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:37:54,235 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734064920] [2021-11-09 10:37:54,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734064920] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:37:54,235 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495741384] [2021-11-09 10:37:54,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:37:54,236 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 10:37:54,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 10:37:54,238 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 10:37:54,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-09 10:37:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:54,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-09 10:37:54,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 10:37:54,628 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-09 10:37:54,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495741384] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:37:54,629 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 10:37:54,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-11-09 10:37:54,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758511649] [2021-11-09 10:37:54,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-09 10:37:54,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:37:54,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-09 10:37:54,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-09 10:37:54,636 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-09 10:37:54,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:37:54,796 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2021-11-09 10:37:54,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-09 10:37:54,797 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-09 10:37:54,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:37:54,799 INFO L225 Difference]: With dead ends: 35 [2021-11-09 10:37:54,799 INFO L226 Difference]: Without dead ends: 20 [2021-11-09 10:37:54,800 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-11-09 10:37:54,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-11-09 10:37:54,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-11-09 10:37:54,806 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-09 10:37:54,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2021-11-09 10:37:54,808 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2021-11-09 10:37:54,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:37:54,809 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-11-09 10:37:54,809 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-09 10:37:54,809 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2021-11-09 10:37:54,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-09 10:37:54,811 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:37:54,811 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-09 10:37:54,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-09 10:37:55,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 10:37:55,025 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:37:55,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:37:55,026 INFO L85 PathProgramCache]: Analyzing trace with hash 170813287, now seen corresponding path program 1 times [2021-11-09 10:37:55,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:37:55,027 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198283397] [2021-11-09 10:37:55,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:37:55,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:37:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:55,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-09 10:37:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:55,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:37:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:55,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:37:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:55,306 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-09 10:37:55,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:37:55,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198283397] [2021-11-09 10:37:55,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198283397] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:37:55,308 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616751774] [2021-11-09 10:37:55,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:37:55,308 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 10:37:55,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 10:37:55,319 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 10:37:55,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-09 10:37:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:55,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-09 10:37:55,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 10:37:55,594 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-09 10:37:55,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616751774] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:37:55,594 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 10:37:55,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2021-11-09 10:37:55,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741699200] [2021-11-09 10:37:55,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-09 10:37:55,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:37:55,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-09 10:37:55,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-09 10:37:55,598 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-09 10:37:55,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:37:55,726 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2021-11-09 10:37:55,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-09 10:37:55,727 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-09 10:37:55,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:37:55,730 INFO L225 Difference]: With dead ends: 38 [2021-11-09 10:37:55,730 INFO L226 Difference]: Without dead ends: 34 [2021-11-09 10:37:55,731 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-09 10:37:55,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-11-09 10:37:55,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-11-09 10:37:55,741 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-09 10:37:55,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2021-11-09 10:37:55,743 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2021-11-09 10:37:55,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:37:55,744 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2021-11-09 10:37:55,744 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-09 10:37:55,745 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2021-11-09 10:37:55,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-09 10:37:55,747 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:37:55,748 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-09 10:37:55,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-09 10:37:55,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 10:37:55,970 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:37:55,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:37:55,971 INFO L85 PathProgramCache]: Analyzing trace with hash -187634876, now seen corresponding path program 2 times [2021-11-09 10:37:55,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:37:55,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122555021] [2021-11-09 10:37:55,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:37:55,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:37:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:56,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-09 10:37:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:56,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:37:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:56,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:37:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:56,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:37:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:56,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:37:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:56,292 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-09 10:37:56,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:37:56,295 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122555021] [2021-11-09 10:37:56,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122555021] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:37:56,296 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284745199] [2021-11-09 10:37:56,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-09 10:37:56,305 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 10:37:56,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 10:37:56,307 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 10:37:56,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-09 10:37:56,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-09 10:37:56,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 10:37:56,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-09 10:37:56,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 10:37:56,692 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-09 10:37:56,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284745199] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:37:56,693 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 10:37:56,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-11-09 10:37:56,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091795842] [2021-11-09 10:37:56,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-09 10:37:56,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:37:56,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-09 10:37:56,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-11-09 10:37:56,696 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-09 10:37:56,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:37:56,993 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2021-11-09 10:37:56,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-09 10:37:56,995 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-09 10:37:56,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:37:56,997 INFO L225 Difference]: With dead ends: 69 [2021-11-09 10:37:56,997 INFO L226 Difference]: Without dead ends: 38 [2021-11-09 10:37:56,999 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-09 10:37:57,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-11-09 10:37:57,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-11-09 10:37:57,009 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-09 10:37:57,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2021-11-09 10:37:57,011 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2021-11-09 10:37:57,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:37:57,012 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2021-11-09 10:37:57,012 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-09 10:37:57,013 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2021-11-09 10:37:57,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-09 10:37:57,016 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:37:57,017 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-09 10:37:57,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-09 10:37:57,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 10:37:57,243 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:37:57,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:37:57,244 INFO L85 PathProgramCache]: Analyzing trace with hash -2015531204, now seen corresponding path program 3 times [2021-11-09 10:37:57,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:37:57,244 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076011711] [2021-11-09 10:37:57,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:37:57,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:37:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:57,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-09 10:37:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:57,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:37:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:57,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:37:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:57,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:37:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:57,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:37:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:57,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:37:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:57,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:37:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:57,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:37:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:57,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:37:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:57,491 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-09 10:37:57,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:37:57,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076011711] [2021-11-09 10:37:57,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076011711] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:37:57,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732268090] [2021-11-09 10:37:57,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-09 10:37:57,493 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 10:37:57,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 10:37:57,494 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 10:37:57,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-09 10:37:57,595 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-11-09 10:37:57,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 10:37:57,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-09 10:37:57,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 10:37:57,862 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-09 10:37:57,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732268090] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:37:57,863 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 10:37:57,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 13 [2021-11-09 10:37:57,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294411575] [2021-11-09 10:37:57,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-09 10:37:57,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:37:57,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-09 10:37:57,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-11-09 10:37:57,865 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-09 10:37:58,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:37:58,020 INFO L93 Difference]: Finished difference Result 85 states and 124 transitions. [2021-11-09 10:37:58,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-09 10:37:58,021 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-09 10:37:58,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:37:58,024 INFO L225 Difference]: With dead ends: 85 [2021-11-09 10:37:58,024 INFO L226 Difference]: Without dead ends: 50 [2021-11-09 10:37:58,026 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-09 10:37:58,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-11-09 10:37:58,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2021-11-09 10:37:58,036 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-09 10:37:58,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2021-11-09 10:37:58,038 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 65 [2021-11-09 10:37:58,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:37:58,038 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2021-11-09 10:37:58,039 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-09 10:37:58,039 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2021-11-09 10:37:58,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-11-09 10:37:58,045 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:37:58,045 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-09 10:37:58,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-09 10:37:58,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 10:37:58,269 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:37:58,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:37:58,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1033750100, now seen corresponding path program 4 times [2021-11-09 10:37:58,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:37:58,271 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705379109] [2021-11-09 10:37:58,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:37:58,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:37:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:58,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-09 10:37:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:58,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:37:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:58,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:37:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:58,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:37:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:58,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:37:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:58,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:37:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:58,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:37:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:58,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:37:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:58,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:37:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:58,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:37:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:58,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-09 10:37:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:58,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:37:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:58,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:37:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:58,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:37:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:58,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:37:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:58,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:37:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:58,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:37:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:58,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:37:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:58,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:37:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:58,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:37:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:58,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-09 10:37:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:37:58,836 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-09 10:37:58,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:37:58,837 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705379109] [2021-11-09 10:37:58,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705379109] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:37:58,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789662002] [2021-11-09 10:37:58,838 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-09 10:37:58,838 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 10:37:58,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 10:37:58,843 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 10:37:58,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-09 10:37:59,011 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-09 10:37:59,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 10:37:59,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-09 10:37:59,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 10:37:59,478 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-09 10:37:59,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789662002] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:37:59,478 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 10:37:59,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 14 [2021-11-09 10:37:59,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131405634] [2021-11-09 10:37:59,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-09 10:37:59,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:37:59,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-09 10:37:59,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-11-09 10:37:59,488 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-09 10:37:59,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:37:59,675 INFO L93 Difference]: Finished difference Result 117 states and 176 transitions. [2021-11-09 10:37:59,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-09 10:37:59,676 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-09 10:37:59,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:37:59,688 INFO L225 Difference]: With dead ends: 117 [2021-11-09 10:37:59,688 INFO L226 Difference]: Without dead ends: 113 [2021-11-09 10:37:59,689 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-09 10:37:59,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-11-09 10:37:59,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2021-11-09 10:37:59,732 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-09 10:37:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 159 transitions. [2021-11-09 10:37:59,739 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 159 transitions. Word has length 147 [2021-11-09 10:37:59,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:37:59,742 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 159 transitions. [2021-11-09 10:37:59,742 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-09 10:37:59,743 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 159 transitions. [2021-11-09 10:37:59,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2021-11-09 10:37:59,756 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:37:59,756 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-09 10:37:59,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-09 10:37:59,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 10:37:59,975 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:37:59,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:37:59,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1022210831, now seen corresponding path program 5 times [2021-11-09 10:37:59,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:37:59,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731793335] [2021-11-09 10:37:59,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:37:59,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:38:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-09 10:38:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-09 10:38:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-09 10:38:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-09 10:38:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:00,804 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-09 10:38:00,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:38:00,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731793335] [2021-11-09 10:38:00,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731793335] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:38:00,806 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458957800] [2021-11-09 10:38:00,806 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-09 10:38:00,806 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 10:38:00,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 10:38:00,807 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 10:38:00,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-09 10:38:01,068 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2021-11-09 10:38:01,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 10:38:01,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-09 10:38:01,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 10:38:01,904 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-09 10:38:01,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458957800] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:38:01,905 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 10:38:01,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 25 [2021-11-09 10:38:01,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005304246] [2021-11-09 10:38:01,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-09 10:38:01,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:38:01,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-09 10:38:01,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2021-11-09 10:38:01,912 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-09 10:38:02,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:38:02,559 INFO L93 Difference]: Finished difference Result 193 states and 365 transitions. [2021-11-09 10:38:02,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-09 10:38:02,560 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-09 10:38:02,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:38:02,562 INFO L225 Difference]: With dead ends: 193 [2021-11-09 10:38:02,563 INFO L226 Difference]: Without dead ends: 95 [2021-11-09 10:38:02,565 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-09 10:38:02,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-11-09 10:38:02,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2021-11-09 10:38:02,576 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-09 10:38:02,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2021-11-09 10:38:02,578 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 215 [2021-11-09 10:38:02,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:38:02,579 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2021-11-09 10:38:02,579 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-09 10:38:02,579 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2021-11-09 10:38:02,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2021-11-09 10:38:02,586 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:38:02,586 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-09 10:38:02,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-09 10:38:02,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 10:38:02,803 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:38:02,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:38:02,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1843553927, now seen corresponding path program 6 times [2021-11-09 10:38:02,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:38:02,804 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489710956] [2021-11-09 10:38:02,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:38:02,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:38:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:02,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-09 10:38:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-09 10:38:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-09 10:38:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-09 10:38:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-09 10:38:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-09 10:38:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:03,708 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-09 10:38:03,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:38:03,708 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489710956] [2021-11-09 10:38:03,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489710956] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:38:03,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215835849] [2021-11-09 10:38:03,709 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-09 10:38:03,709 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 10:38:03,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 10:38:03,710 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 10:38:03,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-09 10:38:04,080 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2021-11-09 10:38:04,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 10:38:04,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-09 10:38:04,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 10:38:04,935 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-09 10:38:04,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215835849] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:38:04,937 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 10:38:04,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10] total 26 [2021-11-09 10:38:04,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620843007] [2021-11-09 10:38:04,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-09 10:38:04,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:38:04,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-09 10:38:04,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2021-11-09 10:38:04,944 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-09 10:38:05,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:38:05,548 INFO L93 Difference]: Finished difference Result 186 states and 295 transitions. [2021-11-09 10:38:05,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-09 10:38:05,549 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-09 10:38:05,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:38:05,551 INFO L225 Difference]: With dead ends: 186 [2021-11-09 10:38:05,551 INFO L226 Difference]: Without dead ends: 113 [2021-11-09 10:38:05,554 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-09 10:38:05,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-11-09 10:38:05,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 101. [2021-11-09 10:38:05,579 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-09 10:38:05,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 136 transitions. [2021-11-09 10:38:05,583 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 136 transitions. Word has length 351 [2021-11-09 10:38:05,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:38:05,587 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 136 transitions. [2021-11-09 10:38:05,588 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-09 10:38:05,588 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 136 transitions. [2021-11-09 10:38:05,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2021-11-09 10:38:05,608 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:38:05,608 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-09 10:38:05,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-09 10:38:05,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 10:38:05,835 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:38:05,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:38:05,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1550468663, now seen corresponding path program 7 times [2021-11-09 10:38:05,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:38:05,836 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104355152] [2021-11-09 10:38:05,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:38:05,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:38:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:06,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-09 10:38:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:06,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:06,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-09 10:38:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-09 10:38:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-09 10:38:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-09 10:38:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-09 10:38:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-09 10:38:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-09 10:38:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-09 10:38:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-09 10:38:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:07,902 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-09 10:38:07,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:38:07,902 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104355152] [2021-11-09 10:38:07,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104355152] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:38:07,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958725507] [2021-11-09 10:38:07,903 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-09 10:38:07,903 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 10:38:07,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 10:38:07,907 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 10:38:07,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-09 10:38:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:08,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 1293 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-09 10:38:08,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 10:38:10,120 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-09 10:38:10,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958725507] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:38:10,121 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 10:38:10,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 12] total 30 [2021-11-09 10:38:10,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861496450] [2021-11-09 10:38:10,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-09 10:38:10,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:38:10,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-09 10:38:10,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2021-11-09 10:38:10,132 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-09 10:38:11,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:38:11,010 INFO L93 Difference]: Finished difference Result 228 states and 374 transitions. [2021-11-09 10:38:11,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-09 10:38:11,011 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-09 10:38:11,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:38:11,016 INFO L225 Difference]: With dead ends: 228 [2021-11-09 10:38:11,016 INFO L226 Difference]: Without dead ends: 138 [2021-11-09 10:38:11,020 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-09 10:38:11,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-11-09 10:38:11,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 118. [2021-11-09 10:38:11,046 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-09 10:38:11,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 164 transitions. [2021-11-09 10:38:11,050 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 164 transitions. Word has length 569 [2021-11-09 10:38:11,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:38:11,051 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 164 transitions. [2021-11-09 10:38:11,051 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-09 10:38:11,051 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2021-11-09 10:38:11,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 924 [2021-11-09 10:38:11,097 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:38:11,098 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-09 10:38:11,149 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-09 10:38:11,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-09 10:38:11,323 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:38:11,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:38:11,324 INFO L85 PathProgramCache]: Analyzing trace with hash -586878367, now seen corresponding path program 8 times [2021-11-09 10:38:11,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:38:11,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951515481] [2021-11-09 10:38:11,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:38:11,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:38:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:12,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-09 10:38:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:12,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:12,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:12,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:12,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:12,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:12,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-09 10:38:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-09 10:38:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-09 10:38:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-09 10:38:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-09 10:38:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-09 10:38:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-09 10:38:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2021-11-09 10:38:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-09 10:38:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-09 10:38:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:13,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-09 10:38:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-09 10:38:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-09 10:38:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-09 10:38:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-09 10:38:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:14,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:14,261 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-09 10:38:14,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:38:14,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951515481] [2021-11-09 10:38:14,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951515481] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:38:14,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801763877] [2021-11-09 10:38:14,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-09 10:38:14,263 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 10:38:14,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 10:38:14,264 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 10:38:14,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-09 10:38:15,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-09 10:38:15,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 10:38:15,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 2079 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-09 10:38:15,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 10:38:17,501 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-09 10:38:17,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801763877] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:38:17,502 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 10:38:17,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 13] total 34 [2021-11-09 10:38:17,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56770715] [2021-11-09 10:38:17,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-09 10:38:17,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:38:17,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-09 10:38:17,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=882, Unknown=0, NotChecked=0, Total=1122 [2021-11-09 10:38:17,507 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-09 10:38:18,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:38:18,486 INFO L93 Difference]: Finished difference Result 266 states and 450 transitions. [2021-11-09 10:38:18,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-11-09 10:38:18,487 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-09 10:38:18,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:38:18,492 INFO L225 Difference]: With dead ends: 266 [2021-11-09 10:38:18,492 INFO L226 Difference]: Without dead ends: 159 [2021-11-09 10:38:18,496 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1250 GetRequests, 1192 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=712, Invalid=2828, Unknown=0, NotChecked=0, Total=3540 [2021-11-09 10:38:18,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-11-09 10:38:18,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 135. [2021-11-09 10:38:18,508 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-09 10:38:18,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 193 transitions. [2021-11-09 10:38:18,511 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 193 transitions. Word has length 923 [2021-11-09 10:38:18,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:38:18,513 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 193 transitions. [2021-11-09 10:38:18,513 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-09 10:38:18,513 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 193 transitions. [2021-11-09 10:38:18,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1496 [2021-11-09 10:38:18,538 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:38:18,539 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-09 10:38:18,589 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-09 10:38:18,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-09 10:38:18,763 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:38:18,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:38:18,764 INFO L85 PathProgramCache]: Analyzing trace with hash -670718281, now seen corresponding path program 9 times [2021-11-09 10:38:18,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:38:18,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542245317] [2021-11-09 10:38:18,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:38:18,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:38:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:20,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-09 10:38:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:21,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-09 10:38:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-09 10:38:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-09 10:38:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-09 10:38:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-09 10:38:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-09 10:38:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-09 10:38:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2021-11-09 10:38:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:22,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-09 10:38:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-09 10:38:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-09 10:38:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-09 10:38:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2021-11-09 10:38:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:23,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-09 10:38:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-09 10:38:24,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-09 10:38:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-09 10:38:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-09 10:38:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-09 10:38:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-09 10:38:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:24,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2021-11-09 10:38:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-09 10:38:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-09 10:38:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-09 10:38:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-09 10:38:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-09 10:38:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 10:38:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-09 10:38:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-09 10:38:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:38:24,776 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-09 10:38:24,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:38:24,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542245317] [2021-11-09 10:38:24,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542245317] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:38:24,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552454910] [2021-11-09 10:38:24,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-09 10:38:24,777 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 10:38:24,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 10:38:24,779 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 10:38:24,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-09 10:38:26,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 104 check-sat command(s) [2021-11-09 10:38:26,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 10:38:26,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 1882 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-09 10:38:26,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 10:38:29,938 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-09 10:38:29,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552454910] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 10:38:29,939 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 10:38:29,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 10] total 40 [2021-11-09 10:38:29,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953079147] [2021-11-09 10:38:29,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-09 10:38:29,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:38:29,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-09 10:38:29,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=1240, Unknown=0, NotChecked=0, Total=1560 [2021-11-09 10:38:29,945 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-09 10:38:31,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:38:31,352 INFO L93 Difference]: Finished difference Result 343 states and 686 transitions. [2021-11-09 10:38:31,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-11-09 10:38:31,353 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-09 10:38:31,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:38:31,359 INFO L225 Difference]: With dead ends: 343 [2021-11-09 10:38:31,359 INFO L226 Difference]: Without dead ends: 191 [2021-11-09 10:38:31,364 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2003 GetRequests, 1930 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1021, Invalid=4529, Unknown=0, NotChecked=0, Total=5550 [2021-11-09 10:38:31,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-11-09 10:38:31,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 161. [2021-11-09 10:38:31,380 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-09 10:38:31,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 222 transitions. [2021-11-09 10:38:31,383 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 222 transitions. Word has length 1495 [2021-11-09 10:38:31,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:38:31,385 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 222 transitions. [2021-11-09 10:38:31,385 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-09 10:38:31,385 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 222 transitions. [2021-11-09 10:38:31,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2021-11-09 10:38:31,403 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:38:31,403 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-09 10:38:31,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-09 10:38:31,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 10:38:31,627 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 10:38:31,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:38:31,627 INFO L85 PathProgramCache]: Analyzing trace with hash 15284780, now seen corresponding path program 10 times [2021-11-09 10:38:31,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:38:31,628 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410016378] [2021-11-09 10:38:31,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:38:31,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:38:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 10:38:32,038 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 10:38:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 10:38:33,374 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 10:38:33,374 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-09 10:38:33,375 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:38:33,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-09 10:38:33,382 INFO L731 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1] [2021-11-09 10:38:33,389 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-09 10:38:33,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:38:33 BoogieIcfgContainer [2021-11-09 10:38:33,711 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-09 10:38:33,711 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-09 10:38:33,711 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-09 10:38:33,712 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-09 10:38:33,712 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:37:53" (3/4) ... [2021-11-09 10:38:33,714 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-09 10:38:34,034 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/witness.graphml [2021-11-09 10:38:34,034 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-09 10:38:34,036 INFO L168 Benchmark]: Toolchain (without parser) took 41833.93 ms. Allocated memory was 86.0 MB in the beginning and 436.2 MB in the end (delta: 350.2 MB). Free memory was 50.3 MB in the beginning and 228.2 MB in the end (delta: -177.9 MB). Peak memory consumption was 170.7 MB. Max. memory is 16.1 GB. [2021-11-09 10:38:34,037 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 86.0 MB. Free memory was 66.2 MB in the beginning and 66.1 MB in the end (delta: 83.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-09 10:38:34,038 INFO L168 Benchmark]: CACSL2BoogieTranslator took 425.13 ms. Allocated memory was 86.0 MB in the beginning and 119.5 MB in the end (delta: 33.6 MB). Free memory was 50.1 MB in the beginning and 95.9 MB in the end (delta: -45.8 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. [2021-11-09 10:38:34,038 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.02 ms. Allocated memory is still 119.5 MB. Free memory was 95.9 MB in the beginning and 94.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-09 10:38:34,039 INFO L168 Benchmark]: Boogie Preprocessor took 48.41 ms. Allocated memory is still 119.5 MB. Free memory was 94.5 MB in the beginning and 93.8 MB in the end (delta: 759.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-09 10:38:34,039 INFO L168 Benchmark]: RCFGBuilder took 358.32 ms. Allocated memory is still 119.5 MB. Free memory was 93.8 MB in the beginning and 84.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-09 10:38:34,040 INFO L168 Benchmark]: TraceAbstraction took 40617.55 ms. Allocated memory was 119.5 MB in the beginning and 436.2 MB in the end (delta: 316.7 MB). Free memory was 83.7 MB in the beginning and 276.4 MB in the end (delta: -192.7 MB). Peak memory consumption was 311.7 MB. Max. memory is 16.1 GB. [2021-11-09 10:38:34,040 INFO L168 Benchmark]: Witness Printer took 323.37 ms. Allocated memory is still 436.2 MB. Free memory was 276.4 MB in the beginning and 228.2 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.1 GB. [2021-11-09 10:38:34,043 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.31 ms. Allocated memory is still 86.0 MB. Free memory was 66.2 MB in the beginning and 66.1 MB in the end (delta: 83.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 425.13 ms. Allocated memory was 86.0 MB in the beginning and 119.5 MB in the end (delta: 33.6 MB). Free memory was 50.1 MB in the beginning and 95.9 MB in the end (delta: -45.8 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 46.02 ms. Allocated memory is still 119.5 MB. Free memory was 95.9 MB in the beginning and 94.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 48.41 ms. Allocated memory is still 119.5 MB. Free memory was 94.5 MB in the beginning and 93.8 MB in the end (delta: 759.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 358.32 ms. Allocated memory is still 119.5 MB. Free memory was 93.8 MB in the beginning and 84.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 40617.55 ms. Allocated memory was 119.5 MB in the beginning and 436.2 MB in the end (delta: 316.7 MB). Free memory was 83.7 MB in the beginning and 276.4 MB in the end (delta: -192.7 MB). Peak memory consumption was 311.7 MB. Max. memory is 16.1 GB. * Witness Printer took 323.37 ms. Allocated memory is still 436.2 MB. Free memory was 276.4 MB in the beginning and 228.2 MB in the end (delta: 48.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: 40.1s, OverallIterations: 13, TraceHistogramMax: 219, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.1s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 292 SDtfs, 1338 SDslu, 1173 SDs, 0 SdLazy, 3482 SolverSat, 1653 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, 2.8s SatisfiabilityAnalysisTime, 24.1s 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-09 10:38:34,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f92fa8ad-c309-4b6c-85c6-b151a55a75a2/bin/uautomizer-IVEQpCNsaX/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