./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 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_10-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt --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 faad93e560ba524ae1ece04545479d8bfc495d5f .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 00:38:07,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 00:38:07,284 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 00:38:07,322 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 00:38:07,323 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 00:38:07,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 00:38:07,328 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 00:38:07,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 00:38:07,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 00:38:07,335 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 00:38:07,341 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 00:38:07,343 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 00:38:07,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 00:38:07,350 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 00:38:07,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 00:38:07,356 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 00:38:07,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 00:38:07,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 00:38:07,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 00:38:07,378 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 00:38:07,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 00:38:07,388 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 00:38:07,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 00:38:07,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 00:38:07,401 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 00:38:07,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 00:38:07,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 00:38:07,411 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 00:38:07,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 00:38:07,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 00:38:07,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 00:38:07,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 00:38:07,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 00:38:07,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 00:38:07,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 00:38:07,427 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 00:38:07,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 00:38:07,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 00:38:07,429 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 00:38:07,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 00:38:07,432 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 00:38:07,433 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-13 00:38:07,498 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 00:38:07,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 00:38:07,504 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 00:38:07,504 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 00:38:07,513 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 00:38:07,515 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 00:38:07,515 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 00:38:07,516 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 00:38:07,516 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 00:38:07,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 00:38:07,518 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 00:38:07,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 00:38:07,519 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 00:38:07,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 00:38:07,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 00:38:07,520 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 00:38:07,520 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 00:38:07,520 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 00:38:07,520 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 00:38:07,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 00:38:07,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 00:38:07,521 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 00:38:07,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:38:07,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 00:38:07,522 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 00:38:07,523 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 00:38:07,523 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 00:38:07,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 00:38:07,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 00:38:07,526 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 00:38:07,527 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_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/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_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt 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 -> faad93e560ba524ae1ece04545479d8bfc495d5f [2021-10-13 00:38:07,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 00:38:07,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 00:38:07,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 00:38:07,960 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 00:38:07,961 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 00:38:07,962 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/recursive-simple/fibo_10-1.c [2021-10-13 00:38:08,058 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/data/b7a529c11/178d3d818b9b4b6abd0099a8521b2e98/FLAGa895e3cd7 [2021-10-13 00:38:08,547 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 00:38:08,559 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2021-10-13 00:38:08,574 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/data/b7a529c11/178d3d818b9b4b6abd0099a8521b2e98/FLAGa895e3cd7 [2021-10-13 00:38:08,944 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/data/b7a529c11/178d3d818b9b4b6abd0099a8521b2e98 [2021-10-13 00:38:08,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 00:38:08,948 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 00:38:08,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 00:38:08,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 00:38:08,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 00:38:08,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:38:08" (1/1) ... [2021-10-13 00:38:08,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10d4dfd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:08, skipping insertion in model container [2021-10-13 00:38:08,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:38:08" (1/1) ... [2021-10-13 00:38:08,967 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 00:38:08,983 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 00:38:09,182 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_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2021-10-13 00:38:09,186 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:38:09,197 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 00:38:09,215 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_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2021-10-13 00:38:09,216 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:38:09,230 INFO L208 MainTranslator]: Completed translation [2021-10-13 00:38:09,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:09 WrapperNode [2021-10-13 00:38:09,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 00:38:09,233 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 00:38:09,233 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 00:38:09,233 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 00:38:09,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:09" (1/1) ... [2021-10-13 00:38:09,251 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:09" (1/1) ... [2021-10-13 00:38:09,270 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 00:38:09,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 00:38:09,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 00:38:09,272 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 00:38:09,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:09" (1/1) ... [2021-10-13 00:38:09,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:09" (1/1) ... [2021-10-13 00:38:09,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:09" (1/1) ... [2021-10-13 00:38:09,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:09" (1/1) ... [2021-10-13 00:38:09,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:09" (1/1) ... [2021-10-13 00:38:09,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:09" (1/1) ... [2021-10-13 00:38:09,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:09" (1/1) ... [2021-10-13 00:38:09,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 00:38:09,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 00:38:09,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 00:38:09,296 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 00:38:09,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:09" (1/1) ... [2021-10-13 00:38:09,307 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:38:09,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:38:09,339 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 00:38:09,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 00:38:09,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 00:38:09,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 00:38:09,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 00:38:09,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 00:38:09,403 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2021-10-13 00:38:09,403 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2021-10-13 00:38:09,699 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 00:38:09,699 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-10-13 00:38:09,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:38:09 BoogieIcfgContainer [2021-10-13 00:38:09,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 00:38:09,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 00:38:09,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 00:38:09,718 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 00:38:09,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:38:08" (1/3) ... [2021-10-13 00:38:09,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3acfb004 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:38:09, skipping insertion in model container [2021-10-13 00:38:09,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:09" (2/3) ... [2021-10-13 00:38:09,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3acfb004 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:38:09, skipping insertion in model container [2021-10-13 00:38:09,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:38:09" (3/3) ... [2021-10-13 00:38:09,733 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2021-10-13 00:38:09,740 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 00:38:09,755 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-13 00:38:09,811 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 00:38:09,820 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, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 00:38:09,821 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-13 00:38:09,840 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-10-13 00:38:09,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 00:38:09,847 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:38:09,848 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:38:09,849 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:38:09,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:38:09,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1755511548, now seen corresponding path program 1 times [2021-10-13 00:38:09,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:38:09,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641806746] [2021-10-13 00:38:09,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:38:09,881 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:38:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:10,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 00:38:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:10,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:38:10,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:38:10,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641806746] [2021-10-13 00:38:10,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641806746] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:38:10,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:38:10,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:38:10,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740942641] [2021-10-13 00:38:10,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:38:10,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:38:10,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:38:10,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:38:10,303 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-10-13 00:38:10,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:38:10,350 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2021-10-13 00:38:10,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:38:10,353 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-10-13 00:38:10,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:38:10,363 INFO L225 Difference]: With dead ends: 34 [2021-10-13 00:38:10,363 INFO L226 Difference]: Without dead ends: 18 [2021-10-13 00:38:10,367 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.7ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:38:10,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-10-13 00:38:10,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-10-13 00:38:10,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-10-13 00:38:10,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-10-13 00:38:10,414 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2021-10-13 00:38:10,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:38:10,415 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-10-13 00:38:10,416 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-10-13 00:38:10,416 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-10-13 00:38:10,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 00:38:10,418 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:38:10,418 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:38:10,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 00:38:10,419 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:38:10,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:38:10,420 INFO L82 PathProgramCache]: Analyzing trace with hash 2128459596, now seen corresponding path program 1 times [2021-10-13 00:38:10,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:38:10,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681098363] [2021-10-13 00:38:10,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:38:10,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:38:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:10,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 00:38:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:10,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:38:10,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:38:10,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681098363] [2021-10-13 00:38:10,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681098363] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:38:10,533 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:38:10,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:38:10,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356736688] [2021-10-13 00:38:10,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:38:10,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:38:10,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:38:10,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:38:10,538 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-10-13 00:38:10,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:38:10,558 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-10-13 00:38:10,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:38:10,559 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-10-13 00:38:10,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:38:10,561 INFO L225 Difference]: With dead ends: 24 [2021-10-13 00:38:10,561 INFO L226 Difference]: Without dead ends: 20 [2021-10-13 00:38:10,562 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.5ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:38:10,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-10-13 00:38:10,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-10-13 00:38:10,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-10-13 00:38:10,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-10-13 00:38:10,571 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2021-10-13 00:38:10,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:38:10,571 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-10-13 00:38:10,572 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-10-13 00:38:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-10-13 00:38:10,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 00:38:10,574 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:38:10,574 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:38:10,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 00:38:10,575 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:38:10,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:38:10,576 INFO L82 PathProgramCache]: Analyzing trace with hash -42544313, now seen corresponding path program 1 times [2021-10-13 00:38:10,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:38:10,577 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494200069] [2021-10-13 00:38:10,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:38:10,578 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:38:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:10,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 00:38:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:10,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:10,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-13 00:38:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:10,738 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-13 00:38:10,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:38:10,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494200069] [2021-10-13 00:38:10,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494200069] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:38:10,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043095937] [2021-10-13 00:38:10,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:38:10,741 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:38:10,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:38:10,743 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:38:10,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 00:38:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:10,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-13 00:38:10,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:38:11,169 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-13 00:38:11,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043095937] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:38:11,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:38:11,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-10-13 00:38:11,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161137902] [2021-10-13 00:38:11,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 00:38:11,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:38:11,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 00:38:11,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:38:11,177 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-10-13 00:38:11,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:38:11,339 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2021-10-13 00:38:11,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 00:38:11,340 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-10-13 00:38:11,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:38:11,343 INFO L225 Difference]: With dead ends: 35 [2021-10-13 00:38:11,343 INFO L226 Difference]: Without dead ends: 20 [2021-10-13 00:38:11,347 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 122.4ms TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:38:11,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-10-13 00:38:11,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-10-13 00:38:11,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-10-13 00:38:11,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2021-10-13 00:38:11,367 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2021-10-13 00:38:11,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:38:11,367 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-10-13 00:38:11,369 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-10-13 00:38:11,370 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2021-10-13 00:38:11,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 00:38:11,373 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:38:11,373 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:38:11,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 00:38:11,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:38:11,596 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:38:11,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:38:11,597 INFO L82 PathProgramCache]: Analyzing trace with hash 170813287, now seen corresponding path program 1 times [2021-10-13 00:38:11,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:38:11,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67574465] [2021-10-13 00:38:11,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:38:11,598 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:38:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:11,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 00:38:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:11,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:11,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:11,801 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 00:38:11,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:38:11,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67574465] [2021-10-13 00:38:11,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67574465] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:38:11,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888537674] [2021-10-13 00:38:11,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:38:11,803 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:38:11,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:38:11,805 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:38:11,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-13 00:38:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:11,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-13 00:38:11,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:38:11,998 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 00:38:11,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888537674] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:38:11,999 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:38:11,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2021-10-13 00:38:12,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513190856] [2021-10-13 00:38:12,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 00:38:12,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:38:12,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 00:38:12,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:38:12,002 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-10-13 00:38:12,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:38:12,090 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2021-10-13 00:38:12,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:38:12,091 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-10-13 00:38:12,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:38:12,093 INFO L225 Difference]: With dead ends: 38 [2021-10-13 00:38:12,094 INFO L226 Difference]: Without dead ends: 34 [2021-10-13 00:38:12,095 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 49.3ms TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:38:12,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-10-13 00:38:12,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-10-13 00:38:12,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2021-10-13 00:38:12,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2021-10-13 00:38:12,106 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2021-10-13 00:38:12,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:38:12,107 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2021-10-13 00:38:12,107 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-10-13 00:38:12,107 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2021-10-13 00:38:12,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-13 00:38:12,110 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:38:12,110 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:38:12,155 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-13 00:38:12,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:38:12,324 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:38:12,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:38:12,325 INFO L82 PathProgramCache]: Analyzing trace with hash -187634876, now seen corresponding path program 2 times [2021-10-13 00:38:12,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:38:12,325 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519300765] [2021-10-13 00:38:12,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:38:12,326 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:38:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:12,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 00:38:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:12,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:12,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:12,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:12,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:12,512 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-10-13 00:38:12,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:38:12,514 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519300765] [2021-10-13 00:38:12,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519300765] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:38:12,519 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659982888] [2021-10-13 00:38:12,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-13 00:38:12,520 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:38:12,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:38:12,526 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:38:12,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-13 00:38:12,628 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-13 00:38:12,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 00:38:12,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-13 00:38:12,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:38:12,865 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-13 00:38:12,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659982888] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:38:12,866 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:38:12,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-10-13 00:38:12,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001796793] [2021-10-13 00:38:12,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 00:38:12,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:38:12,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 00:38:12,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:38:12,870 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-10-13 00:38:13,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:38:13,143 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2021-10-13 00:38:13,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-13 00:38:13,144 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-10-13 00:38:13,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:38:13,148 INFO L225 Difference]: With dead ends: 69 [2021-10-13 00:38:13,149 INFO L226 Difference]: Without dead ends: 38 [2021-10-13 00:38:13,158 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 168.5ms TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2021-10-13 00:38:13,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-10-13 00:38:13,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-10-13 00:38:13,173 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-10-13 00:38:13,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2021-10-13 00:38:13,177 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2021-10-13 00:38:13,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:38:13,177 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2021-10-13 00:38:13,188 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-10-13 00:38:13,188 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2021-10-13 00:38:13,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-10-13 00:38:13,191 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:38:13,191 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:38:13,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-13 00:38:13,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:38:13,416 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:38:13,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:38:13,416 INFO L82 PathProgramCache]: Analyzing trace with hash -2015531204, now seen corresponding path program 3 times [2021-10-13 00:38:13,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:38:13,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586770582] [2021-10-13 00:38:13,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:38:13,417 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:38:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:13,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 00:38:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:13,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:13,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:13,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:13,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:13,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:13,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:13,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:13,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:13,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:13,759 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-10-13 00:38:13,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:38:13,760 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586770582] [2021-10-13 00:38:13,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586770582] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:38:13,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060196242] [2021-10-13 00:38:13,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-13 00:38:13,762 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:38:13,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:38:13,763 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:38:13,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-13 00:38:13,877 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-10-13 00:38:13,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 00:38:13,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-13 00:38:13,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:38:14,117 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-10-13 00:38:14,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060196242] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:38:14,117 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:38:14,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 13 [2021-10-13 00:38:14,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553407111] [2021-10-13 00:38:14,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 00:38:14,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:38:14,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 00:38:14,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-10-13 00:38:14,122 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-10-13 00:38:14,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:38:14,323 INFO L93 Difference]: Finished difference Result 85 states and 124 transitions. [2021-10-13 00:38:14,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 00:38:14,324 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-10-13 00:38:14,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:38:14,327 INFO L225 Difference]: With dead ends: 85 [2021-10-13 00:38:14,327 INFO L226 Difference]: Without dead ends: 50 [2021-10-13 00:38:14,329 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 117.4ms TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:38:14,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-10-13 00:38:14,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2021-10-13 00:38:14,338 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-10-13 00:38:14,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2021-10-13 00:38:14,339 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 65 [2021-10-13 00:38:14,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:38:14,351 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2021-10-13 00:38:14,352 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-10-13 00:38:14,352 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2021-10-13 00:38:14,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-10-13 00:38:14,358 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:38:14,358 INFO L512 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:38:14,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-13 00:38:14,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-10-13 00:38:14,559 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:38:14,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:38:14,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1033750100, now seen corresponding path program 4 times [2021-10-13 00:38:14,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:38:14,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826793473] [2021-10-13 00:38:14,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:38:14,560 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:38:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:14,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 00:38:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:14,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:14,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:14,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:14,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:14,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:14,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:14,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:14,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:14,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:14,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 00:38:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:14,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:15,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:15,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:15,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:15,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:15,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:15,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:15,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:15,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:15,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 00:38:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:15,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2021-10-13 00:38:15,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:38:15,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826793473] [2021-10-13 00:38:15,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826793473] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:38:15,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895722833] [2021-10-13 00:38:15,070 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-13 00:38:15,071 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:38:15,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:38:15,072 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:38:15,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-13 00:38:15,229 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-13 00:38:15,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 00:38:15,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjunts are in the unsatisfiable core [2021-10-13 00:38:15,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:38:15,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2021-10-13 00:38:15,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895722833] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:38:15,637 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:38:15,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 14 [2021-10-13 00:38:15,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964395487] [2021-10-13 00:38:15,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-13 00:38:15,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:38:15,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-13 00:38:15,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-10-13 00:38:15,647 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-10-13 00:38:15,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:38:15,841 INFO L93 Difference]: Finished difference Result 117 states and 176 transitions. [2021-10-13 00:38:15,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 00:38:15,848 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-10-13 00:38:15,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:38:15,852 INFO L225 Difference]: With dead ends: 117 [2021-10-13 00:38:15,852 INFO L226 Difference]: Without dead ends: 113 [2021-10-13 00:38:15,859 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 87.9ms TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-10-13 00:38:15,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-10-13 00:38:15,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2021-10-13 00:38:15,901 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-10-13 00:38:15,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 159 transitions. [2021-10-13 00:38:15,906 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 159 transitions. Word has length 147 [2021-10-13 00:38:15,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:38:15,907 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 159 transitions. [2021-10-13 00:38:15,907 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-10-13 00:38:15,908 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 159 transitions. [2021-10-13 00:38:15,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2021-10-13 00:38:15,914 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:38:15,914 INFO L512 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:38:15,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-13 00:38:16,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-10-13 00:38:16,115 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:38:16,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:38:16,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1022210831, now seen corresponding path program 5 times [2021-10-13 00:38:16,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:38:16,116 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692254516] [2021-10-13 00:38:16,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:38:16,117 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:38:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 00:38:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 00:38:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-13 00:38:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 00:38:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:16,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 403 proven. 706 refuted. 0 times theorem prover too weak. 1471 trivial. 0 not checked. [2021-10-13 00:38:16,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:38:16,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692254516] [2021-10-13 00:38:16,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692254516] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:38:16,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331581087] [2021-10-13 00:38:16,989 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-10-13 00:38:16,989 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:38:16,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:38:16,995 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:38:17,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-13 00:38:17,248 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2021-10-13 00:38:17,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 00:38:17,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjunts are in the unsatisfiable core [2021-10-13 00:38:17,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:38:18,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 630 proven. 571 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2021-10-13 00:38:18,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331581087] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:38:18,049 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:38:18,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 25 [2021-10-13 00:38:18,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298673168] [2021-10-13 00:38:18,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-13 00:38:18,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:38:18,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-13 00:38:18,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2021-10-13 00:38:18,053 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-10-13 00:38:18,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:38:18,700 INFO L93 Difference]: Finished difference Result 193 states and 365 transitions. [2021-10-13 00:38:18,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-10-13 00:38:18,701 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-10-13 00:38:18,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:38:18,705 INFO L225 Difference]: With dead ends: 193 [2021-10-13 00:38:18,705 INFO L226 Difference]: Without dead ends: 95 [2021-10-13 00:38:18,710 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 482.9ms TimeCoverageRelationStatistics Valid=388, Invalid=1418, Unknown=0, NotChecked=0, Total=1806 [2021-10-13 00:38:18,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-10-13 00:38:18,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2021-10-13 00:38:18,724 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-10-13 00:38:18,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2021-10-13 00:38:18,727 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 215 [2021-10-13 00:38:18,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:38:18,728 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2021-10-13 00:38:18,728 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-10-13 00:38:18,729 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2021-10-13 00:38:18,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2021-10-13 00:38:18,737 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:38:18,737 INFO L512 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:38:18,785 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-10-13 00:38:18,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:38:18,963 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:38:18,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:38:18,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1843553927, now seen corresponding path program 6 times [2021-10-13 00:38:18,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:38:18,964 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271923713] [2021-10-13 00:38:18,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:38:18,965 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:38:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 00:38:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 00:38:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-13 00:38:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-10-13 00:38:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 00:38:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:19,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:20,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:20,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:20,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:20,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-13 00:38:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:20,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:20,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:20,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:20,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:20,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:20,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:20,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:20,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:20,062 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 844 proven. 1612 refuted. 0 times theorem prover too weak. 4664 trivial. 0 not checked. [2021-10-13 00:38:20,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:38:20,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271923713] [2021-10-13 00:38:20,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271923713] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:38:20,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622662083] [2021-10-13 00:38:20,063 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-10-13 00:38:20,063 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:38:20,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:38:20,065 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:38:20,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-13 00:38:20,426 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2021-10-13 00:38:20,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 00:38:20,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-13 00:38:20,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:38:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 356 proven. 1124 refuted. 0 times theorem prover too weak. 5640 trivial. 0 not checked. [2021-10-13 00:38:21,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622662083] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:38:21,592 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:38:21,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10] total 26 [2021-10-13 00:38:21,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769147201] [2021-10-13 00:38:21,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-10-13 00:38:21,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:38:21,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-10-13 00:38:21,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2021-10-13 00:38:21,598 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-10-13 00:38:22,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:38:22,282 INFO L93 Difference]: Finished difference Result 186 states and 295 transitions. [2021-10-13 00:38:22,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-10-13 00:38:22,283 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-10-13 00:38:22,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:38:22,286 INFO L225 Difference]: With dead ends: 186 [2021-10-13 00:38:22,286 INFO L226 Difference]: Without dead ends: 113 [2021-10-13 00:38:22,289 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 479.8ms TimeCoverageRelationStatistics Valid=422, Invalid=1470, Unknown=0, NotChecked=0, Total=1892 [2021-10-13 00:38:22,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-10-13 00:38:22,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 101. [2021-10-13 00:38:22,309 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-10-13 00:38:22,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 136 transitions. [2021-10-13 00:38:22,311 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 136 transitions. Word has length 351 [2021-10-13 00:38:22,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:38:22,312 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 136 transitions. [2021-10-13 00:38:22,313 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-10-13 00:38:22,313 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 136 transitions. [2021-10-13 00:38:22,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2021-10-13 00:38:22,331 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:38:22,331 INFO L512 BasicCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:38:22,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-10-13 00:38:22,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:38:22,547 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:38:22,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:38:22,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1550468663, now seen corresponding path program 7 times [2021-10-13 00:38:22,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:38:22,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109494189] [2021-10-13 00:38:22,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:38:22,548 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:38:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:23,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 00:38:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:23,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:23,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:23,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 00:38:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-13 00:38:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-10-13 00:38:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 00:38:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-10-13 00:38:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 00:38:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-13 00:38:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-10-13 00:38:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 00:38:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:24,921 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1691 proven. 3390 refuted. 0 times theorem prover too weak. 14022 trivial. 0 not checked. [2021-10-13 00:38:24,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:38:24,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109494189] [2021-10-13 00:38:24,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109494189] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:38:24,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405727463] [2021-10-13 00:38:24,922 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-10-13 00:38:24,922 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:38:24,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:38:24,923 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:38:24,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-10-13 00:38:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:25,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 1293 conjuncts, 18 conjunts are in the unsatisfiable core [2021-10-13 00:38:25,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:38:27,270 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 401 proven. 2942 refuted. 0 times theorem prover too weak. 15760 trivial. 0 not checked. [2021-10-13 00:38:27,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405727463] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:38:27,271 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:38:27,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 12] total 30 [2021-10-13 00:38:27,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178000210] [2021-10-13 00:38:27,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-13 00:38:27,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:38:27,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-13 00:38:27,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2021-10-13 00:38:27,276 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-10-13 00:38:28,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:38:28,156 INFO L93 Difference]: Finished difference Result 228 states and 374 transitions. [2021-10-13 00:38:28,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-10-13 00:38:28,156 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-10-13 00:38:28,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:38:28,159 INFO L225 Difference]: With dead ends: 228 [2021-10-13 00:38:28,159 INFO L226 Difference]: Without dead ends: 138 [2021-10-13 00:38:28,162 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 734 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 535.3ms TimeCoverageRelationStatistics Valid=558, Invalid=2094, Unknown=0, NotChecked=0, Total=2652 [2021-10-13 00:38:28,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-10-13 00:38:28,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 118. [2021-10-13 00:38:28,180 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-10-13 00:38:28,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 164 transitions. [2021-10-13 00:38:28,196 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 164 transitions. Word has length 569 [2021-10-13 00:38:28,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:38:28,197 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 164 transitions. [2021-10-13 00:38:28,198 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-10-13 00:38:28,198 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2021-10-13 00:38:28,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 924 [2021-10-13 00:38:28,246 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:38:28,247 INFO L512 BasicCegarLoop]: trace histogram [135, 135, 109, 67, 67, 67, 67, 67, 67, 67, 42, 26, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:38:28,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-10-13 00:38:28,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-10-13 00:38:28,461 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:38:28,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:38:28,462 INFO L82 PathProgramCache]: Analyzing trace with hash -586878367, now seen corresponding path program 8 times [2021-10-13 00:38:28,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:38:28,462 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141902067] [2021-10-13 00:38:28,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:38:28,462 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:38:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:29,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 00:38:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:30,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:30,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:30,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:30,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:30,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:30,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:30,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:30,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:30,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:30,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:30,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:30,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:30,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 00:38:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-13 00:38:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-10-13 00:38:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 00:38:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-10-13 00:38:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 00:38:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-13 00:38:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2021-10-13 00:38:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 00:38:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-13 00:38:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:31,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-10-13 00:38:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:32,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 00:38:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-10-13 00:38:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 00:38:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-13 00:38:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:32,279 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 3273 proven. 6787 refuted. 0 times theorem prover too weak. 40850 trivial. 0 not checked. [2021-10-13 00:38:32,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:38:32,279 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141902067] [2021-10-13 00:38:32,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141902067] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:38:32,280 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514116619] [2021-10-13 00:38:32,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-13 00:38:32,280 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:38:32,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:38:32,282 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:38:32,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-10-13 00:38:33,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-13 00:38:33,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 00:38:33,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 2079 conjuncts, 20 conjunts are in the unsatisfiable core [2021-10-13 00:38:33,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:38:35,992 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 724 proven. 5622 refuted. 0 times theorem prover too weak. 44564 trivial. 0 not checked. [2021-10-13 00:38:35,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514116619] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:38:35,993 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:38:35,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 13] total 34 [2021-10-13 00:38:35,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90535251] [2021-10-13 00:38:35,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-10-13 00:38:35,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:38:35,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-10-13 00:38:35,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=882, Unknown=0, NotChecked=0, Total=1122 [2021-10-13 00:38:35,998 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-10-13 00:38:37,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:38:37,026 INFO L93 Difference]: Finished difference Result 266 states and 450 transitions. [2021-10-13 00:38:37,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-10-13 00:38:37,027 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-10-13 00:38:37,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:38:37,039 INFO L225 Difference]: With dead ends: 266 [2021-10-13 00:38:37,039 INFO L226 Difference]: Without dead ends: 159 [2021-10-13 00:38:37,043 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1250 GetRequests, 1192 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 703.3ms TimeCoverageRelationStatistics Valid=712, Invalid=2828, Unknown=0, NotChecked=0, Total=3540 [2021-10-13 00:38:37,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-10-13 00:38:37,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 135. [2021-10-13 00:38:37,087 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-10-13 00:38:37,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 193 transitions. [2021-10-13 00:38:37,095 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 193 transitions. Word has length 923 [2021-10-13 00:38:37,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:38:37,103 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 193 transitions. [2021-10-13 00:38:37,103 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-10-13 00:38:37,104 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 193 transitions. [2021-10-13 00:38:37,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1496 [2021-10-13 00:38:37,143 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:38:37,144 INFO L512 BasicCegarLoop]: trace histogram [219, 219, 177, 109, 109, 109, 109, 109, 109, 109, 68, 42, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:38:37,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-10-13 00:38:37,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:38:37,357 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:38:37,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:38:37,358 INFO L82 PathProgramCache]: Analyzing trace with hash -670718281, now seen corresponding path program 9 times [2021-10-13 00:38:37,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:38:37,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892267737] [2021-10-13 00:38:37,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:38:37,359 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:38:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:39,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 00:38:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:40,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:40,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 00:38:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-13 00:38:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-10-13 00:38:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 00:38:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-10-13 00:38:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 00:38:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-13 00:38:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2021-10-13 00:38:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 00:38:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-13 00:38:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-10-13 00:38:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 00:38:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:41,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2021-10-13 00:38:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:42,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:42,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:42,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:42,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:42,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:42,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:42,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:42,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:42,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:42,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:42,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:42,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:42,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:42,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 00:38:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:42,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:42,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:42,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-13 00:38:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-10-13 00:38:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 00:38:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-10-13 00:38:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 00:38:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-13 00:38:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2021-10-13 00:38:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 00:38:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-13 00:38:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-10-13 00:38:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-13 00:38:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-13 00:38:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 00:38:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-13 00:38:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-13 00:38:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:38:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 6145 proven. 13082 refuted. 0 times theorem prover too weak. 115377 trivial. 0 not checked. [2021-10-13 00:38:43,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:38:43,586 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892267737] [2021-10-13 00:38:43,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892267737] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:38:43,586 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143318165] [2021-10-13 00:38:43,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-13 00:38:43,587 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 00:38:43,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:38:43,592 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 00:38:43,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-10-13 00:38:45,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 104 check-sat command(s) [2021-10-13 00:38:45,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 00:38:45,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 1882 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-13 00:38:45,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:38:49,064 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 5994 proven. 991 refuted. 0 times theorem prover too weak. 127619 trivial. 0 not checked. [2021-10-13 00:38:49,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143318165] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 00:38:49,065 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 00:38:49,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 10] total 40 [2021-10-13 00:38:49,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812228266] [2021-10-13 00:38:49,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-10-13 00:38:49,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:38:49,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-10-13 00:38:49,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=1240, Unknown=0, NotChecked=0, Total=1560 [2021-10-13 00:38:49,076 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-10-13 00:38:50,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:38:50,652 INFO L93 Difference]: Finished difference Result 343 states and 686 transitions. [2021-10-13 00:38:50,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-10-13 00:38:50,653 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-10-13 00:38:50,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:38:50,660 INFO L225 Difference]: With dead ends: 343 [2021-10-13 00:38:50,660 INFO L226 Difference]: Without dead ends: 191 [2021-10-13 00:38:50,666 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2003 GetRequests, 1930 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 964.8ms TimeCoverageRelationStatistics Valid=1021, Invalid=4529, Unknown=0, NotChecked=0, Total=5550 [2021-10-13 00:38:50,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-10-13 00:38:50,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 161. [2021-10-13 00:38:50,685 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-10-13 00:38:50,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 222 transitions. [2021-10-13 00:38:50,688 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 222 transitions. Word has length 1495 [2021-10-13 00:38:50,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:38:50,691 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 222 transitions. [2021-10-13 00:38:50,691 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-10-13 00:38:50,692 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 222 transitions. [2021-10-13 00:38:50,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2021-10-13 00:38:50,707 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:38:50,708 INFO L512 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:38:50,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-10-13 00:38:50,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-10-13 00:38:50,934 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:38:50,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:38:50,934 INFO L82 PathProgramCache]: Analyzing trace with hash 15284780, now seen corresponding path program 10 times [2021-10-13 00:38:50,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:38:50,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162154189] [2021-10-13 00:38:50,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:38:50,935 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:38:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:38:51,315 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:38:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:38:52,484 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:38:52,485 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 00:38:52,485 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:38:52,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 00:38:52,495 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 00:38:52,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:38:52 BoogieIcfgContainer [2021-10-13 00:38:52,876 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 00:38:52,877 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 00:38:52,877 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 00:38:52,878 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 00:38:52,878 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:38:09" (3/4) ... [2021-10-13 00:38:52,881 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 00:38:53,250 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 00:38:53,250 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 00:38:53,252 INFO L168 Benchmark]: Toolchain (without parser) took 44302.60 ms. Allocated memory was 90.2 MB in the beginning and 436.2 MB in the end (delta: 346.0 MB). Free memory was 57.7 MB in the beginning and 93.5 MB in the end (delta: -35.8 MB). Peak memory consumption was 309.9 MB. Max. memory is 16.1 GB. [2021-10-13 00:38:53,253 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 90.2 MB. Free memory was 63.8 MB in the beginning and 63.8 MB in the end (delta: 29.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:38:53,254 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.31 ms. Allocated memory is still 90.2 MB. Free memory was 57.5 MB in the beginning and 68.1 MB in the end (delta: -10.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 00:38:53,254 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.58 ms. Allocated memory is still 90.2 MB. Free memory was 68.1 MB in the beginning and 66.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:38:53,255 INFO L168 Benchmark]: Boogie Preprocessor took 23.43 ms. Allocated memory is still 90.2 MB. Free memory was 66.8 MB in the beginning and 65.7 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:38:53,255 INFO L168 Benchmark]: RCFGBuilder took 406.12 ms. Allocated memory is still 90.2 MB. Free memory was 65.7 MB in the beginning and 56.4 MB in the end (delta: 9.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 00:38:53,256 INFO L168 Benchmark]: TraceAbstraction took 43162.82 ms. Allocated memory was 90.2 MB in the beginning and 436.2 MB in the end (delta: 346.0 MB). Free memory was 56.0 MB in the beginning and 141.7 MB in the end (delta: -85.7 MB). Peak memory consumption was 331.4 MB. Max. memory is 16.1 GB. [2021-10-13 00:38:53,256 INFO L168 Benchmark]: Witness Printer took 373.18 ms. Allocated memory is still 436.2 MB. Free memory was 141.7 MB in the beginning and 93.5 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 16.1 GB. [2021-10-13 00:38:53,259 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 90.2 MB. Free memory was 63.8 MB in the beginning and 63.8 MB in the end (delta: 29.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 281.31 ms. Allocated memory is still 90.2 MB. Free memory was 57.5 MB in the beginning and 68.1 MB in the end (delta: -10.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 37.58 ms. Allocated memory is still 90.2 MB. Free memory was 68.1 MB in the beginning and 66.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 23.43 ms. Allocated memory is still 90.2 MB. Free memory was 66.8 MB in the beginning and 65.7 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 406.12 ms. Allocated memory is still 90.2 MB. Free memory was 65.7 MB in the beginning and 56.4 MB in the end (delta: 9.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 43162.82 ms. Allocated memory was 90.2 MB in the beginning and 436.2 MB in the end (delta: 346.0 MB). Free memory was 56.0 MB in the beginning and 141.7 MB in the end (delta: -85.7 MB). Peak memory consumption was 331.4 MB. Max. memory is 16.1 GB. * Witness Printer took 373.18 ms. Allocated memory is still 436.2 MB. Free memory was 141.7 MB in the beginning and 93.5 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.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms 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: 42681.7ms, OverallIterations: 13, TraceHistogramMax: 219, EmptinessCheckTime: 165.0ms, AutomataDifference: 5954.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 14.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 292 SDtfs, 1338 SDslu, 1173 SDs, 0 SdLazy, 3490 SolverSat, 1643 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2752.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5295 GetRequests, 4961 SyntacticMatches, 3 SemanticMatches, 331 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4576 ImplicationChecksByTransitivity, 3769.5ms Time, 0.0ms 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.0ms DumpTime, AutomataMinimizationStatistics: 286.4ms AutomataMinimizationTime, 12 MinimizatonAttempts, 111 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 411.2ms SsaConstructionTime, 2937.4ms SatisfiabilityAnalysisTime, 26133.4ms 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-10-13 00:38:53,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2250bdb7-c4e1-42c0-bdb3-722c9fa6868c/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...