./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 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_10-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU --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-9ad7fb2 [2021-11-02 22:41:10,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 22:41:10,685 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 22:41:10,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 22:41:10,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 22:41:10,759 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 22:41:10,766 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 22:41:10,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 22:41:10,775 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 22:41:10,783 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 22:41:10,784 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 22:41:10,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 22:41:10,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 22:41:10,788 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 22:41:10,789 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 22:41:10,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 22:41:10,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 22:41:10,798 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 22:41:10,801 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 22:41:10,812 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 22:41:10,816 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 22:41:10,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 22:41:10,827 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 22:41:10,828 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 22:41:10,832 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 22:41:10,833 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 22:41:10,833 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 22:41:10,835 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 22:41:10,835 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 22:41:10,837 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 22:41:10,837 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 22:41:10,838 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 22:41:10,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 22:41:10,842 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 22:41:10,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 22:41:10,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 22:41:10,847 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 22:41:10,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 22:41:10,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 22:41:10,848 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 22:41:10,849 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 22:41:10,850 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-02 22:41:10,902 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 22:41:10,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 22:41:10,903 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 22:41:10,903 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 22:41:10,905 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 22:41:10,905 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 22:41:10,906 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 22:41:10,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 22:41:10,906 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-02 22:41:10,907 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 22:41:10,908 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-02 22:41:10,908 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 22:41:10,909 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 22:41:10,909 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 22:41:10,909 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 22:41:10,910 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-02 22:41:10,910 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 22:41:10,910 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 22:41:10,910 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 22:41:10,911 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 22:41:10,911 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 22:41:10,911 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 22:41:10,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 22:41:10,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 22:41:10,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 22:41:10,913 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 22:41:10,913 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 22:41:10,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 22:41:10,914 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 22:41:10,916 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 22:41:10,916 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 22:41:10,917 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 22:41:10,917 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_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/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_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU 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-02 22:41:11,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 22:41:11,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 22:41:11,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 22:41:11,246 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 22:41:11,247 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 22:41:11,248 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/../../sv-benchmarks/c/recursive-simple/fibo_10-1.c [2021-11-02 22:41:11,330 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/data/79580c5d8/cf2eddfd6171423d9af592516c3b10a4/FLAG17668f6b0 [2021-11-02 22:41:11,926 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 22:41:11,927 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2021-11-02 22:41:11,934 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/data/79580c5d8/cf2eddfd6171423d9af592516c3b10a4/FLAG17668f6b0 [2021-11-02 22:41:12,297 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/data/79580c5d8/cf2eddfd6171423d9af592516c3b10a4 [2021-11-02 22:41:12,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 22:41:12,302 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 22:41:12,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 22:41:12,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 22:41:12,311 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 22:41:12,312 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:41:12" (1/1) ... [2021-11-02 22:41:12,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fbe6d87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:41:12, skipping insertion in model container [2021-11-02 22:41:12,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:41:12" (1/1) ... [2021-11-02 22:41:12,325 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 22:41:12,345 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 22:41:12,598 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_e11de533-3da6-4b74-9fac-45c8e1329e17/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2021-11-02 22:41:12,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:41:12,628 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 22:41:12,665 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_e11de533-3da6-4b74-9fac-45c8e1329e17/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2021-11-02 22:41:12,667 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:41:12,686 INFO L208 MainTranslator]: Completed translation [2021-11-02 22:41:12,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:41:12 WrapperNode [2021-11-02 22:41:12,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 22:41:12,693 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 22:41:12,693 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 22:41:12,693 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 22:41:12,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:41:12" (1/1) ... [2021-11-02 22:41:12,713 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:41:12" (1/1) ... [2021-11-02 22:41:12,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 22:41:12,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 22:41:12,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 22:41:12,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 22:41:12,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:41:12" (1/1) ... [2021-11-02 22:41:12,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:41:12" (1/1) ... [2021-11-02 22:41:12,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:41:12" (1/1) ... [2021-11-02 22:41:12,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:41:12" (1/1) ... [2021-11-02 22:41:12,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:41:12" (1/1) ... [2021-11-02 22:41:12,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:41:12" (1/1) ... [2021-11-02 22:41:12,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:41:12" (1/1) ... [2021-11-02 22:41:12,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 22:41:12,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 22:41:12,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 22:41:12,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 22:41:12,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:41:12" (1/1) ... [2021-11-02 22:41:12,793 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 22:41:12,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:41:12,826 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-02 22:41:12,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-02 22:41:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 22:41:12,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 22:41:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 22:41:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 22:41:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2021-11-02 22:41:12,901 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2021-11-02 22:41:13,163 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 22:41:13,163 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-02 22:41:13,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:41:13 BoogieIcfgContainer [2021-11-02 22:41:13,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 22:41:13,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 22:41:13,169 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 22:41:13,173 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 22:41:13,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 10:41:12" (1/3) ... [2021-11-02 22:41:13,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e05f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 10:41:13, skipping insertion in model container [2021-11-02 22:41:13,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:41:12" (2/3) ... [2021-11-02 22:41:13,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e05f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 10:41:13, skipping insertion in model container [2021-11-02 22:41:13,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:41:13" (3/3) ... [2021-11-02 22:41:13,177 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2021-11-02 22:41:13,184 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 22:41:13,185 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-02 22:41:13,244 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 22:41:13,253 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-02 22:41:13,253 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-02 22:41:13,275 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-02 22:41:13,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-02 22:41:13,282 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:41:13,283 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:41:13,284 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:41:13,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:41:13,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1755511548, now seen corresponding path program 1 times [2021-11-02 22:41:13,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:41:13,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049121005] [2021-11-02 22:41:13,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:41:13,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:41:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:13,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-02 22:41:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:13,628 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-02 22:41:13,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:41:13,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049121005] [2021-11-02 22:41:13,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049121005] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:41:13,632 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:41:13,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 22:41:13,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181661080] [2021-11-02 22:41:13,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 22:41:13,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:41:13,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 22:41:13,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 22:41:13,663 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-02 22:41:13,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:41:13,718 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2021-11-02 22:41:13,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 22:41:13,721 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-02 22:41:13,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:41:13,732 INFO L225 Difference]: With dead ends: 34 [2021-11-02 22:41:13,732 INFO L226 Difference]: Without dead ends: 18 [2021-11-02 22:41:13,736 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-02 22:41:13,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-11-02 22:41:13,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-11-02 22:41:13,782 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-02 22:41:13,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-11-02 22:41:13,786 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2021-11-02 22:41:13,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:41:13,787 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-11-02 22:41:13,788 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-02 22:41:13,788 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-11-02 22:41:13,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-02 22:41:13,790 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:41:13,791 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:41:13,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 22:41:13,792 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:41:13,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:41:13,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2128459596, now seen corresponding path program 1 times [2021-11-02 22:41:13,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:41:13,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763947345] [2021-11-02 22:41:13,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:41:13,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:41:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:13,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-02 22:41:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:13,974 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-02 22:41:13,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:41:13,975 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763947345] [2021-11-02 22:41:13,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763947345] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:41:13,976 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:41:13,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 22:41:13,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962273452] [2021-11-02 22:41:13,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 22:41:13,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:41:13,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 22:41:13,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 22:41:13,981 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-02 22:41:14,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:41:14,002 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-11-02 22:41:14,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 22:41:14,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-02 22:41:14,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:41:14,005 INFO L225 Difference]: With dead ends: 24 [2021-11-02 22:41:14,005 INFO L226 Difference]: Without dead ends: 20 [2021-11-02 22:41:14,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-02 22:41:14,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-11-02 22:41:14,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-11-02 22:41:14,013 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-02 22:41:14,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-11-02 22:41:14,014 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2021-11-02 22:41:14,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:41:14,015 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-11-02 22:41:14,016 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-02 22:41:14,016 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-11-02 22:41:14,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-02 22:41:14,018 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:41:14,018 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-02 22:41:14,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-02 22:41:14,019 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:41:14,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:41:14,020 INFO L85 PathProgramCache]: Analyzing trace with hash -42544313, now seen corresponding path program 1 times [2021-11-02 22:41:14,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:41:14,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923964895] [2021-11-02 22:41:14,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:41:14,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:41:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:14,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-02 22:41:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:14,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:14,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-02 22:41:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:14,259 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-02 22:41:14,259 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:41:14,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923964895] [2021-11-02 22:41:14,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923964895] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:41:14,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681097585] [2021-11-02 22:41:14,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:41:14,263 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:41:14,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:41:14,270 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:41:14,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-02 22:41:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:14,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-02 22:41:14,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:41:14,594 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-02 22:41:14,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681097585] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:41:14,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:41:14,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-11-02 22:41:14,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076701479] [2021-11-02 22:41:14,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 22:41:14,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:41:14,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 22:41:14,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-02 22:41:14,600 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-02 22:41:14,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:41:14,773 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2021-11-02 22:41:14,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 22:41:14,775 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-02 22:41:14,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:41:14,778 INFO L225 Difference]: With dead ends: 35 [2021-11-02 22:41:14,778 INFO L226 Difference]: Without dead ends: 20 [2021-11-02 22:41:14,781 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-02 22:41:14,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-11-02 22:41:14,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-11-02 22:41:14,795 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-02 22:41:14,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2021-11-02 22:41:14,799 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2021-11-02 22:41:14,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:41:14,800 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-11-02 22:41:14,801 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-02 22:41:14,802 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2021-11-02 22:41:14,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-02 22:41:14,806 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:41:14,806 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-02 22:41:14,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-02 22:41:15,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:41:15,029 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:41:15,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:41:15,030 INFO L85 PathProgramCache]: Analyzing trace with hash 170813287, now seen corresponding path program 1 times [2021-11-02 22:41:15,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:41:15,031 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328364192] [2021-11-02 22:41:15,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:41:15,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:41:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:15,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-02 22:41:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:15,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:15,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:15,210 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-02 22:41:15,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:41:15,211 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328364192] [2021-11-02 22:41:15,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328364192] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:41:15,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517758781] [2021-11-02 22:41:15,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:41:15,212 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:41:15,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:41:15,221 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:41:15,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-02 22:41:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:15,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-02 22:41:15,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:41:15,416 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-02 22:41:15,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517758781] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:41:15,417 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:41:15,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2021-11-02 22:41:15,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104250250] [2021-11-02 22:41:15,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 22:41:15,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:41:15,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 22:41:15,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-02 22:41:15,420 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-02 22:41:15,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:41:15,535 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2021-11-02 22:41:15,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 22:41:15,536 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-02 22:41:15,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:41:15,539 INFO L225 Difference]: With dead ends: 38 [2021-11-02 22:41:15,539 INFO L226 Difference]: Without dead ends: 34 [2021-11-02 22:41:15,540 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-02 22:41:15,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-11-02 22:41:15,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-11-02 22:41:15,549 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-02 22:41:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2021-11-02 22:41:15,551 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2021-11-02 22:41:15,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:41:15,552 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2021-11-02 22:41:15,552 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-02 22:41:15,552 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2021-11-02 22:41:15,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-02 22:41:15,555 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:41:15,555 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-02 22:41:15,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-02 22:41:15,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:41:15,768 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:41:15,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:41:15,769 INFO L85 PathProgramCache]: Analyzing trace with hash -187634876, now seen corresponding path program 2 times [2021-11-02 22:41:15,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:41:15,769 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324369387] [2021-11-02 22:41:15,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:41:15,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:41:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:15,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-02 22:41:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:15,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:16,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:16,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:16,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:16,083 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-02 22:41:16,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:41:16,083 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324369387] [2021-11-02 22:41:16,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324369387] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:41:16,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334359640] [2021-11-02 22:41:16,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-02 22:41:16,084 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:41:16,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:41:16,086 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:41:16,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-02 22:41:16,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-02 22:41:16,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:41:16,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-02 22:41:16,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:41:16,440 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-02 22:41:16,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334359640] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:41:16,441 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:41:16,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-11-02 22:41:16,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417404214] [2021-11-02 22:41:16,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-02 22:41:16,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:41:16,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-02 22:41:16,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-11-02 22:41:16,445 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-02 22:41:16,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:41:16,737 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2021-11-02 22:41:16,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-02 22:41:16,738 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-02 22:41:16,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:41:16,742 INFO L225 Difference]: With dead ends: 69 [2021-11-02 22:41:16,742 INFO L226 Difference]: Without dead ends: 38 [2021-11-02 22:41:16,750 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-02 22:41:16,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-11-02 22:41:16,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-11-02 22:41:16,767 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-02 22:41:16,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2021-11-02 22:41:16,774 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2021-11-02 22:41:16,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:41:16,775 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2021-11-02 22:41:16,775 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-02 22:41:16,775 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2021-11-02 22:41:16,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-02 22:41:16,785 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:41:16,785 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-02 22:41:16,837 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-02 22:41:17,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:41:17,009 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:41:17,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:41:17,010 INFO L85 PathProgramCache]: Analyzing trace with hash -2015531204, now seen corresponding path program 3 times [2021-11-02 22:41:17,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:41:17,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988294308] [2021-11-02 22:41:17,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:41:17,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:41:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:17,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-02 22:41:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:17,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:17,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:17,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:17,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:17,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:17,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:17,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:17,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:17,266 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-02 22:41:17,267 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:41:17,267 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988294308] [2021-11-02 22:41:17,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988294308] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:41:17,267 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934173895] [2021-11-02 22:41:17,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-02 22:41:17,268 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:41:17,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:41:17,269 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:41:17,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-02 22:41:17,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-11-02 22:41:17,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:41:17,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-02 22:41:17,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:41:17,641 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-02 22:41:17,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934173895] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:41:17,642 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:41:17,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 13 [2021-11-02 22:41:17,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704420208] [2021-11-02 22:41:17,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-02 22:41:17,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:41:17,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-02 22:41:17,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-11-02 22:41:17,647 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-02 22:41:17,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:41:17,812 INFO L93 Difference]: Finished difference Result 85 states and 124 transitions. [2021-11-02 22:41:17,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-02 22:41:17,813 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-02 22:41:17,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:41:17,816 INFO L225 Difference]: With dead ends: 85 [2021-11-02 22:41:17,816 INFO L226 Difference]: Without dead ends: 50 [2021-11-02 22:41:17,818 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-02 22:41:17,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-11-02 22:41:17,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2021-11-02 22:41:17,827 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-02 22:41:17,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2021-11-02 22:41:17,828 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 65 [2021-11-02 22:41:17,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:41:17,829 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2021-11-02 22:41:17,830 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-02 22:41:17,830 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2021-11-02 22:41:17,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-11-02 22:41:17,832 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:41:17,833 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-02 22:41:17,882 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-02 22:41:18,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:41:18,061 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:41:18,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:41:18,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1033750100, now seen corresponding path program 4 times [2021-11-02 22:41:18,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:41:18,062 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675821044] [2021-11-02 22:41:18,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:41:18,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:41:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:18,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-02 22:41:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:18,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:18,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:18,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:18,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:18,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:18,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:18,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:18,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:18,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:18,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-02 22:41:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:18,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:18,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:18,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:18,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:18,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:18,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:18,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:18,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:18,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:18,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-02 22:41:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:18,631 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-02 22:41:18,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:41:18,632 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675821044] [2021-11-02 22:41:18,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675821044] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:41:18,632 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126240464] [2021-11-02 22:41:18,632 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-02 22:41:18,633 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:41:18,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:41:18,637 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:41:18,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-02 22:41:18,792 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-02 22:41:18,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:41:18,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-02 22:41:18,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:41:19,311 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-02 22:41:19,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126240464] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:41:19,312 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:41:19,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 14 [2021-11-02 22:41:19,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268063426] [2021-11-02 22:41:19,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-02 22:41:19,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:41:19,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-02 22:41:19,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-11-02 22:41:19,315 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-02 22:41:19,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:41:19,520 INFO L93 Difference]: Finished difference Result 117 states and 176 transitions. [2021-11-02 22:41:19,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-02 22:41:19,521 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-02 22:41:19,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:41:19,525 INFO L225 Difference]: With dead ends: 117 [2021-11-02 22:41:19,526 INFO L226 Difference]: Without dead ends: 113 [2021-11-02 22:41:19,527 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-02 22:41:19,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-11-02 22:41:19,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2021-11-02 22:41:19,559 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-02 22:41:19,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 159 transitions. [2021-11-02 22:41:19,566 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 159 transitions. Word has length 147 [2021-11-02 22:41:19,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:41:19,569 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 159 transitions. [2021-11-02 22:41:19,570 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-02 22:41:19,570 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 159 transitions. [2021-11-02 22:41:19,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2021-11-02 22:41:19,583 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:41:19,583 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-02 22:41:19,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-02 22:41:19,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:41:19,813 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:41:19,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:41:19,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1022210831, now seen corresponding path program 5 times [2021-11-02 22:41:19,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:41:19,814 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497912058] [2021-11-02 22:41:19,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:41:19,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:41:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:19,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-02 22:41:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-02 22:41:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-02 22:41:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-02 22:41:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:20,773 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-02 22:41:20,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:41:20,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497912058] [2021-11-02 22:41:20,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497912058] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:41:20,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025472577] [2021-11-02 22:41:20,777 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-02 22:41:20,777 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:41:20,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:41:20,781 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:41:20,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-02 22:41:21,058 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2021-11-02 22:41:21,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:41:21,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-02 22:41:21,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:41:21,764 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-02 22:41:21,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025472577] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:41:21,764 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:41:21,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 25 [2021-11-02 22:41:21,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960404916] [2021-11-02 22:41:21,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-02 22:41:21,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:41:21,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-02 22:41:21,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2021-11-02 22:41:21,768 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-02 22:41:22,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:41:22,449 INFO L93 Difference]: Finished difference Result 193 states and 365 transitions. [2021-11-02 22:41:22,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-02 22:41:22,453 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-02 22:41:22,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:41:22,456 INFO L225 Difference]: With dead ends: 193 [2021-11-02 22:41:22,456 INFO L226 Difference]: Without dead ends: 95 [2021-11-02 22:41:22,465 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-02 22:41:22,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-11-02 22:41:22,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2021-11-02 22:41:22,494 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-02 22:41:22,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2021-11-02 22:41:22,499 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 215 [2021-11-02 22:41:22,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:41:22,500 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2021-11-02 22:41:22,500 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-02 22:41:22,500 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2021-11-02 22:41:22,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2021-11-02 22:41:22,513 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:41:22,513 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-02 22:41:22,560 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-02 22:41:22,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:41:22,733 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:41:22,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:41:22,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1843553927, now seen corresponding path program 6 times [2021-11-02 22:41:22,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:41:22,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219732657] [2021-11-02 22:41:22,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:41:22,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:41:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:22,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-02 22:41:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-02 22:41:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-02 22:41:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-02 22:41:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-02 22:41:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-02 22:41:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:23,792 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-02 22:41:23,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:41:23,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219732657] [2021-11-02 22:41:23,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219732657] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:41:23,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267792614] [2021-11-02 22:41:23,794 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-02 22:41:23,794 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:41:23,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:41:23,795 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:41:23,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-02 22:41:24,201 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2021-11-02 22:41:24,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:41:24,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-02 22:41:24,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:41:25,256 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-02 22:41:25,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267792614] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:41:25,256 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:41:25,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10] total 26 [2021-11-02 22:41:25,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752041746] [2021-11-02 22:41:25,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-02 22:41:25,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:41:25,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-02 22:41:25,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2021-11-02 22:41:25,261 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-02 22:41:25,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:41:25,909 INFO L93 Difference]: Finished difference Result 186 states and 295 transitions. [2021-11-02 22:41:25,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-02 22:41:25,910 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-02 22:41:25,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:41:25,913 INFO L225 Difference]: With dead ends: 186 [2021-11-02 22:41:25,913 INFO L226 Difference]: Without dead ends: 113 [2021-11-02 22:41:25,915 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-02 22:41:25,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-11-02 22:41:25,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 101. [2021-11-02 22:41:25,946 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-02 22:41:25,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 136 transitions. [2021-11-02 22:41:25,949 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 136 transitions. Word has length 351 [2021-11-02 22:41:25,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:41:25,951 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 136 transitions. [2021-11-02 22:41:25,952 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-02 22:41:25,952 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 136 transitions. [2021-11-02 22:41:25,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2021-11-02 22:41:25,969 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:41:25,970 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-02 22:41:26,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-11-02 22:41:26,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:41:26,185 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:41:26,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:41:26,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1550468663, now seen corresponding path program 7 times [2021-11-02 22:41:26,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:41:26,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480949989] [2021-11-02 22:41:26,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:41:26,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:41:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:26,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-02 22:41:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-02 22:41:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-02 22:41:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:27,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-02 22:41:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-02 22:41:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-02 22:41:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:27,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-02 22:41:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-02 22:41:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-02 22:41:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-02 22:41:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:28,389 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-02 22:41:28,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:41:28,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480949989] [2021-11-02 22:41:28,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480949989] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:41:28,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554687667] [2021-11-02 22:41:28,391 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-02 22:41:28,391 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:41:28,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:41:28,393 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:41:28,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-02 22:41:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:29,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 1293 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-02 22:41:29,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:41:30,771 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-02 22:41:30,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554687667] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:41:30,772 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:41:30,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 12] total 30 [2021-11-02 22:41:30,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588788808] [2021-11-02 22:41:30,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-02 22:41:30,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:41:30,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-02 22:41:30,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2021-11-02 22:41:30,781 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-02 22:41:31,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:41:31,623 INFO L93 Difference]: Finished difference Result 228 states and 374 transitions. [2021-11-02 22:41:31,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-02 22:41:31,624 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-02 22:41:31,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:41:31,629 INFO L225 Difference]: With dead ends: 228 [2021-11-02 22:41:31,629 INFO L226 Difference]: Without dead ends: 138 [2021-11-02 22:41:31,633 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-02 22:41:31,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-11-02 22:41:31,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 118. [2021-11-02 22:41:31,658 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-02 22:41:31,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 164 transitions. [2021-11-02 22:41:31,662 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 164 transitions. Word has length 569 [2021-11-02 22:41:31,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:41:31,663 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 164 transitions. [2021-11-02 22:41:31,664 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-02 22:41:31,664 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2021-11-02 22:41:31,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 924 [2021-11-02 22:41:31,707 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:41:31,708 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-02 22:41:31,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-02 22:41:31,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-02 22:41:31,922 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:41:31,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:41:31,923 INFO L85 PathProgramCache]: Analyzing trace with hash -586878367, now seen corresponding path program 8 times [2021-11-02 22:41:31,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:41:31,923 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532379432] [2021-11-02 22:41:31,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:41:31,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:41:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:33,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-02 22:41:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:33,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-02 22:41:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-02 22:41:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-02 22:41:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-02 22:41:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-02 22:41:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-02 22:41:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-02 22:41:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2021-11-02 22:41:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:34,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-02 22:41:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-02 22:41:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-02 22:41:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-02 22:41:35,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-02 22:41:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-02 22:41:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-02 22:41:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:35,713 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-02 22:41:35,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:41:35,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532379432] [2021-11-02 22:41:35,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532379432] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:41:35,715 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823055079] [2021-11-02 22:41:35,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-02 22:41:35,715 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:41:35,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:41:35,721 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:41:35,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-02 22:41:36,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-02 22:41:36,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:41:36,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 2079 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-02 22:41:36,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:41:39,390 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-02 22:41:39,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823055079] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:41:39,391 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:41:39,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 13] total 34 [2021-11-02 22:41:39,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103181069] [2021-11-02 22:41:39,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-02 22:41:39,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:41:39,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-02 22:41:39,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=882, Unknown=0, NotChecked=0, Total=1122 [2021-11-02 22:41:39,398 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-02 22:41:40,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:41:40,354 INFO L93 Difference]: Finished difference Result 266 states and 450 transitions. [2021-11-02 22:41:40,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-11-02 22:41:40,355 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-02 22:41:40,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:41:40,372 INFO L225 Difference]: With dead ends: 266 [2021-11-02 22:41:40,372 INFO L226 Difference]: Without dead ends: 159 [2021-11-02 22:41:40,376 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-02 22:41:40,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-11-02 22:41:40,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 135. [2021-11-02 22:41:40,406 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-02 22:41:40,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 193 transitions. [2021-11-02 22:41:40,413 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 193 transitions. Word has length 923 [2021-11-02 22:41:40,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:41:40,418 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 193 transitions. [2021-11-02 22:41:40,418 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-02 22:41:40,419 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 193 transitions. [2021-11-02 22:41:40,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1496 [2021-11-02 22:41:40,441 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:41:40,442 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-02 22:41:40,474 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-02 22:41:40,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:41:40,653 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:41:40,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:41:40,654 INFO L85 PathProgramCache]: Analyzing trace with hash -670718281, now seen corresponding path program 9 times [2021-11-02 22:41:40,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:41:40,654 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256464677] [2021-11-02 22:41:40,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:41:40,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:41:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:43,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-02 22:41:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:44,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:44,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-02 22:41:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-02 22:41:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-02 22:41:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-02 22:41:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-02 22:41:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-02 22:41:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-02 22:41:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2021-11-02 22:41:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-02 22:41:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-02 22:41:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-02 22:41:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-02 22:41:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:45,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2021-11-02 22:41:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-02 22:41:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-02 22:41:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-02 22:41:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-02 22:41:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:46,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-02 22:41:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-02 22:41:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-02 22:41:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2021-11-02 22:41:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-02 22:41:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-02 22:41:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-11-02 22:41:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-02 22:41:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-02 22:41:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-02 22:41:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-02 22:41:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-02 22:41:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:41:47,414 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-02 22:41:47,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:41:47,416 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256464677] [2021-11-02 22:41:47,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256464677] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:41:47,417 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177435912] [2021-11-02 22:41:47,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-02 22:41:47,418 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:41:47,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:41:47,421 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:41:47,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-02 22:41:49,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 104 check-sat command(s) [2021-11-02 22:41:49,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:41:49,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 1882 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-02 22:41:49,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:41:52,586 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-02 22:41:52,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177435912] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:41:52,587 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:41:52,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 10] total 40 [2021-11-02 22:41:52,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242030817] [2021-11-02 22:41:52,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-02 22:41:52,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:41:52,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-02 22:41:52,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=1240, Unknown=0, NotChecked=0, Total=1560 [2021-11-02 22:41:52,594 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-02 22:41:54,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:41:54,142 INFO L93 Difference]: Finished difference Result 343 states and 686 transitions. [2021-11-02 22:41:54,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-11-02 22:41:54,143 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-02 22:41:54,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:41:54,148 INFO L225 Difference]: With dead ends: 343 [2021-11-02 22:41:54,149 INFO L226 Difference]: Without dead ends: 191 [2021-11-02 22:41:54,153 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-02 22:41:54,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-11-02 22:41:54,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 161. [2021-11-02 22:41:54,170 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-02 22:41:54,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 222 transitions. [2021-11-02 22:41:54,173 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 222 transitions. Word has length 1495 [2021-11-02 22:41:54,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:41:54,176 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 222 transitions. [2021-11-02 22:41:54,176 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-02 22:41:54,176 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 222 transitions. [2021-11-02 22:41:54,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2021-11-02 22:41:54,192 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:41:54,193 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-02 22:41:54,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-11-02 22:41:54,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-02 22:41:54,409 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:41:54,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:41:54,409 INFO L85 PathProgramCache]: Analyzing trace with hash 15284780, now seen corresponding path program 10 times [2021-11-02 22:41:54,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:41:54,410 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188797487] [2021-11-02 22:41:54,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:41:54,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:41:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:41:54,824 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:41:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:41:56,142 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:41:56,142 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-02 22:41:56,144 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 22:41:56,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-02 22:41:56,152 INFO L731 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1] [2021-11-02 22:41:56,160 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 22:41:56,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 10:41:56 BoogieIcfgContainer [2021-11-02 22:41:56,712 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 22:41:56,712 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 22:41:56,713 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 22:41:56,713 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 22:41:56,714 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:41:13" (3/4) ... [2021-11-02 22:41:56,728 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-02 22:41:57,106 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/witness.graphml [2021-11-02 22:41:57,106 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 22:41:57,109 INFO L168 Benchmark]: Toolchain (without parser) took 44804.95 ms. Allocated memory was 115.3 MB in the beginning and 465.6 MB in the end (delta: 350.2 MB). Free memory was 86.4 MB in the beginning and 283.4 MB in the end (delta: -197.1 MB). Peak memory consumption was 151.8 MB. Max. memory is 16.1 GB. [2021-11-02 22:41:57,109 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 115.3 MB. Free memory is still 71.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 22:41:57,110 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.59 ms. Allocated memory is still 115.3 MB. Free memory was 86.1 MB in the beginning and 91.0 MB in the end (delta: -4.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-02 22:41:57,111 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.95 ms. Allocated memory is still 115.3 MB. Free memory was 91.0 MB in the beginning and 89.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-02 22:41:57,111 INFO L168 Benchmark]: Boogie Preprocessor took 39.98 ms. Allocated memory is still 115.3 MB. Free memory was 89.6 MB in the beginning and 88.9 MB in the end (delta: 674.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 22:41:57,111 INFO L168 Benchmark]: RCFGBuilder took 387.39 ms. Allocated memory is still 115.3 MB. Free memory was 88.6 MB in the beginning and 79.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-02 22:41:57,112 INFO L168 Benchmark]: TraceAbstraction took 43543.49 ms. Allocated memory was 115.3 MB in the beginning and 465.6 MB in the end (delta: 350.2 MB). Free memory was 79.0 MB in the beginning and 331.7 MB in the end (delta: -252.6 MB). Peak memory consumption was 350.0 MB. Max. memory is 16.1 GB. [2021-11-02 22:41:57,112 INFO L168 Benchmark]: Witness Printer took 394.26 ms. Allocated memory is still 465.6 MB. Free memory was 331.7 MB in the beginning and 283.4 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.1 GB. [2021-11-02 22:41:57,115 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.35 ms. Allocated memory is still 115.3 MB. Free memory is still 71.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 382.59 ms. Allocated memory is still 115.3 MB. Free memory was 86.1 MB in the beginning and 91.0 MB in the end (delta: -4.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 43.95 ms. Allocated memory is still 115.3 MB. Free memory was 91.0 MB in the beginning and 89.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 39.98 ms. Allocated memory is still 115.3 MB. Free memory was 89.6 MB in the beginning and 88.9 MB in the end (delta: 674.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 387.39 ms. Allocated memory is still 115.3 MB. Free memory was 88.6 MB in the beginning and 79.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 43543.49 ms. Allocated memory was 115.3 MB in the beginning and 465.6 MB in the end (delta: 350.2 MB). Free memory was 79.0 MB in the beginning and 331.7 MB in the end (delta: -252.6 MB). Peak memory consumption was 350.0 MB. Max. memory is 16.1 GB. * Witness Printer took 394.26 ms. Allocated memory is still 465.6 MB. Free memory was 331.7 MB in the beginning and 283.4 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: 42.9s, OverallIterations: 13, TraceHistogramMax: 219, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.1s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 292 SDtfs, 1338 SDslu, 1173 SDs, 0 SdLazy, 3486 SolverSat, 1641 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5295 GetRequests, 4961 SyntacticMatches, 3 SemanticMatches, 331 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4576 ImplicationChecksByTransitivity, 3.7s 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.4s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 26.2s 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-02 22:41:57,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e11de533-3da6-4b74-9fac-45c8e1329e17/bin/uautomizer-tBqnrhUYjU/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