./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_71952414-7cd5-4904-a91a-ce2c5644045d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_71952414-7cd5-4904-a91a-ce2c5644045d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_71952414-7cd5-4904-a91a-ce2c5644045d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_71952414-7cd5-4904-a91a-ce2c5644045d/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_71952414-7cd5-4904-a91a-ce2c5644045d/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_71952414-7cd5-4904-a91a-ce2c5644045d/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3aee1e8d9b723b18f218b6c1185554e637930c5d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:52:01,402 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:52:01,404 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:52:01,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:52:01,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:52:01,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:52:01,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:52:01,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:52:01,434 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:52:01,438 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:52:01,439 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:52:01,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:52:01,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:52:01,443 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:52:01,444 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:52:01,445 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:52:01,445 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:52:01,446 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:52:01,448 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:52:01,452 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:52:01,454 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:52:01,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:52:01,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:52:01,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:52:01,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:52:01,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:52:01,463 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:52:01,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:52:01,464 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:52:01,465 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:52:01,465 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:52:01,466 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:52:01,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:52:01,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:52:01,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:52:01,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:52:01,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:52:01,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:52:01,470 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:52:01,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:52:01,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:52:01,472 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_71952414-7cd5-4904-a91a-ce2c5644045d/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 21:52:01,495 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:52:01,505 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:52:01,506 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:52:01,506 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:52:01,507 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:52:01,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:52:01,507 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:52:01,507 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:52:01,508 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:52:01,508 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:52:01,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:52:01,508 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 21:52:01,509 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 21:52:01,509 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 21:52:01,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:52:01,510 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:52:01,510 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:52:01,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:52:01,511 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:52:01,511 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:52:01,511 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:52:01,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:52:01,512 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:52:01,512 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:52:01,512 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:52:01,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:52:01,513 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-vcloud-master/worker/run_dir_71952414-7cd5-4904-a91a-ce2c5644045d/bin/uautomizer 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 3aee1e8d9b723b18f218b6c1185554e637930c5d [2019-11-15 21:52:01,538 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:52:01,547 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:52:01,550 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:52:01,553 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:52:01,554 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:52:01,554 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_71952414-7cd5-4904-a91a-ce2c5644045d/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2019-11-15 21:52:01,613 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_71952414-7cd5-4904-a91a-ce2c5644045d/bin/uautomizer/data/6f22e1c9c/3c818c45c3fd41c081e735bfbad92361/FLAGdfe1fa6cf [2019-11-15 21:52:02,068 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:52:02,069 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_71952414-7cd5-4904-a91a-ce2c5644045d/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2019-11-15 21:52:02,081 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_71952414-7cd5-4904-a91a-ce2c5644045d/bin/uautomizer/data/6f22e1c9c/3c818c45c3fd41c081e735bfbad92361/FLAGdfe1fa6cf [2019-11-15 21:52:02,092 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_71952414-7cd5-4904-a91a-ce2c5644045d/bin/uautomizer/data/6f22e1c9c/3c818c45c3fd41c081e735bfbad92361 [2019-11-15 21:52:02,094 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:52:02,095 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 21:52:02,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:52:02,096 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:52:02,099 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:52:02,100 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:52:02" (1/1) ... [2019-11-15 21:52:02,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df6e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:02, skipping insertion in model container [2019-11-15 21:52:02,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:52:02" (1/1) ... [2019-11-15 21:52:02,109 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:52:02,152 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:52:02,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:52:02,535 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:52:02,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:52:02,631 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:52:02,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:02 WrapperNode [2019-11-15 21:52:02,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:52:02,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:52:02,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:52:02,633 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:52:02,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:02" (1/1) ... [2019-11-15 21:52:02,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:02" (1/1) ... [2019-11-15 21:52:02,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:02" (1/1) ... [2019-11-15 21:52:02,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:02" (1/1) ... [2019-11-15 21:52:02,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:02" (1/1) ... [2019-11-15 21:52:02,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:02" (1/1) ... [2019-11-15 21:52:02,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:02" (1/1) ... [2019-11-15 21:52:02,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:52:02,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:52:02,695 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:52:02,695 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:52:02,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_71952414-7cd5-4904-a91a-ce2c5644045d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:52:02,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 21:52:02,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:52:02,757 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 21:52:02,757 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 21:52:02,757 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 21:52:02,757 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 21:52:02,758 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 21:52:02,758 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 21:52:02,758 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 21:52:02,758 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 21:52:02,758 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 21:52:02,759 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 21:52:02,759 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 21:52:02,759 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 21:52:02,759 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 21:52:02,759 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 21:52:02,760 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 21:52:02,760 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 21:52:02,760 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 21:52:02,760 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 21:52:02,760 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 21:52:02,761 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 21:52:02,761 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 21:52:02,761 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 21:52:02,761 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 21:52:02,762 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 21:52:02,762 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 21:52:02,762 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 21:52:02,762 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 21:52:02,762 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 21:52:02,762 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 21:52:02,763 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 21:52:02,763 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 21:52:02,763 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 21:52:02,763 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 21:52:02,763 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 21:52:02,763 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 21:52:02,764 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 21:52:02,764 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 21:52:02,764 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 21:52:02,764 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 21:52:02,764 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 21:52:02,764 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 21:52:02,765 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 21:52:02,765 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 21:52:02,765 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 21:52:02,765 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 21:52:02,765 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 21:52:02,765 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 21:52:02,766 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 21:52:02,766 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 21:52:02,766 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 21:52:02,766 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 21:52:02,766 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 21:52:02,766 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 21:52:02,767 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 21:52:02,767 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 21:52:02,767 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 21:52:02,767 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 21:52:02,767 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 21:52:02,767 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 21:52:02,768 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 21:52:02,768 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 21:52:02,768 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 21:52:02,768 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 21:52:02,768 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 21:52:02,768 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 21:52:02,769 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 21:52:02,769 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 21:52:02,769 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 21:52:02,769 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 21:52:02,769 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 21:52:02,769 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 21:52:02,770 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 21:52:02,770 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 21:52:02,770 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 21:52:02,770 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 21:52:02,770 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 21:52:02,770 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 21:52:02,771 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 21:52:02,771 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 21:52:02,771 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 21:52:02,771 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 21:52:02,771 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 21:52:02,771 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 21:52:02,772 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 21:52:02,772 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 21:52:02,772 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 21:52:02,772 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 21:52:02,772 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 21:52:02,772 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 21:52:02,773 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 21:52:02,773 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 21:52:02,773 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 21:52:02,773 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 21:52:02,773 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 21:52:02,773 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 21:52:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 21:52:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 21:52:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 21:52:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 21:52:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 21:52:02,775 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 21:52:02,775 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 21:52:02,775 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 21:52:02,775 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 21:52:02,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 21:52:02,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 21:52:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 21:52:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:52:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:52:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:52:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:52:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:52:02,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:52:02,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 21:52:02,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:52:03,511 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:52:03,511 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 21:52:03,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:52:03 BoogieIcfgContainer [2019-11-15 21:52:03,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:52:03,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:52:03,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:52:03,516 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:52:03,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:52:02" (1/3) ... [2019-11-15 21:52:03,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19052038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:52:03, skipping insertion in model container [2019-11-15 21:52:03,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:52:02" (2/3) ... [2019-11-15 21:52:03,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19052038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:52:03, skipping insertion in model container [2019-11-15 21:52:03,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:52:03" (3/3) ... [2019-11-15 21:52:03,519 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-2.i [2019-11-15 21:52:03,527 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:52:03,534 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 52 error locations. [2019-11-15 21:52:03,550 INFO L249 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2019-11-15 21:52:03,570 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:52:03,573 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 21:52:03,573 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:52:03,574 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:52:03,574 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:52:03,574 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:52:03,574 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:52:03,574 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:52:03,596 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states. [2019-11-15 21:52:03,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 21:52:03,603 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:03,604 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:03,606 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION]=== [2019-11-15 21:52:03,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:03,611 INFO L82 PathProgramCache]: Analyzing trace with hash -250439764, now seen corresponding path program 1 times [2019-11-15 21:52:03,617 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:03,617 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212046551] [2019-11-15 21:52:03,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:03,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:03,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:03,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:03,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212046551] [2019-11-15 21:52:03,784 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:03,784 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:52:03,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045261535] [2019-11-15 21:52:03,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:03,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:03,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:03,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:03,801 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 4 states. [2019-11-15 21:52:04,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:04,167 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2019-11-15 21:52:04,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:52:04,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 21:52:04,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:04,177 INFO L225 Difference]: With dead ends: 119 [2019-11-15 21:52:04,178 INFO L226 Difference]: Without dead ends: 115 [2019-11-15 21:52:04,179 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:52:04,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-15 21:52:04,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2019-11-15 21:52:04,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-15 21:52:04,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2019-11-15 21:52:04,226 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 7 [2019-11-15 21:52:04,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:04,226 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2019-11-15 21:52:04,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:04,226 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2019-11-15 21:52:04,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 21:52:04,227 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:04,227 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:04,227 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION]=== [2019-11-15 21:52:04,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:04,228 INFO L82 PathProgramCache]: Analyzing trace with hash -250439763, now seen corresponding path program 1 times [2019-11-15 21:52:04,228 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:04,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485164786] [2019-11-15 21:52:04,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:04,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:04,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:04,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485164786] [2019-11-15 21:52:04,313 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:04,313 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:52:04,313 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311754875] [2019-11-15 21:52:04,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:52:04,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:04,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:52:04,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:04,316 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 4 states. [2019-11-15 21:52:04,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:04,765 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2019-11-15 21:52:04,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:52:04,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 21:52:04,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:04,767 INFO L225 Difference]: With dead ends: 129 [2019-11-15 21:52:04,767 INFO L226 Difference]: Without dead ends: 129 [2019-11-15 21:52:04,768 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:52:04,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-15 21:52:04,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 116. [2019-11-15 21:52:04,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-15 21:52:04,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2019-11-15 21:52:04,777 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 7 [2019-11-15 21:52:04,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:04,777 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2019-11-15 21:52:04,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:52:04,777 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2019-11-15 21:52:04,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 21:52:04,778 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:04,778 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:04,779 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION]=== [2019-11-15 21:52:04,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:04,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1172744574, now seen corresponding path program 1 times [2019-11-15 21:52:04,779 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:04,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127604958] [2019-11-15 21:52:04,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:04,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:04,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:04,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:04,860 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127604958] [2019-11-15 21:52:04,861 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:04,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:52:04,861 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864747631] [2019-11-15 21:52:04,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:52:04,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:04,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:52:04,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:52:04,862 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 5 states. [2019-11-15 21:52:05,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:05,135 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2019-11-15 21:52:05,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:52:05,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-15 21:52:05,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:05,137 INFO L225 Difference]: With dead ends: 123 [2019-11-15 21:52:05,137 INFO L226 Difference]: Without dead ends: 123 [2019-11-15 21:52:05,138 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:52:05,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-15 21:52:05,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2019-11-15 21:52:05,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-15 21:52:05,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2019-11-15 21:52:05,147 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 12 [2019-11-15 21:52:05,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:05,147 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2019-11-15 21:52:05,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:52:05,147 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2019-11-15 21:52:05,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 21:52:05,148 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:05,148 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:05,153 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION]=== [2019-11-15 21:52:05,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:05,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1172744573, now seen corresponding path program 1 times [2019-11-15 21:52:05,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:05,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503716604] [2019-11-15 21:52:05,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:05,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:05,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:05,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:05,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503716604] [2019-11-15 21:52:05,318 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:05,318 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:52:05,318 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924725482] [2019-11-15 21:52:05,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:52:05,319 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:05,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:52:05,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:52:05,319 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 8 states. [2019-11-15 21:52:05,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:05,740 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2019-11-15 21:52:05,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:52:05,741 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-11-15 21:52:05,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:05,742 INFO L225 Difference]: With dead ends: 140 [2019-11-15 21:52:05,742 INFO L226 Difference]: Without dead ends: 140 [2019-11-15 21:52:05,743 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:52:05,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-15 21:52:05,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 117. [2019-11-15 21:52:05,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-15 21:52:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2019-11-15 21:52:05,751 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 12 [2019-11-15 21:52:05,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:05,751 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2019-11-15 21:52:05,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:52:05,752 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2019-11-15 21:52:05,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 21:52:05,752 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:05,752 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:05,753 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION]=== [2019-11-15 21:52:05,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:05,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1969625224, now seen corresponding path program 1 times [2019-11-15 21:52:05,754 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:05,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126494853] [2019-11-15 21:52:05,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:05,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:05,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:05,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:05,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126494853] [2019-11-15 21:52:05,834 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:05,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:52:05,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720855021] [2019-11-15 21:52:05,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:52:05,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:05,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:52:05,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:52:05,836 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand 7 states. [2019-11-15 21:52:06,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:06,302 INFO L93 Difference]: Finished difference Result 191 states and 208 transitions. [2019-11-15 21:52:06,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:52:06,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-15 21:52:06,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:06,304 INFO L225 Difference]: With dead ends: 191 [2019-11-15 21:52:06,304 INFO L226 Difference]: Without dead ends: 191 [2019-11-15 21:52:06,304 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:52:06,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-15 21:52:06,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 116. [2019-11-15 21:52:06,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-15 21:52:06,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2019-11-15 21:52:06,314 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 15 [2019-11-15 21:52:06,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:06,314 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2019-11-15 21:52:06,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:52:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2019-11-15 21:52:06,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 21:52:06,315 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:06,315 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:06,316 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION]=== [2019-11-15 21:52:06,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:06,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1969625223, now seen corresponding path program 1 times [2019-11-15 21:52:06,316 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:06,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678782095] [2019-11-15 21:52:06,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:06,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:06,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:06,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:06,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678782095] [2019-11-15 21:52:06,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:06,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:52:06,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530287005] [2019-11-15 21:52:06,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:52:06,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:06,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:52:06,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:52:06,404 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand 7 states. [2019-11-15 21:52:06,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:06,931 INFO L93 Difference]: Finished difference Result 194 states and 214 transitions. [2019-11-15 21:52:06,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:52:06,937 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-15 21:52:06,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:06,938 INFO L225 Difference]: With dead ends: 194 [2019-11-15 21:52:06,938 INFO L226 Difference]: Without dead ends: 194 [2019-11-15 21:52:06,939 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:52:06,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-15 21:52:06,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 111. [2019-11-15 21:52:06,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-15 21:52:06,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2019-11-15 21:52:06,946 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 15 [2019-11-15 21:52:06,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:06,947 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2019-11-15 21:52:06,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:52:06,947 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2019-11-15 21:52:06,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 21:52:06,948 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:06,948 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:06,949 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION]=== [2019-11-15 21:52:06,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:06,949 INFO L82 PathProgramCache]: Analyzing trace with hash -584261800, now seen corresponding path program 1 times [2019-11-15 21:52:06,949 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:06,950 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783297461] [2019-11-15 21:52:06,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:06,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:06,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:07,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:07,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783297461] [2019-11-15 21:52:07,018 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:07,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:52:07,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067672742] [2019-11-15 21:52:07,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:52:07,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:07,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:52:07,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:52:07,020 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand 6 states. [2019-11-15 21:52:07,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:07,217 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2019-11-15 21:52:07,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:52:07,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-15 21:52:07,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:07,218 INFO L225 Difference]: With dead ends: 133 [2019-11-15 21:52:07,218 INFO L226 Difference]: Without dead ends: 133 [2019-11-15 21:52:07,219 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:52:07,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-15 21:52:07,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 111. [2019-11-15 21:52:07,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-15 21:52:07,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2019-11-15 21:52:07,223 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 21 [2019-11-15 21:52:07,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:07,224 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2019-11-15 21:52:07,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:52:07,224 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2019-11-15 21:52:07,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 21:52:07,225 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:07,225 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:07,225 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION]=== [2019-11-15 21:52:07,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:07,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1176305992, now seen corresponding path program 1 times [2019-11-15 21:52:07,226 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:07,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013753265] [2019-11-15 21:52:07,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:07,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:07,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:07,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:07,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013753265] [2019-11-15 21:52:07,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:07,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:52:07,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621290885] [2019-11-15 21:52:07,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:52:07,363 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:07,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:52:07,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:52:07,363 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand 6 states. [2019-11-15 21:52:07,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:07,603 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2019-11-15 21:52:07,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:52:07,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-11-15 21:52:07,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:07,604 INFO L225 Difference]: With dead ends: 117 [2019-11-15 21:52:07,605 INFO L226 Difference]: Without dead ends: 117 [2019-11-15 21:52:07,605 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:52:07,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-15 21:52:07,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 110. [2019-11-15 21:52:07,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-15 21:52:07,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2019-11-15 21:52:07,609 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 23 [2019-11-15 21:52:07,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:07,610 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2019-11-15 21:52:07,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:52:07,610 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2019-11-15 21:52:07,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 21:52:07,611 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:07,611 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:07,611 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION]=== [2019-11-15 21:52:07,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:07,611 INFO L82 PathProgramCache]: Analyzing trace with hash -653023129, now seen corresponding path program 1 times [2019-11-15 21:52:07,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:07,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870591410] [2019-11-15 21:52:07,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:07,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:07,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:07,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:07,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870591410] [2019-11-15 21:52:07,684 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:07,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:52:07,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178678698] [2019-11-15 21:52:07,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:52:07,685 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:07,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:52:07,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:52:07,686 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 7 states. [2019-11-15 21:52:08,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:08,094 INFO L93 Difference]: Finished difference Result 178 states and 192 transitions. [2019-11-15 21:52:08,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:52:08,094 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-15 21:52:08,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:08,096 INFO L225 Difference]: With dead ends: 178 [2019-11-15 21:52:08,096 INFO L226 Difference]: Without dead ends: 178 [2019-11-15 21:52:08,096 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:52:08,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-15 21:52:08,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 109. [2019-11-15 21:52:08,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-15 21:52:08,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-11-15 21:52:08,100 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 23 [2019-11-15 21:52:08,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:08,100 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-11-15 21:52:08,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:52:08,101 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-11-15 21:52:08,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 21:52:08,101 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:08,101 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:08,102 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION]=== [2019-11-15 21:52:08,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:08,102 INFO L82 PathProgramCache]: Analyzing trace with hash -653023128, now seen corresponding path program 1 times [2019-11-15 21:52:08,102 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:08,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650016429] [2019-11-15 21:52:08,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:08,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:08,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:08,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:08,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650016429] [2019-11-15 21:52:08,195 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:08,195 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:52:08,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483234385] [2019-11-15 21:52:08,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:52:08,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:08,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:52:08,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:52:08,197 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 7 states. [2019-11-15 21:52:08,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:08,696 INFO L93 Difference]: Finished difference Result 194 states and 211 transitions. [2019-11-15 21:52:08,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:52:08,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-15 21:52:08,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:08,698 INFO L225 Difference]: With dead ends: 194 [2019-11-15 21:52:08,698 INFO L226 Difference]: Without dead ends: 194 [2019-11-15 21:52:08,698 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:52:08,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-15 21:52:08,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 101. [2019-11-15 21:52:08,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-15 21:52:08,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-11-15 21:52:08,702 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 23 [2019-11-15 21:52:08,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:08,702 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-11-15 21:52:08,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:52:08,702 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-11-15 21:52:08,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 21:52:08,703 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:08,703 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:08,704 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION]=== [2019-11-15 21:52:08,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:08,704 INFO L82 PathProgramCache]: Analyzing trace with hash -562636110, now seen corresponding path program 1 times [2019-11-15 21:52:08,704 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:08,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078308414] [2019-11-15 21:52:08,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:08,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:08,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:08,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:08,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078308414] [2019-11-15 21:52:08,770 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:08,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:52:08,770 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750233787] [2019-11-15 21:52:08,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:52:08,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:08,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:52:08,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:52:08,771 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 6 states. [2019-11-15 21:52:09,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:09,007 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2019-11-15 21:52:09,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:52:09,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-11-15 21:52:09,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:09,008 INFO L225 Difference]: With dead ends: 115 [2019-11-15 21:52:09,009 INFO L226 Difference]: Without dead ends: 104 [2019-11-15 21:52:09,009 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:52:09,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-15 21:52:09,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-11-15 21:52:09,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-15 21:52:09,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-15 21:52:09,012 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 27 [2019-11-15 21:52:09,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:09,012 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-15 21:52:09,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:52:09,012 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-15 21:52:09,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 21:52:09,013 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:09,013 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:09,014 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION]=== [2019-11-15 21:52:09,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:09,014 INFO L82 PathProgramCache]: Analyzing trace with hash -140383124, now seen corresponding path program 1 times [2019-11-15 21:52:09,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:09,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77928957] [2019-11-15 21:52:09,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:09,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:09,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:09,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:09,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77928957] [2019-11-15 21:52:09,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9173327] [2019-11-15 21:52:09,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_71952414-7cd5-4904-a91a-ce2c5644045d/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:09,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-15 21:52:09,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:09,471 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:09,472 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 21:52:09,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:09,501 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-15 21:52:09,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:09,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-15 21:52:09,548 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:09,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:09,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:09,562 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:09,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-11-15 21:52:09,683 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:09,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-15 21:52:09,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:09,715 INFO L567 ElimStorePlain]: treesize reduction 24, result has 54.7 percent of original size [2019-11-15 21:52:09,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:09,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:29 [2019-11-15 21:52:09,834 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-15 21:52:09,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 79 [2019-11-15 21:52:09,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:09,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:09,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:09,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 21:52:09,873 INFO L567 ElimStorePlain]: treesize reduction 82, result has 29.9 percent of original size [2019-11-15 21:52:09,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:09,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2019-11-15 21:52:10,000 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:10,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-11-15 21:52:10,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:10,013 INFO L567 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2019-11-15 21:52:10,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:10,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2019-11-15 21:52:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:10,100 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:52:10,100 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-11-15 21:52:10,100 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990447212] [2019-11-15 21:52:10,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-15 21:52:10,102 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:10,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 21:52:10,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2019-11-15 21:52:10,103 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 23 states. [2019-11-15 21:52:11,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:11,144 INFO L93 Difference]: Finished difference Result 198 states and 211 transitions. [2019-11-15 21:52:11,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 21:52:11,144 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 36 [2019-11-15 21:52:11,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:11,145 INFO L225 Difference]: With dead ends: 198 [2019-11-15 21:52:11,145 INFO L226 Difference]: Without dead ends: 198 [2019-11-15 21:52:11,146 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=204, Invalid=788, Unknown=0, NotChecked=0, Total=992 [2019-11-15 21:52:11,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-15 21:52:11,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 128. [2019-11-15 21:52:11,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-15 21:52:11,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2019-11-15 21:52:11,151 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 36 [2019-11-15 21:52:11,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:11,151 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2019-11-15 21:52:11,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-15 21:52:11,153 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2019-11-15 21:52:11,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 21:52:11,154 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:11,154 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:11,357 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:11,358 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION]=== [2019-11-15 21:52:11,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:11,358 INFO L82 PathProgramCache]: Analyzing trace with hash -140383123, now seen corresponding path program 1 times [2019-11-15 21:52:11,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:11,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436565840] [2019-11-15 21:52:11,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:11,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:11,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:11,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:11,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436565840] [2019-11-15 21:52:11,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301241582] [2019-11-15 21:52:11,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_71952414-7cd5-4904-a91a-ce2c5644045d/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:11,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-15 21:52:11,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:11,710 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_51|], 1=[|v_#valid_67|]} [2019-11-15 21:52:11,715 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:52:11,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:11,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:11,733 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:11,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:52:11,734 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:11,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:11,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:11,741 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-15 21:52:11,753 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:11,754 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:11,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:11,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:11,775 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:11,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:11,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:11,796 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-11-15 21:52:11,886 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:11,887 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-15 21:52:11,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:11,949 INFO L567 ElimStorePlain]: treesize reduction 24, result has 63.6 percent of original size [2019-11-15 21:52:11,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 21:52:11,954 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:11,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:11,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:11,966 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:38 [2019-11-15 21:52:12,040 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-15 21:52:12,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 105 [2019-11-15 21:52:12,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:12,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:12,068 INFO L567 ElimStorePlain]: treesize reduction 32, result has 70.9 percent of original size [2019-11-15 21:52:12,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:12,073 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 25 [2019-11-15 21:52:12,074 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:12,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:12,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:12,082 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:109, output treesize:47 [2019-11-15 21:52:12,166 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:12,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2019-11-15 21:52:12,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:12,183 INFO L567 ElimStorePlain]: treesize reduction 12, result has 72.1 percent of original size [2019-11-15 21:52:12,186 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 21:52:12,186 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:12,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:12,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:12,192 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2019-11-15 21:52:12,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:12,200 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:52:12,200 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2019-11-15 21:52:12,200 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630042718] [2019-11-15 21:52:12,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 21:52:12,201 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:12,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 21:52:12,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-11-15 21:52:12,202 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand 18 states. [2019-11-15 21:52:13,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:13,228 INFO L93 Difference]: Finished difference Result 203 states and 219 transitions. [2019-11-15 21:52:13,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 21:52:13,229 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2019-11-15 21:52:13,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:13,230 INFO L225 Difference]: With dead ends: 203 [2019-11-15 21:52:13,230 INFO L226 Difference]: Without dead ends: 203 [2019-11-15 21:52:13,231 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2019-11-15 21:52:13,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-11-15 21:52:13,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 130. [2019-11-15 21:52:13,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-15 21:52:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2019-11-15 21:52:13,236 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 36 [2019-11-15 21:52:13,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:13,236 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2019-11-15 21:52:13,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 21:52:13,236 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2019-11-15 21:52:13,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 21:52:13,237 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:13,237 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:13,438 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:13,438 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION]=== [2019-11-15 21:52:13,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:13,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1764205122, now seen corresponding path program 1 times [2019-11-15 21:52:13,439 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:13,439 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682257909] [2019-11-15 21:52:13,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:13,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:13,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:13,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:52:13,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682257909] [2019-11-15 21:52:13,507 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:13,507 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:52:13,507 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788720798] [2019-11-15 21:52:13,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:52:13,508 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:13,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:52:13,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:52:13,508 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand 7 states. [2019-11-15 21:52:13,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:13,730 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2019-11-15 21:52:13,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:52:13,730 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-11-15 21:52:13,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:13,731 INFO L225 Difference]: With dead ends: 94 [2019-11-15 21:52:13,731 INFO L226 Difference]: Without dead ends: 94 [2019-11-15 21:52:13,731 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:52:13,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-15 21:52:13,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2019-11-15 21:52:13,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-15 21:52:13,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2019-11-15 21:52:13,734 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 38 [2019-11-15 21:52:13,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:13,734 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2019-11-15 21:52:13,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:52:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2019-11-15 21:52:13,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 21:52:13,736 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:13,736 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:13,736 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION]=== [2019-11-15 21:52:13,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:13,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1122139694, now seen corresponding path program 1 times [2019-11-15 21:52:13,737 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:13,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549765960] [2019-11-15 21:52:13,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:13,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:13,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:14,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:14,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549765960] [2019-11-15 21:52:14,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99943051] [2019-11-15 21:52:14,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_71952414-7cd5-4904-a91a-ce2c5644045d/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:14,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-15 21:52:14,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:14,543 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_52|], 1=[|v_#valid_68|]} [2019-11-15 21:52:14,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:52:14,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:14,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:14,568 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:14,568 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:52:14,568 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:14,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:14,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:14,582 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-15 21:52:14,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:14,619 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:14,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:14,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:14,632 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:14,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:14,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:14,642 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-11-15 21:52:14,770 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:14,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-15 21:52:14,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:14,797 INFO L567 ElimStorePlain]: treesize reduction 24, result has 65.2 percent of original size [2019-11-15 21:52:14,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 21:52:14,802 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:14,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:14,814 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:14,814 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:41 [2019-11-15 21:52:14,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-15 21:52:14,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:14,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:14,902 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_24|], 6=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_35|]} [2019-11-15 21:52:14,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-15 21:52:14,907 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:14,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:14,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:14,975 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:14,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 121 [2019-11-15 21:52:14,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,977 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:15,026 INFO L567 ElimStorePlain]: treesize reduction 60, result has 59.5 percent of original size [2019-11-15 21:52:15,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:15,031 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 25 [2019-11-15 21:52:15,032 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:15,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:15,050 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:15,050 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:144, output treesize:57 [2019-11-15 21:52:15,183 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:15,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 42 [2019-11-15 21:52:15,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:15,212 INFO L567 ElimStorePlain]: treesize reduction 12, result has 77.4 percent of original size [2019-11-15 21:52:15,216 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 21:52:15,216 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:15,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:15,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:15,227 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:71, output treesize:19 [2019-11-15 21:52:15,331 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:15,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2019-11-15 21:52:15,331 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 21:52:15,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:15,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:15,344 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:16 [2019-11-15 21:52:15,441 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:15,443 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:52:15,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 32 [2019-11-15 21:52:15,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213506753] [2019-11-15 21:52:15,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-15 21:52:15,445 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:15,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-15 21:52:15,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=908, Unknown=0, NotChecked=0, Total=992 [2019-11-15 21:52:15,446 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 32 states. [2019-11-15 21:52:17,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:17,283 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2019-11-15 21:52:17,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 21:52:17,283 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2019-11-15 21:52:17,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:17,284 INFO L225 Difference]: With dead ends: 124 [2019-11-15 21:52:17,284 INFO L226 Difference]: Without dead ends: 123 [2019-11-15 21:52:17,286 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=340, Invalid=2110, Unknown=0, NotChecked=0, Total=2450 [2019-11-15 21:52:17,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-15 21:52:17,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 84. [2019-11-15 21:52:17,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-15 21:52:17,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2019-11-15 21:52:17,289 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 40 [2019-11-15 21:52:17,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:17,289 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2019-11-15 21:52:17,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-15 21:52:17,289 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2019-11-15 21:52:17,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 21:52:17,290 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:17,290 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:17,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:17,494 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION]=== [2019-11-15 21:52:17,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:17,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1646153555, now seen corresponding path program 1 times [2019-11-15 21:52:17,495 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:17,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081779867] [2019-11-15 21:52:17,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:17,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:17,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:17,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:17,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081779867] [2019-11-15 21:52:17,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264860872] [2019-11-15 21:52:17,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_71952414-7cd5-4904-a91a-ce2c5644045d/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:17,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-15 21:52:17,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:18,032 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:18,032 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:52:18,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:18,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:18,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:18,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-15 21:52:18,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:18,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:18,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:18,082 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:18,083 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:18,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:18,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:18,091 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2019-11-15 21:52:18,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:18,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:52:18,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:18,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:18,199 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:18,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 38 [2019-11-15 21:52:18,200 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:18,224 INFO L567 ElimStorePlain]: treesize reduction 16, result has 70.9 percent of original size [2019-11-15 21:52:18,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:18,224 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:39 [2019-11-15 21:52:18,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:18,266 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 21:52:18,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:18,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:18,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:18,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 21:52:18,283 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:18,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:18,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:18,298 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:39 [2019-11-15 21:52:18,303 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:52:18,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:18,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:18,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:18,316 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:47 [2019-11-15 21:52:18,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:52:18,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:18,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:18,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:52:18,386 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:18,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:18,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:18,399 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:46 [2019-11-15 21:52:18,545 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:18,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 95 [2019-11-15 21:52:18,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:18,595 INFO L567 ElimStorePlain]: treesize reduction 63, result has 53.7 percent of original size [2019-11-15 21:52:18,618 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:18,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 86 [2019-11-15 21:52:18,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,636 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:18,719 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.9 percent of original size [2019-11-15 21:52:18,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:18,722 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:88, output treesize:71 [2019-11-15 21:52:18,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:18,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 71 [2019-11-15 21:52:18,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:18,862 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:18,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 105 [2019-11-15 21:52:18,863 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:18,901 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:18,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 86 [2019-11-15 21:52:18,902 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:19,055 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-11-15 21:52:19,055 INFO L567 ElimStorePlain]: treesize reduction 95, result has 70.0 percent of original size [2019-11-15 21:52:19,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 49 [2019-11-15 21:52:19,070 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:19,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 61 [2019-11-15 21:52:19,081 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:19,097 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:19,097 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 95 [2019-11-15 21:52:19,098 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:19,182 INFO L567 ElimStorePlain]: treesize reduction 36, result has 82.1 percent of original size [2019-11-15 21:52:19,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-11-15 21:52:19,183 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:286, output treesize:165 [2019-11-15 21:52:19,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:19,468 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:19,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 80 [2019-11-15 21:52:19,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:19,474 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:19,475 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 45 [2019-11-15 21:52:19,475 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:19,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 48 [2019-11-15 21:52:19,484 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:19,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:19,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-11-15 21:52:19,523 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:202, output treesize:133 [2019-11-15 21:52:19,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:19,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:19,731 INFO L392 ElimStorePlain]: Different costs {1=[|#memory_$Pointer$.base|], 3=[v_prenex_2]} [2019-11-15 21:52:19,737 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:19,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 27 [2019-11-15 21:52:19,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:19,768 INFO L567 ElimStorePlain]: treesize reduction 4, result has 94.4 percent of original size [2019-11-15 21:52:19,780 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:19,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 52 [2019-11-15 21:52:19,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:19,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:19,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:19,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:19,783 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:19,819 INFO L567 ElimStorePlain]: treesize reduction 12, result has 79.3 percent of original size [2019-11-15 21:52:19,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:19,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-15 21:52:19,820 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:90, output treesize:32 [2019-11-15 21:52:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:19,928 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:52:19,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 35 [2019-11-15 21:52:19,928 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14241337] [2019-11-15 21:52:19,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-15 21:52:19,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:19,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-15 21:52:19,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1146, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 21:52:19,930 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 36 states. [2019-11-15 21:52:20,741 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 63 [2019-11-15 21:52:21,043 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 65 [2019-11-15 21:52:21,690 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 70 [2019-11-15 21:52:21,884 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 48 [2019-11-15 21:52:22,132 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 53 [2019-11-15 21:52:22,659 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-11-15 21:52:22,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:22,955 INFO L93 Difference]: Finished difference Result 159 states and 167 transitions. [2019-11-15 21:52:22,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-15 21:52:22,955 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 42 [2019-11-15 21:52:22,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:22,956 INFO L225 Difference]: With dead ends: 159 [2019-11-15 21:52:22,956 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 21:52:22,958 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=487, Invalid=3053, Unknown=0, NotChecked=0, Total=3540 [2019-11-15 21:52:22,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 21:52:22,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 109. [2019-11-15 21:52:22,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-15 21:52:22,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2019-11-15 21:52:22,961 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 42 [2019-11-15 21:52:22,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:22,961 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2019-11-15 21:52:22,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-15 21:52:22,962 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2019-11-15 21:52:22,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 21:52:22,962 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:22,962 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:23,163 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:23,163 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION]=== [2019-11-15 21:52:23,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:23,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1646153556, now seen corresponding path program 1 times [2019-11-15 21:52:23,164 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:23,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812495290] [2019-11-15 21:52:23,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:23,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:23,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:23,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:23,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812495290] [2019-11-15 21:52:23,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689579365] [2019-11-15 21:52:23,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_71952414-7cd5-4904-a91a-ce2c5644045d/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:23,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-15 21:52:23,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:23,722 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_53|], 1=[|v_#valid_71|]} [2019-11-15 21:52:23,725 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:52:23,725 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:23,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:23,746 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:23,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:52:23,747 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:23,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:23,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:23,766 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-15 21:52:23,818 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:23,818 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:23,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:23,838 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:23,838 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:23,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:23,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:23,859 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2019-11-15 21:52:23,965 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:23,973 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:23,973 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 43 [2019-11-15 21:52:23,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:24,006 INFO L567 ElimStorePlain]: treesize reduction 16, result has 78.1 percent of original size [2019-11-15 21:52:24,009 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:52:24,009 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:24,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:24,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:24,023 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:49 [2019-11-15 21:52:24,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:24,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 21:52:24,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:24,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:24,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:24,091 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 21:52:24,091 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:24,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:24,105 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:24,105 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:49 [2019-11-15 21:52:24,118 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:24,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-15 21:52:24,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:24,156 INFO L567 ElimStorePlain]: treesize reduction 14, result has 80.8 percent of original size [2019-11-15 21:52:24,163 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:24,163 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:52:24,164 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:24,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:24,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:24,179 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:53 [2019-11-15 21:52:24,225 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:52:24,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:24,258 INFO L567 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2019-11-15 21:52:24,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:24,262 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:52:24,262 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:24,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:24,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:24,277 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:75, output treesize:43 [2019-11-15 21:52:24,386 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_46|], 6=[|v_#memory_$Pointer$.base_49|]} [2019-11-15 21:52:24,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:24,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 21:52:24,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:24,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:24,460 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:24,460 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 98 [2019-11-15 21:52:24,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:24,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:24,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,467 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:24,523 INFO L567 ElimStorePlain]: treesize reduction 48, result has 56.0 percent of original size [2019-11-15 21:52:24,523 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:24,523 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:66 [2019-11-15 21:52:24,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:24,589 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 124 [2019-11-15 21:52:24,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:24,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 83 [2019-11-15 21:52:24,609 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:24,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:24,668 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:24,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 66 [2019-11-15 21:52:24,669 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:24,741 INFO L341 Elim1Store]: treesize reduction 50, result has 66.2 percent of original size [2019-11-15 21:52:24,741 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 153 [2019-11-15 21:52:24,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:24,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:24,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:24,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:24,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:24,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:24,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,764 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:25,069 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 47 [2019-11-15 21:52:25,069 INFO L567 ElimStorePlain]: treesize reduction 1637, result has 9.6 percent of original size [2019-11-15 21:52:25,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-15 21:52:25,070 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:266, output treesize:168 [2019-11-15 21:52:25,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:25,491 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 1=[v_prenex_8, v_prenex_7], 2=[v_prenex_5], 5=[v_prenex_4]} [2019-11-15 21:52:25,498 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:25,498 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 40 [2019-11-15 21:52:25,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:25,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:25,543 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-11-15 21:52:25,544 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:25,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:25,585 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 45 [2019-11-15 21:52:25,586 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:25,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:25,631 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:25,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2019-11-15 21:52:25,632 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:25,702 INFO L567 ElimStorePlain]: treesize reduction 8, result has 93.4 percent of original size [2019-11-15 21:52:25,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 66 [2019-11-15 21:52:25,707 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:25,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:25,744 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:25,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 62 [2019-11-15 21:52:25,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,747 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:25,813 INFO L567 ElimStorePlain]: treesize reduction 16, result has 79.2 percent of original size [2019-11-15 21:52:25,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,814 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-15 21:52:25,814 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:209, output treesize:36 [2019-11-15 21:52:25,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:25,845 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:52:25,845 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2019-11-15 21:52:25,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829861366] [2019-11-15 21:52:25,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-15 21:52:25,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:25,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-15 21:52:25,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=912, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 21:52:25,847 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 33 states. [2019-11-15 21:52:27,163 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2019-11-15 21:52:27,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:27,654 INFO L93 Difference]: Finished difference Result 153 states and 163 transitions. [2019-11-15 21:52:27,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 21:52:27,654 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 42 [2019-11-15 21:52:27,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:27,655 INFO L225 Difference]: With dead ends: 153 [2019-11-15 21:52:27,656 INFO L226 Difference]: Without dead ends: 153 [2019-11-15 21:52:27,657 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=389, Invalid=2061, Unknown=0, NotChecked=0, Total=2450 [2019-11-15 21:52:27,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-15 21:52:27,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 111. [2019-11-15 21:52:27,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-15 21:52:27,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2019-11-15 21:52:27,660 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 42 [2019-11-15 21:52:27,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:27,660 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2019-11-15 21:52:27,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-15 21:52:27,660 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2019-11-15 21:52:27,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 21:52:27,661 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:27,661 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:27,865 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:27,865 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION]=== [2019-11-15 21:52:27,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:27,866 INFO L82 PathProgramCache]: Analyzing trace with hash -792234856, now seen corresponding path program 2 times [2019-11-15 21:52:27,866 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:27,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142102424] [2019-11-15 21:52:27,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:27,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:27,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:28,052 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:28,053 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142102424] [2019-11-15 21:52:28,053 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238175737] [2019-11-15 21:52:28,053 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_71952414-7cd5-4904-a91a-ce2c5644045d/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:28,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:52:28,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:52:28,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-15 21:52:28,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:28,265 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:28,266 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:52:28,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:28,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:28,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:28,274 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-15 21:52:28,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:28,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:28,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:28,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:28,311 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:28,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:28,319 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:28,319 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2019-11-15 21:52:28,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:28,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:52:28,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:28,419 INFO L567 ElimStorePlain]: treesize reduction 3, result has 94.0 percent of original size [2019-11-15 21:52:28,436 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:28,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 38 [2019-11-15 21:52:28,437 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:28,459 INFO L567 ElimStorePlain]: treesize reduction 16, result has 70.9 percent of original size [2019-11-15 21:52:28,459 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:28,459 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:39 [2019-11-15 21:52:28,505 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:28,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 66 [2019-11-15 21:52:28,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:28,538 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.0 percent of original size [2019-11-15 21:52:28,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2019-11-15 21:52:28,542 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:28,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:28,552 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:28,552 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:41 [2019-11-15 21:52:28,806 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:28,808 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:28,821 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:28,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 59 [2019-11-15 21:52:28,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:28,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:28,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:28,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:28,825 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:28,857 INFO L567 ElimStorePlain]: treesize reduction 16, result has 70.9 percent of original size [2019-11-15 21:52:28,861 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:28,866 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:28,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:52:28,866 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:28,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:28,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:28,876 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:74, output treesize:7 [2019-11-15 21:52:28,955 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:28,955 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:52:28,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2019-11-15 21:52:28,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898632198] [2019-11-15 21:52:28,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-15 21:52:28,957 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:28,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-15 21:52:28,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2019-11-15 21:52:28,958 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 30 states. [2019-11-15 21:52:30,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:30,171 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2019-11-15 21:52:30,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 21:52:30,171 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 44 [2019-11-15 21:52:30,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:30,172 INFO L225 Difference]: With dead ends: 124 [2019-11-15 21:52:30,172 INFO L226 Difference]: Without dead ends: 105 [2019-11-15 21:52:30,172 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=207, Invalid=1353, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 21:52:30,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-15 21:52:30,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2019-11-15 21:52:30,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-15 21:52:30,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2019-11-15 21:52:30,175 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 44 [2019-11-15 21:52:30,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:30,175 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2019-11-15 21:52:30,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-15 21:52:30,175 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2019-11-15 21:52:30,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 21:52:30,176 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:30,176 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:30,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:30,377 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION]=== [2019-11-15 21:52:30,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:30,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1555442674, now seen corresponding path program 3 times [2019-11-15 21:52:30,377 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:30,377 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610723818] [2019-11-15 21:52:30,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:30,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:30,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:30,680 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:30,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610723818] [2019-11-15 21:52:30,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563799621] [2019-11-15 21:52:30,681 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_71952414-7cd5-4904-a91a-ce2c5644045d/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:30,845 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 21:52:30,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:52:30,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-15 21:52:30,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:30,943 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:30,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:52:30,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:30,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:30,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:30,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-15 21:52:30,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:30,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:31,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:31,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:31,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-11-15 21:52:31,148 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:31,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 46 [2019-11-15 21:52:31,149 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:31,172 INFO L567 ElimStorePlain]: treesize reduction 24, result has 52.9 percent of original size [2019-11-15 21:52:31,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:31,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:27 [2019-11-15 21:52:31,238 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-15 21:52:31,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 21:52:31,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:31,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:31,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:31,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:27 [2019-11-15 21:52:31,258 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:31,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:52:31,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:31,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:31,272 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:31,272 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2019-11-15 21:52:31,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:52:31,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:31,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:31,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:31,328 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:28 [2019-11-15 21:52:31,463 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:31,463 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 101 [2019-11-15 21:52:31,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:31,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:31,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,476 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:31,544 INFO L567 ElimStorePlain]: treesize reduction 52, result has 46.9 percent of original size [2019-11-15 21:52:31,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:31,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:51 [2019-11-15 21:52:31,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:31,748 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:31,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 91 treesize of output 166 [2019-11-15 21:52:31,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:31,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:31,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:31,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:31,817 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:31,817 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 94 [2019-11-15 21:52:31,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:31,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,821 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:32,044 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 29 [2019-11-15 21:52:32,044 INFO L567 ElimStorePlain]: treesize reduction 1630, result has 4.8 percent of original size [2019-11-15 21:52:32,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-15 21:52:32,045 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:155, output treesize:81 [2019-11-15 21:52:32,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:32,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:32,301 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:32,302 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:32,309 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:32,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 37 [2019-11-15 21:52:32,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:32,313 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:32,338 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:32,339 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 68 [2019-11-15 21:52:32,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:32,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:32,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:32,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:32,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:32,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:32,343 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:32,374 INFO L567 ElimStorePlain]: treesize reduction 69, result has 18.8 percent of original size [2019-11-15 21:52:32,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:32,375 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:101, output treesize:5 [2019-11-15 21:52:32,392 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:32,393 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:52:32,393 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 32 [2019-11-15 21:52:32,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138440274] [2019-11-15 21:52:32,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-15 21:52:32,394 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:32,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-15 21:52:32,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=931, Unknown=1, NotChecked=0, Total=1056 [2019-11-15 21:52:32,395 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 33 states. [2019-11-15 21:52:33,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:33,954 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2019-11-15 21:52:33,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 21:52:33,954 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 45 [2019-11-15 21:52:33,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:33,955 INFO L225 Difference]: With dead ends: 161 [2019-11-15 21:52:33,955 INFO L226 Difference]: Without dead ends: 161 [2019-11-15 21:52:33,956 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=370, Invalid=2175, Unknown=5, NotChecked=0, Total=2550 [2019-11-15 21:52:33,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-15 21:52:33,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 122. [2019-11-15 21:52:33,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-15 21:52:33,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2019-11-15 21:52:33,960 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 45 [2019-11-15 21:52:33,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:33,960 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2019-11-15 21:52:33,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-15 21:52:33,960 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2019-11-15 21:52:33,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 21:52:33,961 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:33,961 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:34,167 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:34,168 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION]=== [2019-11-15 21:52:34,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:34,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1555442675, now seen corresponding path program 2 times [2019-11-15 21:52:34,168 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:34,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585889655] [2019-11-15 21:52:34,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:34,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:34,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:34,504 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585889655] [2019-11-15 21:52:34,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949473820] [2019-11-15 21:52:34,505 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_71952414-7cd5-4904-a91a-ce2c5644045d/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:34,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:52:34,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:52:34,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 57 conjunts are in the unsatisfiable core [2019-11-15 21:52:34,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:34,676 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_55|], 1=[|v_#valid_76|]} [2019-11-15 21:52:34,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:52:34,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:34,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:34,695 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:34,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:52:34,695 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:34,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:34,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:34,704 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-15 21:52:34,730 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:34,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:34,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:34,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:34,749 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:34,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:34,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:34,761 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2019-11-15 21:52:34,869 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:34,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-15 21:52:34,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:34,899 INFO L567 ElimStorePlain]: treesize reduction 24, result has 67.6 percent of original size [2019-11-15 21:52:34,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 21:52:34,902 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:34,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:34,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:34,914 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:46 [2019-11-15 21:52:34,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:34,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 21:52:34,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:35,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:35,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:35,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 21:52:35,014 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:35,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:35,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:35,030 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:46 [2019-11-15 21:52:35,039 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:35,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:52:35,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:35,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:35,076 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:35,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-15 21:52:35,077 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:35,107 INFO L567 ElimStorePlain]: treesize reduction 14, result has 78.1 percent of original size [2019-11-15 21:52:35,107 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:35,108 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:50 [2019-11-15 21:52:35,146 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:52:35,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:35,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:35,167 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:52:35,167 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:35,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:35,181 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:35,181 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:72, output treesize:44 [2019-11-15 21:52:35,345 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_55|], 6=[|v_#memory_$Pointer$.base_64|]} [2019-11-15 21:52:35,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:35,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 21:52:35,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:35,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:35,428 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:35,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 106 [2019-11-15 21:52:35,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:35,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:35,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:35,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:35,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:35,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:35,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:35,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:35,434 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:35,494 INFO L567 ElimStorePlain]: treesize reduction 52, result has 55.6 percent of original size [2019-11-15 21:52:35,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:35,495 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:70 [2019-11-15 21:52:35,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:35,607 INFO L392 ElimStorePlain]: Different costs {18=[|v_#memory_$Pointer$.offset_56|], 28=[|v_#memory_$Pointer$.base_65|]} [2019-11-15 21:52:35,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:35,625 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 132 [2019-11-15 21:52:35,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:35,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:35,648 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 87 [2019-11-15 21:52:35,649 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:35,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:35,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:35,774 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:35,774 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 108 [2019-11-15 21:52:35,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:35,775 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:35,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:35,843 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:35,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 126 treesize of output 185 [2019-11-15 21:52:35,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:35,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:35,846 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:35,963 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 40 [2019-11-15 21:52:35,964 INFO L567 ElimStorePlain]: treesize reduction 362, result has 27.2 percent of original size [2019-11-15 21:52:35,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-15 21:52:35,964 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:282, output treesize:134 [2019-11-15 21:52:36,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:36,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:36,268 INFO L392 ElimStorePlain]: Different costs {12=[|#memory_$Pointer$.offset|], 20=[|#memory_$Pointer$.base|]} [2019-11-15 21:52:36,277 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:36,278 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:36,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 80 [2019-11-15 21:52:36,282 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:36,289 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:36,290 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 51 [2019-11-15 21:52:36,291 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:36,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:36,344 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:36,344 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:36,371 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:36,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 76 [2019-11-15 21:52:36,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:36,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:36,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:36,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:36,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:36,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:36,375 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:36,385 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:36,394 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:36,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 40 [2019-11-15 21:52:36,395 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:36,426 INFO L567 ElimStorePlain]: treesize reduction 77, result has 19.8 percent of original size [2019-11-15 21:52:36,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:36,426 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:168, output treesize:9 [2019-11-15 21:52:36,452 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:36,453 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:52:36,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 32 [2019-11-15 21:52:36,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135712498] [2019-11-15 21:52:36,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-15 21:52:36,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:36,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-15 21:52:36,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=909, Unknown=5, NotChecked=0, Total=1056 [2019-11-15 21:52:36,455 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 33 states. [2019-11-15 21:52:37,554 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 56 [2019-11-15 21:52:37,953 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 61 [2019-11-15 21:52:38,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:38,612 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2019-11-15 21:52:38,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 21:52:38,612 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 45 [2019-11-15 21:52:38,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:38,613 INFO L225 Difference]: With dead ends: 166 [2019-11-15 21:52:38,613 INFO L226 Difference]: Without dead ends: 166 [2019-11-15 21:52:38,614 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=386, Invalid=2055, Unknown=9, NotChecked=0, Total=2450 [2019-11-15 21:52:38,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-15 21:52:38,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 104. [2019-11-15 21:52:38,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 21:52:38,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2019-11-15 21:52:38,618 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 45 [2019-11-15 21:52:38,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:38,618 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2019-11-15 21:52:38,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-15 21:52:38,619 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2019-11-15 21:52:38,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 21:52:38,619 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:38,620 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:38,823 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:38,823 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION]=== [2019-11-15 21:52:38,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:38,824 INFO L82 PathProgramCache]: Analyzing trace with hash -2129324651, now seen corresponding path program 1 times [2019-11-15 21:52:38,824 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:38,824 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410779185] [2019-11-15 21:52:38,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:38,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:38,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:39,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:39,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410779185] [2019-11-15 21:52:39,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700289440] [2019-11-15 21:52:39,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_71952414-7cd5-4904-a91a-ce2c5644045d/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:39,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-15 21:52:39,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:39,491 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:39,491 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 21:52:39,491 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:39,511 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-15 21:52:39,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:39,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-15 21:52:39,543 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:39,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:39,565 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-11-15 21:52:39,568 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:39,569 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:39,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:39,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:39,579 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:36 [2019-11-15 21:52:39,742 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:39,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-15 21:52:39,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:39,776 INFO L567 ElimStorePlain]: treesize reduction 24, result has 69.2 percent of original size [2019-11-15 21:52:39,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:52:39,779 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:39,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:39,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:39,791 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:46 [2019-11-15 21:52:39,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:39,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 21:52:39,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:39,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:39,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:39,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 21:52:39,875 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:39,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:39,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:39,887 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:46 [2019-11-15 21:52:39,934 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:39,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-11-15 21:52:39,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:39,983 INFO L567 ElimStorePlain]: treesize reduction 28, result has 67.8 percent of original size [2019-11-15 21:52:39,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:39,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:59 [2019-11-15 21:52:40,046 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:52:40,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:40,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:40,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:52:40,070 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:40,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:40,087 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:40,088 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:81, output treesize:57 [2019-11-15 21:52:40,220 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_61|], 6=[|v_#memory_$Pointer$.base_70|]} [2019-11-15 21:52:40,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:40,225 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 21:52:40,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:40,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:40,286 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:40,287 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 110 [2019-11-15 21:52:40,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:40,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:40,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,291 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:40,337 INFO L567 ElimStorePlain]: treesize reduction 60, result has 51.2 percent of original size [2019-11-15 21:52:40,338 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:40,338 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:72 [2019-11-15 21:52:40,387 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_62|], 12=[|v_#memory_$Pointer$.base_71|]} [2019-11-15 21:52:40,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:40,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 29 [2019-11-15 21:52:40,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:40,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:40,492 INFO L341 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-11-15 21:52:40,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 155 [2019-11-15 21:52:40,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:40,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:40,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:40,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,497 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 21:52:40,554 INFO L567 ElimStorePlain]: treesize reduction 814, result has 11.2 percent of original size [2019-11-15 21:52:40,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:40,554 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:187, output treesize:101 [2019-11-15 21:52:40,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2019-11-15 21:52:40,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:40,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:40,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:40,703 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:115, output treesize:89 [2019-11-15 21:52:40,837 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:40,838 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 71 [2019-11-15 21:52:40,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:40,842 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:40,869 INFO L567 ElimStorePlain]: treesize reduction 36, result has 43.8 percent of original size [2019-11-15 21:52:40,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:40,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:90, output treesize:28 [2019-11-15 21:52:40,970 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:40,971 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:52:40,971 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2019-11-15 21:52:40,971 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830394804] [2019-11-15 21:52:40,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-15 21:52:40,971 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:40,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-15 21:52:40,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1182, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 21:52:40,972 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 37 states. [2019-11-15 21:52:42,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:42,340 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2019-11-15 21:52:42,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 21:52:42,340 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 46 [2019-11-15 21:52:42,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:42,341 INFO L225 Difference]: With dead ends: 164 [2019-11-15 21:52:42,341 INFO L226 Difference]: Without dead ends: 164 [2019-11-15 21:52:42,342 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=329, Invalid=2121, Unknown=0, NotChecked=0, Total=2450 [2019-11-15 21:52:42,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-15 21:52:42,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 126. [2019-11-15 21:52:42,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-15 21:52:42,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2019-11-15 21:52:42,345 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 46 [2019-11-15 21:52:42,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:42,346 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2019-11-15 21:52:42,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-15 21:52:42,346 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2019-11-15 21:52:42,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 21:52:42,347 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:42,347 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:42,550 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:42,550 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION]=== [2019-11-15 21:52:42,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:42,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2129324650, now seen corresponding path program 1 times [2019-11-15 21:52:42,551 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:42,551 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465085034] [2019-11-15 21:52:42,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:42,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:42,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:42,919 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:42,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465085034] [2019-11-15 21:52:42,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874933798] [2019-11-15 21:52:42,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_71952414-7cd5-4904-a91a-ce2c5644045d/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:43,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 63 conjunts are in the unsatisfiable core [2019-11-15 21:52:43,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:43,076 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:43,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 21:52:43,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:43,093 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-15 21:52:43,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:43,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-15 21:52:43,124 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:43,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:43,146 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-11-15 21:52:43,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:43,148 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:43,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:43,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:43,159 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:29 [2019-11-15 21:52:43,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 21:52:43,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:43,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:43,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 21:52:43,245 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:43,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:43,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:43,256 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2019-11-15 21:52:43,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:43,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 21:52:43,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:43,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:43,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:43,315 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 21:52:43,316 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:43,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:43,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:43,326 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:43 [2019-11-15 21:52:43,329 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_57|], 3=[|v_#valid_81|]} [2019-11-15 21:52:43,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:52:43,337 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:43,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:43,367 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:43,367 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-15 21:52:43,367 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:43,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:43,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:43,381 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:49 [2019-11-15 21:52:43,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:52:43,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:43,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:43,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:52:43,445 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:43,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:43,457 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:43,457 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:51 [2019-11-15 21:52:43,627 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:43,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 144 [2019-11-15 21:52:43,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:43,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:43,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:43,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:43,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:43,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:43,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:43,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:43,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:43,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:43,631 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:43,677 INFO L567 ElimStorePlain]: treesize reduction 60, result has 61.8 percent of original size [2019-11-15 21:52:43,713 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:43,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 112 [2019-11-15 21:52:43,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:43,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:43,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:43,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:43,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:43,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:43,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:43,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:43,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:43,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:43,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:43,718 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:43,760 INFO L567 ElimStorePlain]: treesize reduction 60, result has 50.0 percent of original size [2019-11-15 21:52:43,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:43,761 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:70 [2019-11-15 21:52:43,885 INFO L341 Elim1Store]: treesize reduction 62, result has 66.3 percent of original size [2019-11-15 21:52:43,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 217 treesize of output 264 [2019-11-15 21:52:43,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:43,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:43,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:43,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:43,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:43,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 21:52:43,941 INFO L567 ElimStorePlain]: treesize reduction 512, result has 25.0 percent of original size [2019-11-15 21:52:44,021 INFO L341 Elim1Store]: treesize reduction 54, result has 69.3 percent of original size [2019-11-15 21:52:44,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 170 treesize of output 181 [2019-11-15 21:52:44,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:44,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:44,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:44,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:44,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:44,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:44,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:44,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:44,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:44,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:44,026 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 21:52:44,069 INFO L567 ElimStorePlain]: treesize reduction 466, result has 19.8 percent of original size [2019-11-15 21:52:44,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:44,069 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:225, output treesize:115 [2019-11-15 21:52:44,382 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:44,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 103 [2019-11-15 21:52:44,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:44,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:44,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:44,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:44,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:44,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:44,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:44,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:44,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:44,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:44,388 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:44,433 INFO L567 ElimStorePlain]: treesize reduction 44, result has 51.6 percent of original size [2019-11-15 21:52:44,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2019-11-15 21:52:44,436 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:44,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:44,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:44,446 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:145, output treesize:9 [2019-11-15 21:52:44,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:44,469 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:52:44,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 32 [2019-11-15 21:52:44,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295707087] [2019-11-15 21:52:44,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-15 21:52:44,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:44,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-15 21:52:44,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=955, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 21:52:44,471 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand 33 states. [2019-11-15 21:52:45,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:45,961 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions. [2019-11-15 21:52:45,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 21:52:45,974 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 46 [2019-11-15 21:52:45,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:45,975 INFO L225 Difference]: With dead ends: 162 [2019-11-15 21:52:45,975 INFO L226 Difference]: Without dead ends: 162 [2019-11-15 21:52:45,976 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=234, Invalid=1928, Unknown=0, NotChecked=0, Total=2162 [2019-11-15 21:52:45,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-15 21:52:45,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 126. [2019-11-15 21:52:45,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-15 21:52:45,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2019-11-15 21:52:45,979 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 46 [2019-11-15 21:52:45,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:45,979 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2019-11-15 21:52:45,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-15 21:52:45,980 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2019-11-15 21:52:45,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 21:52:45,980 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:45,980 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:46,181 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:46,181 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION]=== [2019-11-15 21:52:46,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:46,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1876553957, now seen corresponding path program 1 times [2019-11-15 21:52:46,181 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:46,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112322551] [2019-11-15 21:52:46,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:46,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:46,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:52:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:52:46,273 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:52:46,274 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 21:52:46,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:52:46 BoogieIcfgContainer [2019-11-15 21:52:46,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:52:46,330 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:52:46,330 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:52:46,331 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:52:46,331 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:52:03" (3/4) ... [2019-11-15 21:52:46,333 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 21:52:46,388 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_71952414-7cd5-4904-a91a-ce2c5644045d/bin/uautomizer/witness.graphml [2019-11-15 21:52:46,388 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:52:46,389 INFO L168 Benchmark]: Toolchain (without parser) took 44294.29 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 481.8 MB). Free memory was 943.4 MB in the beginning and 1.4 GB in the end (delta: -439.9 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:52:46,390 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:52:46,390 INFO L168 Benchmark]: CACSL2BoogieTranslator took 536.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -156.6 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:52:46,390 INFO L168 Benchmark]: Boogie Preprocessor took 61.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:52:46,395 INFO L168 Benchmark]: RCFGBuilder took 817.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:52:46,398 INFO L168 Benchmark]: TraceAbstraction took 42816.14 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 364.4 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -354.3 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:52:46,399 INFO L168 Benchmark]: Witness Printer took 58.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:52:46,400 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 536.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -156.6 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 817.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 42816.14 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 364.4 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -354.3 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. * Witness Printer took 58.15 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L995] SLL* list = malloc(sizeof(SLL)); VAL [list={5:0}, malloc(sizeof(SLL))={5:0}] [L996] list->next = ((void*)0) VAL [list={5:0}, malloc(sizeof(SLL))={5:0}] [L997] list->colour = BLACK VAL [list={5:0}, malloc(sizeof(SLL))={5:0}] [L999] SLL* end = list; VAL [end={5:0}, list={5:0}, malloc(sizeof(SLL))={5:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] end->next = malloc(sizeof(SLL)) VAL [end={5:0}, list={5:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={5:0}] [L1006] EXPR end->next VAL [end={5:0}, end->next={3:0}, list={5:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={5:0}] [L1006] end = end->next [L1007] end->next = ((void*)0) VAL [end={3:0}, list={5:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={5:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1015] end->colour = RED VAL [end={3:0}, list={5:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1016] end->next = malloc(sizeof(SLL)) VAL [end={3:0}, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1017] EXPR end->next VAL [end={3:0}, end->next={2:0}, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={5:0}] [L1017] end = end->next [L1018] end->next = ((void*)0) VAL [end={2:0}, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1019] end->colour = BLACK VAL [end={2:0}, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={5:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={5:0}, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={5:0}, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={5:0}] [L1028] EXPR end->colour VAL [end={5:0}, end->colour=1, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={5:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1030] COND TRUE ((void*)0) != end VAL [end={5:0}, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={5:0}] [L1032] EXPR end->colour VAL [end={5:0}, end->colour=1, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR end->next VAL [end={5:0}, end->next={3:0}, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1038] COND FALSE !(!(end->next)) [L1039] EXPR end->next VAL [end={5:0}, end->next={3:0}, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1039] end = end->next [L1030] COND TRUE ((void*)0) != end VAL [end={3:0}, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1032] EXPR end->colour VAL [end={3:0}, end->colour=0, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={5:0}] [L1032] COND TRUE RED == end->colour [L1034] EXPR end->next VAL [end={3:0}, end->next={2:0}, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1034] end = end->next [L1035] EXPR end->next VAL [end={2:0}, end->next={0:0}, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}, malloc(sizeof(SLL))={5:0}] [L1035] end = end->next [L1038] end->next - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 118 locations, 52 error locations. Result: UNSAFE, OverallTime: 42.7s, OverallIterations: 23, TraceHistogramMax: 3, AutomataDifference: 20.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1235 SDtfs, 4771 SDslu, 5522 SDs, 0 SdLazy, 14140 SolverSat, 1032 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 10.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 867 GetRequests, 326 SyntacticMatches, 26 SemanticMatches, 515 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4843 ImplicationChecksByTransitivity, 17.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 868 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 1115 NumberOfCodeBlocks, 1115 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1035 ConstructedInterpolants, 172 QuantifiedInterpolants, 1221432 SizeOfPredicates, 174 NumberOfNonLiveVariables, 1942 ConjunctsInSsa, 511 ConjunctsInUnsatCore, 32 InterpolantComputations, 12 PerfectInterpolantSequences, 14/155 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...