./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/sll-sorted-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-sorted-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8be34918f5cf463066a3551693e083428b9e6ee2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-sorted-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8be34918f5cf463066a3551693e083428b9e6ee2 .................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:37:09,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:37:09,629 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:37:09,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:37:09,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:37:09,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:37:09,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:37:09,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:37:09,668 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:37:09,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:37:09,672 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:37:09,673 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:37:09,673 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:37:09,674 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:37:09,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:37:09,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:37:09,677 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:37:09,678 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:37:09,680 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:37:09,685 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:37:09,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:37:09,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:37:09,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:37:09,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:37:09,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:37:09,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:37:09,702 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:37:09,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:37:09,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:37:09,707 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:37:09,707 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:37:09,709 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:37:09,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:37:09,710 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:37:09,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:37:09,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:37:09,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:37:09,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:37:09,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:37:09,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:37:09,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:37:09,716 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-11-15 22:37:09,747 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:37:09,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:37:09,749 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:37:09,749 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:37:09,749 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:37:09,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:37:09,750 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:37:09,750 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:37:09,751 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:37:09,751 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:37:09,751 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:37:09,751 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 22:37:09,752 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 22:37:09,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:37:09,752 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:37:09,752 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:37:09,753 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:37:09,753 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:37:09,753 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:37:09,753 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:37:09,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:37:09,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:37:09,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:37:09,755 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:37:09,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:37:09,755 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_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/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-memcleanup) ) 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 -> 8be34918f5cf463066a3551693e083428b9e6ee2 [2019-11-15 22:37:09,786 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:37:09,798 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:37:09,801 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:37:09,803 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:37:09,804 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:37:09,804 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-sorted-1.i [2019-11-15 22:37:09,866 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/bin/uautomizer/data/7791f7299/bb9ddb0790a64695aa767ccc977dba48/FLAG09659a5bc [2019-11-15 22:37:10,401 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:37:10,402 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/sv-benchmarks/c/forester-heap/sll-sorted-1.i [2019-11-15 22:37:10,420 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/bin/uautomizer/data/7791f7299/bb9ddb0790a64695aa767ccc977dba48/FLAG09659a5bc [2019-11-15 22:37:10,749 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/bin/uautomizer/data/7791f7299/bb9ddb0790a64695aa767ccc977dba48 [2019-11-15 22:37:10,752 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:37:10,753 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 22:37:10,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:37:10,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:37:10,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:37:10,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:37:10" (1/1) ... [2019-11-15 22:37:10,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d72dbde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:37:10, skipping insertion in model container [2019-11-15 22:37:10,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:37:10" (1/1) ... [2019-11-15 22:37:10,772 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:37:10,826 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:37:11,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:37:11,374 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:37:11,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:37:11,478 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:37:11,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:37:11 WrapperNode [2019-11-15 22:37:11,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:37:11,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:37:11,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:37:11,480 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:37:11,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:37:11" (1/1) ... [2019-11-15 22:37:11,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:37:11" (1/1) ... [2019-11-15 22:37:11,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:37:11" (1/1) ... [2019-11-15 22:37:11,514 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:37:11" (1/1) ... [2019-11-15 22:37:11,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:37:11" (1/1) ... [2019-11-15 22:37:11,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:37:11" (1/1) ... [2019-11-15 22:37:11,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:37:11" (1/1) ... [2019-11-15 22:37:11,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:37:11,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:37:11,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:37:11,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:37:11,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:37:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/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 22:37:11,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 22:37:11,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:37:11,641 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 22:37:11,641 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 22:37:11,642 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 22:37:11,642 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 22:37:11,642 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 22:37:11,644 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 22:37:11,644 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 22:37:11,644 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 22:37:11,644 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 22:37:11,645 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 22:37:11,645 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 22:37:11,646 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 22:37:11,646 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 22:37:11,647 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 22:37:11,647 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 22:37:11,647 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 22:37:11,647 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 22:37:11,649 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 22:37:11,650 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 22:37:11,650 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 22:37:11,650 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 22:37:11,650 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 22:37:11,650 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 22:37:11,651 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 22:37:11,651 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 22:37:11,651 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 22:37:11,651 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 22:37:11,651 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 22:37:11,652 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 22:37:11,652 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 22:37:11,652 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 22:37:11,652 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 22:37:11,652 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 22:37:11,653 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 22:37:11,653 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 22:37:11,653 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 22:37:11,653 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 22:37:11,653 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 22:37:11,653 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 22:37:11,653 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 22:37:11,654 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 22:37:11,654 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 22:37:11,655 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 22:37:11,655 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 22:37:11,655 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 22:37:11,655 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 22:37:11,655 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 22:37:11,655 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 22:37:11,656 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 22:37:11,656 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 22:37:11,656 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 22:37:11,656 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 22:37:11,656 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 22:37:11,656 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 22:37:11,657 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 22:37:11,657 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 22:37:11,657 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 22:37:11,657 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 22:37:11,658 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 22:37:11,658 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 22:37:11,658 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 22:37:11,658 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 22:37:11,658 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 22:37:11,659 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 22:37:11,659 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 22:37:11,659 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 22:37:11,659 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 22:37:11,659 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 22:37:11,659 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 22:37:11,660 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 22:37:11,660 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 22:37:11,661 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 22:37:11,661 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 22:37:11,661 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 22:37:11,662 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 22:37:11,662 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 22:37:11,663 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 22:37:11,663 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 22:37:11,664 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 22:37:11,664 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 22:37:11,665 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 22:37:11,665 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 22:37:11,665 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 22:37:11,665 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 22:37:11,665 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 22:37:11,665 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 22:37:11,666 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 22:37:11,666 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 22:37:11,666 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 22:37:11,666 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 22:37:11,666 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 22:37:11,666 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 22:37:11,666 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 22:37:11,667 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 22:37:11,667 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 22:37:11,667 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 22:37:11,667 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 22:37:11,667 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 22:37:11,667 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 22:37:11,667 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 22:37:11,668 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 22:37:11,668 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 22:37:11,668 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 22:37:11,668 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 22:37:11,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 22:37:11,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 22:37:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 22:37:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:37:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:37:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:37:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:37:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:37:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:37:11,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 22:37:11,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:37:12,545 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:37:12,545 INFO L284 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-15 22:37:12,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:37:12 BoogieIcfgContainer [2019-11-15 22:37:12,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:37:12,548 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:37:12,548 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:37:12,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:37:12,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:37:10" (1/3) ... [2019-11-15 22:37:12,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9606ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:37:12, skipping insertion in model container [2019-11-15 22:37:12,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:37:11" (2/3) ... [2019-11-15 22:37:12,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9606ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:37:12, skipping insertion in model container [2019-11-15 22:37:12,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:37:12" (3/3) ... [2019-11-15 22:37:12,556 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-sorted-1.i [2019-11-15 22:37:12,567 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:37:12,576 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 62 error locations. [2019-11-15 22:37:12,589 INFO L249 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2019-11-15 22:37:12,612 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:37:12,612 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 22:37:12,612 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:37:12,613 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:37:12,613 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:37:12,613 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:37:12,613 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:37:12,613 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:37:12,652 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-11-15 22:37:12,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 22:37:12,666 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:12,667 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:12,670 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:37:12,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:12,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1542113095, now seen corresponding path program 1 times [2019-11-15 22:37:12,696 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:12,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922027560] [2019-11-15 22:37:12,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:12,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:12,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:12,951 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 22:37:12,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922027560] [2019-11-15 22:37:12,953 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:12,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:37:12,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337148906] [2019-11-15 22:37:12,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:12,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:12,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:12,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:12,979 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 4 states. [2019-11-15 22:37:13,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:13,511 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2019-11-15 22:37:13,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:37:13,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 22:37:13,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:13,527 INFO L225 Difference]: With dead ends: 154 [2019-11-15 22:37:13,527 INFO L226 Difference]: Without dead ends: 150 [2019-11-15 22:37:13,529 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 22:37:13,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-15 22:37:13,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2019-11-15 22:37:13,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:37:13,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2019-11-15 22:37:13,595 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 7 [2019-11-15 22:37:13,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:13,596 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2019-11-15 22:37:13,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:13,596 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2019-11-15 22:37:13,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 22:37:13,597 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:13,597 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:13,598 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:37:13,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:13,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1542113096, now seen corresponding path program 1 times [2019-11-15 22:37:13,599 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:13,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121602333] [2019-11-15 22:37:13,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:13,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:13,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:13,712 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 22:37:13,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121602333] [2019-11-15 22:37:13,713 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:13,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:37:13,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876539065] [2019-11-15 22:37:13,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:13,715 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:13,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:13,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:13,716 INFO L87 Difference]: Start difference. First operand 146 states and 157 transitions. Second operand 4 states. [2019-11-15 22:37:14,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:14,168 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2019-11-15 22:37:14,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:14,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 22:37:14,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:14,171 INFO L225 Difference]: With dead ends: 148 [2019-11-15 22:37:14,171 INFO L226 Difference]: Without dead ends: 148 [2019-11-15 22:37:14,172 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 22:37:14,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-15 22:37:14,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2019-11-15 22:37:14,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-15 22:37:14,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2019-11-15 22:37:14,186 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 7 [2019-11-15 22:37:14,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:14,186 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2019-11-15 22:37:14,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:14,187 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2019-11-15 22:37:14,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 22:37:14,188 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:14,188 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:14,188 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:37:14,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:14,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1836732473, now seen corresponding path program 1 times [2019-11-15 22:37:14,189 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:14,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437679265] [2019-11-15 22:37:14,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:14,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:14,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:14,309 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 22:37:14,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437679265] [2019-11-15 22:37:14,310 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:14,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:37:14,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39568835] [2019-11-15 22:37:14,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:37:14,311 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:14,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:37:14,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:37:14,312 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand 5 states. [2019-11-15 22:37:14,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:14,857 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2019-11-15 22:37:14,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:37:14,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-15 22:37:14,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:14,860 INFO L225 Difference]: With dead ends: 153 [2019-11-15 22:37:14,860 INFO L226 Difference]: Without dead ends: 153 [2019-11-15 22:37:14,861 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 22:37:14,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-15 22:37:14,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 142. [2019-11-15 22:37:14,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-15 22:37:14,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 164 transitions. [2019-11-15 22:37:14,882 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 164 transitions. Word has length 12 [2019-11-15 22:37:14,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:14,882 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 164 transitions. [2019-11-15 22:37:14,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:37:14,883 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 164 transitions. [2019-11-15 22:37:14,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 22:37:14,888 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:14,888 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:14,889 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:37:14,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:14,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1836732472, now seen corresponding path program 1 times [2019-11-15 22:37:14,890 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:14,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626509216] [2019-11-15 22:37:14,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:14,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:14,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:15,031 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 22:37:15,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626509216] [2019-11-15 22:37:15,031 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:15,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:37:15,032 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778936897] [2019-11-15 22:37:15,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:37:15,032 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:15,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:37:15,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:37:15,033 INFO L87 Difference]: Start difference. First operand 142 states and 164 transitions. Second operand 7 states. [2019-11-15 22:37:15,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:15,723 INFO L93 Difference]: Finished difference Result 206 states and 232 transitions. [2019-11-15 22:37:15,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:37:15,724 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-11-15 22:37:15,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:15,726 INFO L225 Difference]: With dead ends: 206 [2019-11-15 22:37:15,726 INFO L226 Difference]: Without dead ends: 206 [2019-11-15 22:37:15,727 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:37:15,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-11-15 22:37:15,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 187. [2019-11-15 22:37:15,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-15 22:37:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 222 transitions. [2019-11-15 22:37:15,739 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 222 transitions. Word has length 12 [2019-11-15 22:37:15,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:15,740 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 222 transitions. [2019-11-15 22:37:15,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:37:15,740 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 222 transitions. [2019-11-15 22:37:15,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 22:37:15,741 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:15,741 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:15,741 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:37:15,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:15,742 INFO L82 PathProgramCache]: Analyzing trace with hash -213758957, now seen corresponding path program 1 times [2019-11-15 22:37:15,742 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:15,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842356462] [2019-11-15 22:37:15,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:15,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:15,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:15,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 22:37:15,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842356462] [2019-11-15 22:37:15,834 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:15,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:37:15,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532183209] [2019-11-15 22:37:15,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:37:15,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:15,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:37:15,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:37:15,836 INFO L87 Difference]: Start difference. First operand 187 states and 222 transitions. Second operand 7 states. [2019-11-15 22:37:16,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:16,831 INFO L93 Difference]: Finished difference Result 348 states and 411 transitions. [2019-11-15 22:37:16,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:37:16,832 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-15 22:37:16,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:16,836 INFO L225 Difference]: With dead ends: 348 [2019-11-15 22:37:16,836 INFO L226 Difference]: Without dead ends: 348 [2019-11-15 22:37:16,837 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 22:37:16,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-11-15 22:37:16,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 186. [2019-11-15 22:37:16,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-15 22:37:16,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 221 transitions. [2019-11-15 22:37:16,871 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 221 transitions. Word has length 15 [2019-11-15 22:37:16,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:16,872 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 221 transitions. [2019-11-15 22:37:16,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:37:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 221 transitions. [2019-11-15 22:37:16,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 22:37:16,873 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:16,873 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:37:16,873 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:37:16,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:16,874 INFO L82 PathProgramCache]: Analyzing trace with hash -213758956, now seen corresponding path program 1 times [2019-11-15 22:37:16,874 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:16,875 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537865847] [2019-11-15 22:37:16,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:16,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:16,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:16,986 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 22:37:16,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537865847] [2019-11-15 22:37:16,986 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:16,986 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:37:16,987 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847179111] [2019-11-15 22:37:16,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:37:16,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:16,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:37:16,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:37:16,988 INFO L87 Difference]: Start difference. First operand 186 states and 221 transitions. Second operand 7 states. [2019-11-15 22:37:18,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:18,002 INFO L93 Difference]: Finished difference Result 339 states and 405 transitions. [2019-11-15 22:37:18,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:37:18,002 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-15 22:37:18,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:18,005 INFO L225 Difference]: With dead ends: 339 [2019-11-15 22:37:18,005 INFO L226 Difference]: Without dead ends: 339 [2019-11-15 22:37:18,006 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 22:37:18,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-11-15 22:37:18,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 177. [2019-11-15 22:37:18,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-11-15 22:37:18,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 211 transitions. [2019-11-15 22:37:18,016 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 211 transitions. Word has length 15 [2019-11-15 22:37:18,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:18,018 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 211 transitions. [2019-11-15 22:37:18,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:37:18,018 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 211 transitions. [2019-11-15 22:37:18,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 22:37:18,020 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:18,020 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] [2019-11-15 22:37:18,021 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:37:18,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:18,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1587167576, now seen corresponding path program 1 times [2019-11-15 22:37:18,022 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:18,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594069664] [2019-11-15 22:37:18,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:18,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:18,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:18,111 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 22:37:18,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594069664] [2019-11-15 22:37:18,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:18,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:37:18,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976485174] [2019-11-15 22:37:18,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:18,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:18,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:18,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:18,113 INFO L87 Difference]: Start difference. First operand 177 states and 211 transitions. Second operand 4 states. [2019-11-15 22:37:18,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:18,342 INFO L93 Difference]: Finished difference Result 212 states and 251 transitions. [2019-11-15 22:37:18,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:18,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-15 22:37:18,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:18,344 INFO L225 Difference]: With dead ends: 212 [2019-11-15 22:37:18,344 INFO L226 Difference]: Without dead ends: 212 [2019-11-15 22:37:18,345 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 22:37:18,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-11-15 22:37:18,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 186. [2019-11-15 22:37:18,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-15 22:37:18,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 221 transitions. [2019-11-15 22:37:18,351 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 221 transitions. Word has length 20 [2019-11-15 22:37:18,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:18,352 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 221 transitions. [2019-11-15 22:37:18,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:18,352 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 221 transitions. [2019-11-15 22:37:18,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 22:37:18,353 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:18,353 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] [2019-11-15 22:37:18,354 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:37:18,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:18,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1053383989, now seen corresponding path program 1 times [2019-11-15 22:37:18,354 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:18,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550767217] [2019-11-15 22:37:18,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:18,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:18,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:37:18,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550767217] [2019-11-15 22:37:18,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075764364] [2019-11-15 22:37:18,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/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 22:37:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:18,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-15 22:37:18,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:18,866 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:18,867 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 22:37:18,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:18,897 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-15 22:37:18,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:18,898 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-15 22:37:18,954 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 22:37:18,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:18,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:18,975 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 22:37:18,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-11-15 22:37:19,179 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:19,179 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 22:37:19,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:19,214 INFO L567 ElimStorePlain]: treesize reduction 24, result has 54.7 percent of original size [2019-11-15 22:37:19,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:19,215 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:29 [2019-11-15 22:37:19,366 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-15 22:37:19,367 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 22:37:19,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:37:19,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:19,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:19,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 22:37:19,406 INFO L567 ElimStorePlain]: treesize reduction 82, result has 29.9 percent of original size [2019-11-15 22:37:19,407 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 22:37:19,407 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2019-11-15 22:37:19,528 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:19,529 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 22:37:19,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:19,552 INFO L567 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2019-11-15 22:37:19,553 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 22:37:19,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2019-11-15 22:37:19,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:37:19,591 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:37:19,592 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2019-11-15 22:37:19,592 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881127383] [2019-11-15 22:37:19,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 22:37:19,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:19,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 22:37:19,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2019-11-15 22:37:19,594 INFO L87 Difference]: Start difference. First operand 186 states and 221 transitions. Second operand 22 states. [2019-11-15 22:37:21,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:21,582 INFO L93 Difference]: Finished difference Result 391 states and 447 transitions. [2019-11-15 22:37:21,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-15 22:37:21,583 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-11-15 22:37:21,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:21,586 INFO L225 Difference]: With dead ends: 391 [2019-11-15 22:37:21,586 INFO L226 Difference]: Without dead ends: 391 [2019-11-15 22:37:21,587 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=239, Invalid=1093, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 22:37:21,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-11-15 22:37:21,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 207. [2019-11-15 22:37:21,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-11-15 22:37:21,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 247 transitions. [2019-11-15 22:37:21,610 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 247 transitions. Word has length 30 [2019-11-15 22:37:21,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:21,611 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 247 transitions. [2019-11-15 22:37:21,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 22:37:21,611 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 247 transitions. [2019-11-15 22:37:21,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 22:37:21,614 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:21,614 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] [2019-11-15 22:37:21,819 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:21,820 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:37:21,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:21,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1053383988, now seen corresponding path program 1 times [2019-11-15 22:37:21,821 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:21,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764424571] [2019-11-15 22:37:21,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:21,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:21,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:22,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:37:22,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764424571] [2019-11-15 22:37:22,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516374963] [2019-11-15 22:37:22,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/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 22:37:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:22,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-15 22:37:22,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:22,426 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_67|], 1=[|v_#valid_77|]} [2019-11-15 22:37:22,432 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 22:37:22,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:22,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:22,457 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:22,458 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 22:37:22,458 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:22,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:22,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:22,468 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-15 22:37:22,479 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 22:37:22,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:22,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:22,497 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 22:37:22,497 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:22,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:22,509 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 22:37:22,509 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-11-15 22:37:22,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:37:22,617 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 22:37:22,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:22,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:22,669 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:22,670 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 22:37:22,671 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:22,702 INFO L567 ElimStorePlain]: treesize reduction 24, result has 61.3 percent of original size [2019-11-15 22:37:22,703 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:22,703 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:38 [2019-11-15 22:37:22,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:37:22,751 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 22:37:22,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:22,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:22,825 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-15 22:37:22,826 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 71 treesize of output 86 [2019-11-15 22:37:22,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:22,828 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:22,857 INFO L567 ElimStorePlain]: treesize reduction 32, result has 59.5 percent of original size [2019-11-15 22:37:22,858 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 22:37:22,859 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:109, output treesize:47 [2019-11-15 22:37:22,997 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:22,998 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 22:37:22,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:23,036 INFO L567 ElimStorePlain]: treesize reduction 12, result has 72.1 percent of original size [2019-11-15 22:37:23,041 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 22:37:23,042 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:23,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:23,056 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 22:37:23,057 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2019-11-15 22:37:23,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:37:23,067 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:37:23,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2019-11-15 22:37:23,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577036078] [2019-11-15 22:37:23,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 22:37:23,069 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:23,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 22:37:23,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-15 22:37:23,070 INFO L87 Difference]: Start difference. First operand 207 states and 247 transitions. Second operand 18 states. [2019-11-15 22:37:24,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:24,735 INFO L93 Difference]: Finished difference Result 383 states and 436 transitions. [2019-11-15 22:37:24,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 22:37:24,735 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-11-15 22:37:24,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:24,738 INFO L225 Difference]: With dead ends: 383 [2019-11-15 22:37:24,738 INFO L226 Difference]: Without dead ends: 383 [2019-11-15 22:37:24,739 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2019-11-15 22:37:24,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-11-15 22:37:24,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 207. [2019-11-15 22:37:24,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-11-15 22:37:24,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 246 transitions. [2019-11-15 22:37:24,749 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 246 transitions. Word has length 30 [2019-11-15 22:37:24,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:24,749 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 246 transitions. [2019-11-15 22:37:24,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 22:37:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 246 transitions. [2019-11-15 22:37:24,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 22:37:24,751 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:24,752 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] [2019-11-15 22:37:24,955 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:24,955 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:37:24,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:24,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1319010905, now seen corresponding path program 1 times [2019-11-15 22:37:24,956 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:24,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024861767] [2019-11-15 22:37:24,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:24,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:24,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:25,023 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 22:37:25,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024861767] [2019-11-15 22:37:25,023 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:25,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:37:25,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112856166] [2019-11-15 22:37:25,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:25,024 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:25,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:25,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:25,025 INFO L87 Difference]: Start difference. First operand 207 states and 246 transitions. Second operand 4 states. [2019-11-15 22:37:25,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:25,241 INFO L93 Difference]: Finished difference Result 209 states and 248 transitions. [2019-11-15 22:37:25,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:25,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-15 22:37:25,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:25,243 INFO L225 Difference]: With dead ends: 209 [2019-11-15 22:37:25,243 INFO L226 Difference]: Without dead ends: 209 [2019-11-15 22:37:25,243 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 22:37:25,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-11-15 22:37:25,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-11-15 22:37:25,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-11-15 22:37:25,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 248 transitions. [2019-11-15 22:37:25,250 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 248 transitions. Word has length 32 [2019-11-15 22:37:25,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:25,251 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 248 transitions. [2019-11-15 22:37:25,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:25,251 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 248 transitions. [2019-11-15 22:37:25,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 22:37:25,253 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:25,253 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] [2019-11-15 22:37:25,254 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:37:25,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:25,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1598565430, now seen corresponding path program 1 times [2019-11-15 22:37:25,255 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:25,255 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549765960] [2019-11-15 22:37:25,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:25,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:25,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:25,338 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 22:37:25,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549765960] [2019-11-15 22:37:25,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:25,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:37:25,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794453056] [2019-11-15 22:37:25,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:37:25,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:25,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:37:25,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:37:25,340 INFO L87 Difference]: Start difference. First operand 209 states and 248 transitions. Second operand 7 states. [2019-11-15 22:37:25,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:25,802 INFO L93 Difference]: Finished difference Result 234 states and 279 transitions. [2019-11-15 22:37:25,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:37:25,802 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-11-15 22:37:25,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:25,804 INFO L225 Difference]: With dead ends: 234 [2019-11-15 22:37:25,804 INFO L226 Difference]: Without dead ends: 234 [2019-11-15 22:37:25,805 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:37:25,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-11-15 22:37:25,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 208. [2019-11-15 22:37:25,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-11-15 22:37:25,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 247 transitions. [2019-11-15 22:37:25,812 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 247 transitions. Word has length 35 [2019-11-15 22:37:25,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:25,812 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 247 transitions. [2019-11-15 22:37:25,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:37:25,812 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 247 transitions. [2019-11-15 22:37:25,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 22:37:25,814 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:25,814 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] [2019-11-15 22:37:25,814 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:37:25,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:25,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1598565431, now seen corresponding path program 1 times [2019-11-15 22:37:25,815 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:25,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227138932] [2019-11-15 22:37:25,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:25,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:25,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:26,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:37:26,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227138932] [2019-11-15 22:37:26,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418736941] [2019-11-15 22:37:26,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/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 22:37:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:26,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-15 22:37:26,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:26,333 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:26,333 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 22:37:26,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:26,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:26,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:26,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-15 22:37:26,358 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 22:37:26,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:26,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:26,380 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 22:37:26,381 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:26,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:26,397 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 22:37:26,398 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2019-11-15 22:37:26,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-15 22:37:26,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:26,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:26,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:26,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2019-11-15 22:37:26,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:37:26,459 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 22:37:26,460 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:26,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:26,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:26,467 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:19 [2019-11-15 22:37:26,510 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-15 22:37:26,510 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 22:37:26,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:26,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:26,517 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 1 xjuncts. [2019-11-15 22:37:26,517 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-11-15 22:37:26,726 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 2=[|#memory_$Pointer$.offset|]} [2019-11-15 22:37:26,730 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 15 [2019-11-15 22:37:26,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:26,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:26,748 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 33 treesize of output 17 [2019-11-15 22:37:26,749 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:26,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:26,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:26,757 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:11 [2019-11-15 22:37:26,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:37:26,816 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:37:26,816 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 22 [2019-11-15 22:37:26,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022635263] [2019-11-15 22:37:26,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-15 22:37:26,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:26,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 22:37:26,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2019-11-15 22:37:26,819 INFO L87 Difference]: Start difference. First operand 208 states and 247 transitions. Second operand 23 states. [2019-11-15 22:37:29,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:29,270 INFO L93 Difference]: Finished difference Result 423 states and 482 transitions. [2019-11-15 22:37:29,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-15 22:37:29,270 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 35 [2019-11-15 22:37:29,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:29,273 INFO L225 Difference]: With dead ends: 423 [2019-11-15 22:37:29,273 INFO L226 Difference]: Without dead ends: 423 [2019-11-15 22:37:29,275 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=380, Invalid=1782, Unknown=0, NotChecked=0, Total=2162 [2019-11-15 22:37:29,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-11-15 22:37:29,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 212. [2019-11-15 22:37:29,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-15 22:37:29,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 252 transitions. [2019-11-15 22:37:29,283 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 252 transitions. Word has length 35 [2019-11-15 22:37:29,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:29,284 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 252 transitions. [2019-11-15 22:37:29,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-15 22:37:29,284 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 252 transitions. [2019-11-15 22:37:29,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 22:37:29,286 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:29,286 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] [2019-11-15 22:37:29,489 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:29,490 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:37:29,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:29,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1480180520, now seen corresponding path program 1 times [2019-11-15 22:37:29,490 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:29,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288770611] [2019-11-15 22:37:29,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:29,491 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:29,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:29,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:37:29,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288770611] [2019-11-15 22:37:29,607 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:29,607 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:37:29,608 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874000089] [2019-11-15 22:37:29,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:37:29,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:29,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:37:29,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:37:29,609 INFO L87 Difference]: Start difference. First operand 212 states and 252 transitions. Second operand 8 states. [2019-11-15 22:37:30,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:30,020 INFO L93 Difference]: Finished difference Result 229 states and 271 transitions. [2019-11-15 22:37:30,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:37:30,021 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-11-15 22:37:30,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:30,023 INFO L225 Difference]: With dead ends: 229 [2019-11-15 22:37:30,023 INFO L226 Difference]: Without dead ends: 229 [2019-11-15 22:37:30,023 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:37:30,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-11-15 22:37:30,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 220. [2019-11-15 22:37:30,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-15 22:37:30,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 261 transitions. [2019-11-15 22:37:30,030 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 261 transitions. Word has length 35 [2019-11-15 22:37:30,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:30,030 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 261 transitions. [2019-11-15 22:37:30,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:37:30,031 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 261 transitions. [2019-11-15 22:37:30,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 22:37:30,032 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:30,032 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] [2019-11-15 22:37:30,033 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:37:30,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:30,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1480120938, now seen corresponding path program 1 times [2019-11-15 22:37:30,033 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:30,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327930198] [2019-11-15 22:37:30,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:30,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:30,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:30,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:37:30,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327930198] [2019-11-15 22:37:30,088 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:30,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:37:30,089 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673026867] [2019-11-15 22:37:30,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:30,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:30,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:30,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:30,090 INFO L87 Difference]: Start difference. First operand 220 states and 261 transitions. Second operand 4 states. [2019-11-15 22:37:30,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:30,380 INFO L93 Difference]: Finished difference Result 222 states and 257 transitions. [2019-11-15 22:37:30,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:30,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 22:37:30,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:30,382 INFO L225 Difference]: With dead ends: 222 [2019-11-15 22:37:30,382 INFO L226 Difference]: Without dead ends: 222 [2019-11-15 22:37:30,382 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 22:37:30,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-11-15 22:37:30,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 217. [2019-11-15 22:37:30,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-15 22:37:30,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 255 transitions. [2019-11-15 22:37:30,388 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 255 transitions. Word has length 35 [2019-11-15 22:37:30,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:30,389 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 255 transitions. [2019-11-15 22:37:30,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:30,389 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 255 transitions. [2019-11-15 22:37:30,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 22:37:30,391 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:30,391 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] [2019-11-15 22:37:30,392 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:37:30,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:30,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1480120937, now seen corresponding path program 1 times [2019-11-15 22:37:30,393 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:30,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596516190] [2019-11-15 22:37:30,393 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:30,393 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:30,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:30,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:37:30,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596516190] [2019-11-15 22:37:30,463 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:30,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:37:30,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994692402] [2019-11-15 22:37:30,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:37:30,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:30,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:37:30,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:37:30,464 INFO L87 Difference]: Start difference. First operand 217 states and 255 transitions. Second operand 4 states. [2019-11-15 22:37:30,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:30,748 INFO L93 Difference]: Finished difference Result 214 states and 249 transitions. [2019-11-15 22:37:30,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:37:30,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 22:37:30,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:30,750 INFO L225 Difference]: With dead ends: 214 [2019-11-15 22:37:30,750 INFO L226 Difference]: Without dead ends: 214 [2019-11-15 22:37:30,751 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 22:37:30,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-15 22:37:30,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2019-11-15 22:37:30,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-11-15 22:37:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 249 transitions. [2019-11-15 22:37:30,762 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 249 transitions. Word has length 35 [2019-11-15 22:37:30,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:30,762 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 249 transitions. [2019-11-15 22:37:30,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:37:30,763 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 249 transitions. [2019-11-15 22:37:30,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 22:37:30,773 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:30,773 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, 1] [2019-11-15 22:37:30,774 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:37:30,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:30,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1054430755, now seen corresponding path program 1 times [2019-11-15 22:37:30,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:30,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488643408] [2019-11-15 22:37:30,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:30,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:30,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:30,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:37:30,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488643408] [2019-11-15 22:37:30,880 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:30,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:37:30,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966019573] [2019-11-15 22:37:30,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:37:30,881 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:30,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:37:30,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:37:30,881 INFO L87 Difference]: Start difference. First operand 214 states and 249 transitions. Second operand 7 states. [2019-11-15 22:37:31,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:31,311 INFO L93 Difference]: Finished difference Result 237 states and 274 transitions. [2019-11-15 22:37:31,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:37:31,312 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-11-15 22:37:31,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:31,313 INFO L225 Difference]: With dead ends: 237 [2019-11-15 22:37:31,313 INFO L226 Difference]: Without dead ends: 237 [2019-11-15 22:37:31,313 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:37:31,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-15 22:37:31,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 221. [2019-11-15 22:37:31,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-15 22:37:31,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 261 transitions. [2019-11-15 22:37:31,320 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 261 transitions. Word has length 39 [2019-11-15 22:37:31,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:31,320 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 261 transitions. [2019-11-15 22:37:31,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:37:31,321 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 261 transitions. [2019-11-15 22:37:31,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 22:37:31,322 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:31,322 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, 1] [2019-11-15 22:37:31,322 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:37:31,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:31,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1054430756, now seen corresponding path program 1 times [2019-11-15 22:37:31,323 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:31,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425570745] [2019-11-15 22:37:31,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:31,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:31,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:31,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:37:31,427 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425570745] [2019-11-15 22:37:31,427 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:37:31,427 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:37:31,427 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602718709] [2019-11-15 22:37:31,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:37:31,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:31,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:37:31,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:37:31,429 INFO L87 Difference]: Start difference. First operand 221 states and 261 transitions. Second operand 7 states. [2019-11-15 22:37:31,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:31,887 INFO L93 Difference]: Finished difference Result 233 states and 269 transitions. [2019-11-15 22:37:31,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:37:31,887 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-11-15 22:37:31,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:31,889 INFO L225 Difference]: With dead ends: 233 [2019-11-15 22:37:31,889 INFO L226 Difference]: Without dead ends: 233 [2019-11-15 22:37:31,889 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:37:31,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-11-15 22:37:31,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 219. [2019-11-15 22:37:31,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-15 22:37:31,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 256 transitions. [2019-11-15 22:37:31,896 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 256 transitions. Word has length 39 [2019-11-15 22:37:31,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:31,896 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 256 transitions. [2019-11-15 22:37:31,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:37:31,897 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 256 transitions. [2019-11-15 22:37:31,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 22:37:31,898 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:31,898 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-11-15 22:37:31,898 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:37:31,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:31,899 INFO L82 PathProgramCache]: Analyzing trace with hash -362725188, now seen corresponding path program 1 times [2019-11-15 22:37:31,899 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:31,899 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705734406] [2019-11-15 22:37:31,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:31,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:31,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:32,287 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:37:32,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705734406] [2019-11-15 22:37:32,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591650050] [2019-11-15 22:37:32,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/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 22:37:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:32,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-15 22:37:32,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:32,443 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:32,444 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 22:37:32,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:32,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:32,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:32,463 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-15 22:37:32,516 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 22:37:32,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:32,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:32,541 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 22:37:32,542 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:32,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:32,558 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 22:37:32,558 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2019-11-15 22:37:32,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:37:32,670 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 22:37:32,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:32,708 INFO L567 ElimStorePlain]: treesize reduction 3, result has 93.6 percent of original size [2019-11-15 22:37:32,734 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:32,735 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 22:37:32,735 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:32,768 INFO L567 ElimStorePlain]: treesize reduction 24, result has 60.0 percent of original size [2019-11-15 22:37:32,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:32,768 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:36 [2019-11-15 22:37:32,851 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:32,851 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 85 treesize of output 98 [2019-11-15 22:37:32,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:32,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:32,880 INFO L567 ElimStorePlain]: treesize reduction 48, result has 57.5 percent of original size [2019-11-15 22:37:32,887 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 22:37:32,887 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:32,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:32,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:32,897 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:38 [2019-11-15 22:37:33,104 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:33,104 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 61 treesize of output 63 [2019-11-15 22:37:33,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:33,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:33,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:33,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:33,108 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 22:37:33,136 INFO L567 ElimStorePlain]: treesize reduction 28, result has 54.1 percent of original size [2019-11-15 22:37:33,143 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:33,143 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 22:37:33,144 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:33,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:33,150 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 22:37:33,150 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:7 [2019-11-15 22:37:33,161 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:37:33,161 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:37:33,161 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 26 [2019-11-15 22:37:33,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523731629] [2019-11-15 22:37:33,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-15 22:37:33,162 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:33,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-15 22:37:33,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2019-11-15 22:37:33,164 INFO L87 Difference]: Start difference. First operand 219 states and 256 transitions. Second operand 26 states. [2019-11-15 22:37:35,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:35,642 INFO L93 Difference]: Finished difference Result 377 states and 430 transitions. [2019-11-15 22:37:35,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 22:37:35,643 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 39 [2019-11-15 22:37:35,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:35,645 INFO L225 Difference]: With dead ends: 377 [2019-11-15 22:37:35,646 INFO L226 Difference]: Without dead ends: 377 [2019-11-15 22:37:35,647 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=308, Invalid=1948, Unknown=0, NotChecked=0, Total=2256 [2019-11-15 22:37:35,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-15 22:37:35,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 222. [2019-11-15 22:37:35,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-11-15 22:37:35,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 259 transitions. [2019-11-15 22:37:35,656 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 259 transitions. Word has length 39 [2019-11-15 22:37:35,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:35,656 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 259 transitions. [2019-11-15 22:37:35,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-15 22:37:35,656 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 259 transitions. [2019-11-15 22:37:35,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 22:37:35,657 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:35,657 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] [2019-11-15 22:37:35,870 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:35,871 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:37:35,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:35,871 INFO L82 PathProgramCache]: Analyzing trace with hash 457838718, now seen corresponding path program 2 times [2019-11-15 22:37:35,872 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:35,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669412114] [2019-11-15 22:37:35,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:35,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:35,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:36,326 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:37:36,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669412114] [2019-11-15 22:37:36,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969866617] [2019-11-15 22:37:36,327 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/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 22:37:36,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:37:36,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:37:36,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-15 22:37:36,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:36,667 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:36,668 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 22:37:36,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:36,827 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-11-15 22:37:36,827 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-15 22:37:36,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:36,828 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-15 22:37:36,890 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 22:37:36,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:36,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:36,904 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 22:37:36,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2019-11-15 22:37:37,053 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:37,054 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 22:37:37,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:37,080 INFO L567 ElimStorePlain]: treesize reduction 24, result has 57.1 percent of original size [2019-11-15 22:37:37,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:37,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:32 [2019-11-15 22:37:37,138 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-15 22:37:37,138 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 22:37:37,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:37,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:37,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:37,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:32 [2019-11-15 22:37:37,168 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:37,169 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 22:37:37,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:37,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:37,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:37,180 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:30 [2019-11-15 22:37:37,223 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 22:37:37,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:37,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:37,237 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 22:37:37,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:36 [2019-11-15 22:37:37,402 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:37,402 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 68 treesize of output 105 [2019-11-15 22:37:37,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:37,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:37,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:37:37,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:37,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:37,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:37,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:37,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:37:37,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:37,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:37,411 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 22:37:37,488 INFO L567 ElimStorePlain]: treesize reduction 60, result has 41.2 percent of original size [2019-11-15 22:37:37,489 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 22:37:37,489 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:51 [2019-11-15 22:37:37,661 INFO L341 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-11-15 22:37:37,662 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 104 treesize of output 143 [2019-11-15 22:37:37,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:37:37,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:37,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:37,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:37,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:37,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:37,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:37,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:37,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:37,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:37,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 22:37:37,714 INFO L567 ElimStorePlain]: treesize reduction 330, result has 16.5 percent of original size [2019-11-15 22:37:37,714 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 1 xjuncts. [2019-11-15 22:37:37,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:107, output treesize:64 [2019-11-15 22:37:37,896 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:37,897 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 68 treesize of output 66 [2019-11-15 22:37:37,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:37,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:37,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:37,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:37,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:37,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:37,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:37,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:37,903 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 22:37:37,928 INFO L567 ElimStorePlain]: treesize reduction 36, result has 33.3 percent of original size [2019-11-15 22:37:37,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:37,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:68, output treesize:5 [2019-11-15 22:37:37,946 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:37:37,946 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:37:37,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2019-11-15 22:37:37,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741764157] [2019-11-15 22:37:37,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-15 22:37:37,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:37,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-15 22:37:37,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=922, Unknown=3, NotChecked=0, Total=1056 [2019-11-15 22:37:37,948 INFO L87 Difference]: Start difference. First operand 222 states and 259 transitions. Second operand 33 states. [2019-11-15 22:37:41,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:41,678 INFO L93 Difference]: Finished difference Result 542 states and 625 transitions. [2019-11-15 22:37:41,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-11-15 22:37:41,678 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2019-11-15 22:37:41,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:41,682 INFO L225 Difference]: With dead ends: 542 [2019-11-15 22:37:41,682 INFO L226 Difference]: Without dead ends: 542 [2019-11-15 22:37:41,684 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=705, Invalid=4110, Unknown=15, NotChecked=0, Total=4830 [2019-11-15 22:37:41,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-11-15 22:37:41,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 251. [2019-11-15 22:37:41,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-15 22:37:41,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 292 transitions. [2019-11-15 22:37:41,694 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 292 transitions. Word has length 40 [2019-11-15 22:37:41,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:41,695 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 292 transitions. [2019-11-15 22:37:41,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-15 22:37:41,695 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 292 transitions. [2019-11-15 22:37:41,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 22:37:41,696 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:41,696 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] [2019-11-15 22:37:41,901 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:41,901 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:37:41,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:41,901 INFO L82 PathProgramCache]: Analyzing trace with hash 457838719, now seen corresponding path program 2 times [2019-11-15 22:37:41,902 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:41,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818700820] [2019-11-15 22:37:41,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:41,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:41,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:42,372 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:37:42,372 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818700820] [2019-11-15 22:37:42,372 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87286412] [2019-11-15 22:37:42,372 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/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 22:37:42,519 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:37:42,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:37:42,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-15 22:37:42,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:42,642 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:42,642 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 22:37:42,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:42,673 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-15 22:37:42,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:42,673 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-15 22:37:42,729 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 22:37:42,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:42,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:42,750 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 22:37:42,750 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:42,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:42,765 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 22:37:42,765 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2019-11-15 22:37:42,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:37:42,904 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 22:37:42,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:42,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:42,943 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:42,943 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 22:37:42,944 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:42,981 INFO L567 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2019-11-15 22:37:42,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:42,982 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:49 [2019-11-15 22:37:43,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:37:43,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, 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 22:37:43,047 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:43,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:43,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:37:43,077 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 22:37:43,077 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:43,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:43,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:43,101 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:56 [2019-11-15 22:37:43,163 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_68|], 3=[|v_#valid_83|]} [2019-11-15 22:37:43,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:37:43,169 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 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-15 22:37:43,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:43,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:43,208 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:43,209 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 22:37:43,209 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:43,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:43,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:43,231 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:59 [2019-11-15 22:37:43,297 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 22:37:43,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:43,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:43,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, 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 22:37:43,365 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:43,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:43,399 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 22:37:43,399 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:81, output treesize:57 [2019-11-15 22:37:43,700 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_49|], 6=[|v_#memory_$Pointer$.base_56|]} [2019-11-15 22:37:43,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:37:43,712 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 22:37:43,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:43,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:43,810 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:43,811 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 22:37:43,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:37:43,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:43,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:43,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:43,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:43,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:43,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:43,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:37:43,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:43,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:43,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:43,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:43,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:43,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:43,823 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 22:37:43,935 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2019-11-15 22:37:43,935 INFO L567 ElimStorePlain]: treesize reduction 60, result has 52.4 percent of original size [2019-11-15 22:37:43,936 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 22:37:43,936 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:107, output treesize:75 [2019-11-15 22:37:44,023 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_50|], 12=[|v_#memory_$Pointer$.base_57|]} [2019-11-15 22:37:44,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:37:44,029 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 22:37:44,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:44,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:44,158 INFO L341 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-11-15 22:37:44,159 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 134 treesize of output 157 [2019-11-15 22:37:44,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:44,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:37:44,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:37:44,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:44,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:44,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:44,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:44,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:37:44,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:44,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:44,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:44,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:44,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:37:44,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:44,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:44,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:44,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:44,173 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-15 22:37:44,303 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2019-11-15 22:37:44,303 INFO L567 ElimStorePlain]: treesize reduction 1001, result has 9.5 percent of original size [2019-11-15 22:37:44,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:37:44,304 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:190, output treesize:104 [2019-11-15 22:37:44,471 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2019-11-15 22:37:44,480 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 22:37:44,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:44,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:44,522 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:44,522 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 83 treesize of output 73 [2019-11-15 22:37:44,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:44,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:44,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:44,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:44,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:44,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:44,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:44,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:44,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:44,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:37:44,528 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 22:37:44,568 INFO L567 ElimStorePlain]: treesize reduction 36, result has 46.3 percent of original size [2019-11-15 22:37:44,569 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 22:37:44,569 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:115, output treesize:18 [2019-11-15 22:37:44,676 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:37:44,677 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:37:44,677 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 36 [2019-11-15 22:37:44,677 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653975406] [2019-11-15 22:37:44,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-15 22:37:44,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:44,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-15 22:37:44,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1194, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 22:37:44,679 INFO L87 Difference]: Start difference. First operand 251 states and 292 transitions. Second operand 37 states. [2019-11-15 22:37:50,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:50,148 INFO L93 Difference]: Finished difference Result 501 states and 580 transitions. [2019-11-15 22:37:50,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-15 22:37:50,149 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 40 [2019-11-15 22:37:50,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:50,152 INFO L225 Difference]: With dead ends: 501 [2019-11-15 22:37:50,153 INFO L226 Difference]: Without dead ends: 501 [2019-11-15 22:37:50,154 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=667, Invalid=4025, Unknown=0, NotChecked=0, Total=4692 [2019-11-15 22:37:50,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-11-15 22:37:50,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 251. [2019-11-15 22:37:50,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-15 22:37:50,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 291 transitions. [2019-11-15 22:37:50,168 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 291 transitions. Word has length 40 [2019-11-15 22:37:50,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:50,168 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 291 transitions. [2019-11-15 22:37:50,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-15 22:37:50,169 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 291 transitions. [2019-11-15 22:37:50,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 22:37:50,170 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:50,170 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, 1, 1, 1, 1] [2019-11-15 22:37:50,377 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:50,378 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:37:50,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:50,378 INFO L82 PathProgramCache]: Analyzing trace with hash -844076378, now seen corresponding path program 1 times [2019-11-15 22:37:50,379 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:50,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127833519] [2019-11-15 22:37:50,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:50,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:50,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:50,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:37:50,670 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127833519] [2019-11-15 22:37:50,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461678986] [2019-11-15 22:37:50,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/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 22:37:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:50,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-15 22:37:50,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:50,847 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:50,847 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 22:37:50,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:50,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:50,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:50,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-15 22:37:50,867 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 22:37:50,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:50,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:50,881 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 22:37:50,881 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:50,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:50,890 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 22:37:50,890 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2019-11-15 22:37:50,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-15 22:37:50,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:50,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:50,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:50,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2019-11-15 22:37:50,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:37:50,918 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 22:37:50,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:50,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:50,925 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:50,925 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:19 [2019-11-15 22:37:50,985 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-15 22:37:50,986 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 22:37:50,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:50,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:50,998 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 1 xjuncts. [2019-11-15 22:37:50,998 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2019-11-15 22:37:51,113 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 22:37:51,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:51,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:51,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:51,125 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-15 22:37:51,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:37:51,232 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:37:51,233 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 22 [2019-11-15 22:37:51,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227525266] [2019-11-15 22:37:51,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-15 22:37:51,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:51,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 22:37:51,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-11-15 22:37:51,236 INFO L87 Difference]: Start difference. First operand 251 states and 291 transitions. Second operand 23 states. [2019-11-15 22:37:54,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:54,129 INFO L93 Difference]: Finished difference Result 440 states and 501 transitions. [2019-11-15 22:37:54,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-11-15 22:37:54,130 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2019-11-15 22:37:54,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:54,132 INFO L225 Difference]: With dead ends: 440 [2019-11-15 22:37:54,132 INFO L226 Difference]: Without dead ends: 440 [2019-11-15 22:37:54,134 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1180 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=643, Invalid=3517, Unknown=0, NotChecked=0, Total=4160 [2019-11-15 22:37:54,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-11-15 22:37:54,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 265. [2019-11-15 22:37:54,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-11-15 22:37:54,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 309 transitions. [2019-11-15 22:37:54,142 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 309 transitions. Word has length 42 [2019-11-15 22:37:54,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:54,142 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 309 transitions. [2019-11-15 22:37:54,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-15 22:37:54,143 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 309 transitions. [2019-11-15 22:37:54,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 22:37:54,144 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:54,144 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 22:37:54,347 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:37:54,348 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:37:54,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:37:54,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1966844316, now seen corresponding path program 2 times [2019-11-15 22:37:54,348 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:37:54,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542837651] [2019-11-15 22:37:54,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:54,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:37:54,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:37:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:37:54,743 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 22:37:54,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542837651] [2019-11-15 22:37:54,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021784192] [2019-11-15 22:37:54,744 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/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 22:37:54,947 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:37:54,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:37:54,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-15 22:37:54,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:37:55,041 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:55,041 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 22:37:55,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:55,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:55,050 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:55,050 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-15 22:37:55,091 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 22:37:55,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:55,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:55,119 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 22:37:55,120 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:55,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:55,133 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 22:37:55,133 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30 [2019-11-15 22:37:55,175 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-15 22:37:55,175 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:55,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:55,182 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:55,182 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:20 [2019-11-15 22:37:55,254 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 22:37:55,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:55,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:55,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:55,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-15 22:37:55,314 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-15 22:37:55,314 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 22:37:55,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:55,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:55,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:55,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:27 [2019-11-15 22:37:55,332 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:55,332 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 22:37:55,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:55,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:55,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:55,341 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2019-11-15 22:37:55,379 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_60|], 6=[|v_#memory_$Pointer$.offset_57|]} [2019-11-15 22:37:55,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 22:37:55,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:55,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:55,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, 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 22:37:55,429 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:55,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:55,441 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 22:37:55,441 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:23 [2019-11-15 22:37:55,478 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 8 [2019-11-15 22:37:55,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:55,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:55,487 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 22:37:55,487 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:15 [2019-11-15 22:37:55,560 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 22:37:55,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:55,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:55,568 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:37:55,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-15 22:37:55,614 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-15 22:37:55,615 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 22:37:55,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:55,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:55,623 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 1 xjuncts. [2019-11-15 22:37:55,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:22 [2019-11-15 22:37:55,847 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 2=[|#memory_$Pointer$.offset|]} [2019-11-15 22:37:55,851 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 15 [2019-11-15 22:37:55,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:55,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:55,871 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 33 treesize of output 17 [2019-11-15 22:37:55,872 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:37:55,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:37:55,885 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 22:37:55,885 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:9 [2019-11-15 22:37:55,987 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 22:37:55,988 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:37:55,988 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2019-11-15 22:37:55,988 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866431256] [2019-11-15 22:37:55,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-15 22:37:55,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:37:55,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-15 22:37:55,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1385, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 22:37:55,990 INFO L87 Difference]: Start difference. First operand 265 states and 309 transitions. Second operand 40 states. [2019-11-15 22:37:59,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:37:59,928 INFO L93 Difference]: Finished difference Result 395 states and 449 transitions. [2019-11-15 22:37:59,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-15 22:37:59,930 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 45 [2019-11-15 22:37:59,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:37:59,932 INFO L225 Difference]: With dead ends: 395 [2019-11-15 22:37:59,932 INFO L226 Difference]: Without dead ends: 395 [2019-11-15 22:37:59,934 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1312 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=674, Invalid=4018, Unknown=0, NotChecked=0, Total=4692 [2019-11-15 22:37:59,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-11-15 22:37:59,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 274. [2019-11-15 22:37:59,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-11-15 22:37:59,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 320 transitions. [2019-11-15 22:37:59,942 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 320 transitions. Word has length 45 [2019-11-15 22:37:59,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:37:59,942 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 320 transitions. [2019-11-15 22:37:59,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-15 22:37:59,943 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 320 transitions. [2019-11-15 22:37:59,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 22:37:59,944 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:37:59,944 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:38:00,149 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:38:00,150 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:38:00,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:00,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1038498291, now seen corresponding path program 1 times [2019-11-15 22:38:00,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:38:00,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899573710] [2019-11-15 22:38:00,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:00,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:00,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:38:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:38:00,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899573710] [2019-11-15 22:38:00,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363325861] [2019-11-15 22:38:00,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/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 22:38:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:00,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-15 22:38:00,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:38:00,630 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:00,631 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 22:38:00,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:00,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:00,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:00,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-15 22:38:00,667 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 22:38:00,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:00,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:00,684 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 22:38:00,685 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:00,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:00,693 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 22:38:00,694 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2019-11-15 22:38:00,800 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:00,800 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 22:38:00,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:00,830 INFO L567 ElimStorePlain]: treesize reduction 27, result has 62.0 percent of original size [2019-11-15 22:38:00,833 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 22:38:00,834 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:00,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:00,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:00,845 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-11-15 22:38:00,897 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:00,897 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 126 [2019-11-15 22:38:00,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:00,926 INFO L567 ElimStorePlain]: treesize reduction 58, result has 59.4 percent of original size [2019-11-15 22:38:00,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:00,967 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:00,967 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 78 treesize of output 125 [2019-11-15 22:38:00,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:00,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:38:00,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:00,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:00,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:00,971 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-11-15 22:38:01,040 INFO L567 ElimStorePlain]: treesize reduction 238, result has 16.5 percent of original size [2019-11-15 22:38:01,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:01,041 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:124, output treesize:46 [2019-11-15 22:38:01,297 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:01,298 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 69 treesize of output 52 [2019-11-15 22:38:01,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:01,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:01,300 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 22:38:01,335 INFO L567 ElimStorePlain]: treesize reduction 16, result has 69.8 percent of original size [2019-11-15 22:38:01,342 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 0 case distinctions, treesize of input 30 treesize of output 13 [2019-11-15 22:38:01,343 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:01,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:01,350 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 22:38:01,350 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:7 [2019-11-15 22:38:01,367 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:38:01,367 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:38:01,367 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 26 [2019-11-15 22:38:01,368 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499900399] [2019-11-15 22:38:01,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-15 22:38:01,368 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:38:01,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-15 22:38:01,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2019-11-15 22:38:01,369 INFO L87 Difference]: Start difference. First operand 274 states and 320 transitions. Second operand 26 states. [2019-11-15 22:38:04,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:04,022 INFO L93 Difference]: Finished difference Result 373 states and 421 transitions. [2019-11-15 22:38:04,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 22:38:04,022 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-11-15 22:38:04,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:04,024 INFO L225 Difference]: With dead ends: 373 [2019-11-15 22:38:04,024 INFO L226 Difference]: Without dead ends: 373 [2019-11-15 22:38:04,025 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=307, Invalid=1949, Unknown=0, NotChecked=0, Total=2256 [2019-11-15 22:38:04,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-11-15 22:38:04,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 269. [2019-11-15 22:38:04,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-11-15 22:38:04,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 313 transitions. [2019-11-15 22:38:04,032 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 313 transitions. Word has length 48 [2019-11-15 22:38:04,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:04,032 INFO L462 AbstractCegarLoop]: Abstraction has 269 states and 313 transitions. [2019-11-15 22:38:04,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-15 22:38:04,033 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 313 transitions. [2019-11-15 22:38:04,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 22:38:04,033 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:04,034 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:38:04,238 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:38:04,239 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:38:04,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:04,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1832642686, now seen corresponding path program 1 times [2019-11-15 22:38:04,239 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:38:04,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960073013] [2019-11-15 22:38:04,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:04,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:04,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:38:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:38:04,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960073013] [2019-11-15 22:38:04,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:38:04,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:38:04,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000796852] [2019-11-15 22:38:04,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:38:04,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:38:04,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:38:04,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:38:04,356 INFO L87 Difference]: Start difference. First operand 269 states and 313 transitions. Second operand 7 states. [2019-11-15 22:38:04,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:04,802 INFO L93 Difference]: Finished difference Result 300 states and 342 transitions. [2019-11-15 22:38:04,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:38:04,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-11-15 22:38:04,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:04,805 INFO L225 Difference]: With dead ends: 300 [2019-11-15 22:38:04,805 INFO L226 Difference]: Without dead ends: 300 [2019-11-15 22:38:04,805 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:38:04,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-15 22:38:04,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 269. [2019-11-15 22:38:04,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-11-15 22:38:04,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 311 transitions. [2019-11-15 22:38:04,811 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 311 transitions. Word has length 48 [2019-11-15 22:38:04,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:04,811 INFO L462 AbstractCegarLoop]: Abstraction has 269 states and 311 transitions. [2019-11-15 22:38:04,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:38:04,811 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 311 transitions. [2019-11-15 22:38:04,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 22:38:04,812 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:04,812 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 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] [2019-11-15 22:38:04,813 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:38:04,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:04,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1244826729, now seen corresponding path program 2 times [2019-11-15 22:38:04,813 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:38:04,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507319977] [2019-11-15 22:38:04,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:04,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:04,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:38:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:05,477 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:38:05,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507319977] [2019-11-15 22:38:05,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320929435] [2019-11-15 22:38:05,478 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/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 22:38:05,658 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:38:05,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:38:05,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 67 conjunts are in the unsatisfiable core [2019-11-15 22:38:05,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:38:05,814 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:05,815 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 22:38:05,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:05,858 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-15 22:38:05,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:05,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-15 22:38:05,938 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 22:38:05,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:05,971 INFO L567 ElimStorePlain]: treesize reduction 5, result has 89.4 percent of original size [2019-11-15 22:38:05,976 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 22:38:05,977 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:05,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:05,991 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 22:38:05,991 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:39 [2019-11-15 22:38:06,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:06,156 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 22:38:06,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:06,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:06,205 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:06,205 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 22:38:06,206 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:06,257 INFO L567 ElimStorePlain]: treesize reduction 16, result has 75.4 percent of original size [2019-11-15 22:38:06,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:06,257 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:49 [2019-11-15 22:38:06,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:06,329 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 22:38:06,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:06,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:06,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:06,359 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 22:38:06,360 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:06,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:06,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:06,377 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:49 [2019-11-15 22:38:06,444 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:06,445 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 22:38:06,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:06,542 INFO L567 ElimStorePlain]: treesize reduction 28, result has 68.9 percent of original size [2019-11-15 22:38:06,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:06,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:62 [2019-11-15 22:38:06,672 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 22:38:06,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:06,754 INFO L567 ElimStorePlain]: treesize reduction 4, result has 94.5 percent of original size [2019-11-15 22:38:06,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:06,761 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 22:38:06,761 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:06,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:06,800 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 22:38:06,801 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:84, output treesize:56 [2019-11-15 22:38:07,029 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_67|], 6=[|v_#memory_$Pointer$.base_68|]} [2019-11-15 22:38:07,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:07,054 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 22:38:07,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:07,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:07,162 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:07,163 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 73 treesize of output 102 [2019-11-15 22:38:07,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:07,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:38:07,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:07,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:07,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:07,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:07,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:38:07,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:07,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:07,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:07,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:07,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:07,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:07,172 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 22:38:07,245 INFO L567 ElimStorePlain]: treesize reduction 56, result has 52.5 percent of original size [2019-11-15 22:38:07,245 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:07,245 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:67 [2019-11-15 22:38:07,317 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_68|], 12=[|v_#memory_$Pointer$.base_69|]} [2019-11-15 22:38:07,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:07,329 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 22:38:07,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:07,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:07,456 INFO L341 Elim1Store]: treesize reduction 50, result has 66.2 percent of original size [2019-11-15 22:38:07,456 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 124 treesize of output 147 [2019-11-15 22:38:07,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:07,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:38:07,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:38:07,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:07,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:07,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:38:07,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:07,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:07,461 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-15 22:38:07,593 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2019-11-15 22:38:07,593 INFO L567 ElimStorePlain]: treesize reduction 1029, result has 8.6 percent of original size [2019-11-15 22:38:07,594 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 22:38:07,594 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:182, output treesize:96 [2019-11-15 22:38:07,784 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 22:38:07,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:07,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:07,811 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 1 xjuncts. [2019-11-15 22:38:07,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:107, output treesize:81 [2019-11-15 22:38:07,979 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:07,980 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 77 treesize of output 63 [2019-11-15 22:38:07,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:07,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:07,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:07,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:07,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:07,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:07,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:07,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:07,983 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 22:38:08,010 INFO L567 ElimStorePlain]: treesize reduction 28, result has 50.0 percent of original size [2019-11-15 22:38:08,011 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 1 xjuncts. [2019-11-15 22:38:08,011 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:82, output treesize:28 [2019-11-15 22:38:08,088 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:38:08,089 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:38:08,089 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 40 [2019-11-15 22:38:08,089 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184735817] [2019-11-15 22:38:08,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-15 22:38:08,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:38:08,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-15 22:38:08,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1468, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 22:38:08,091 INFO L87 Difference]: Start difference. First operand 269 states and 311 transitions. Second operand 41 states. [2019-11-15 22:38:11,291 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-11-15 22:38:12,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:12,831 INFO L93 Difference]: Finished difference Result 452 states and 518 transitions. [2019-11-15 22:38:12,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-15 22:38:12,832 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 49 [2019-11-15 22:38:12,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:12,834 INFO L225 Difference]: With dead ends: 452 [2019-11-15 22:38:12,834 INFO L226 Difference]: Without dead ends: 452 [2019-11-15 22:38:12,836 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=649, Invalid=4463, Unknown=0, NotChecked=0, Total=5112 [2019-11-15 22:38:12,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-15 22:38:12,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 278. [2019-11-15 22:38:12,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-11-15 22:38:12,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 323 transitions. [2019-11-15 22:38:12,843 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 323 transitions. Word has length 49 [2019-11-15 22:38:12,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:12,843 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 323 transitions. [2019-11-15 22:38:12,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-15 22:38:12,844 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 323 transitions. [2019-11-15 22:38:12,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 22:38:12,845 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:12,845 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 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] [2019-11-15 22:38:13,049 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:38:13,050 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:38:13,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:13,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1244826730, now seen corresponding path program 1 times [2019-11-15 22:38:13,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:38:13,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746307899] [2019-11-15 22:38:13,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:13,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:13,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:38:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:13,603 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:38:13,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746307899] [2019-11-15 22:38:13,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006510930] [2019-11-15 22:38:13,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:38:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:13,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 78 conjunts are in the unsatisfiable core [2019-11-15 22:38:13,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:38:13,875 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 22:38:13,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:13,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:13,891 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 22:38:13,891 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:13,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:13,902 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 22:38:13,902 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2019-11-15 22:38:14,053 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:14,053 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 26 treesize of output 45 [2019-11-15 22:38:14,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:14,089 INFO L567 ElimStorePlain]: treesize reduction 24, result has 64.7 percent of original size [2019-11-15 22:38:14,105 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:14,105 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 19 treesize of output 34 [2019-11-15 22:38:14,106 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:14,138 INFO L567 ElimStorePlain]: treesize reduction 12, result has 78.6 percent of original size [2019-11-15 22:38:14,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:14,139 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2019-11-15 22:38:14,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:14,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:14,204 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:38:14,207 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 51 [2019-11-15 22:38:14,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:14,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:14,226 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:14,226 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 78 treesize of output 73 [2019-11-15 22:38:14,226 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:14,346 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-11-15 22:38:14,346 INFO L567 ElimStorePlain]: treesize reduction 16, result has 87.1 percent of original size [2019-11-15 22:38:14,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:14,381 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:14,382 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 59 treesize of output 54 [2019-11-15 22:38:14,382 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:14,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:14,391 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 48 treesize of output 32 [2019-11-15 22:38:14,392 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:14,468 INFO L567 ElimStorePlain]: treesize reduction 8, result has 89.7 percent of original size [2019-11-15 22:38:14,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 22:38:14,469 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:153, output treesize:70 [2019-11-15 22:38:14,526 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_69|], 1=[|v_#valid_90|]} [2019-11-15 22:38:14,538 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 50 treesize of output 49 [2019-11-15 22:38:14,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:14,546 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 54 treesize of output 53 [2019-11-15 22:38:14,546 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:14,646 INFO L567 ElimStorePlain]: treesize reduction 7, result has 93.2 percent of original size [2019-11-15 22:38:14,665 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:14,665 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 53 treesize of output 57 [2019-11-15 22:38:14,665 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:14,674 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:14,675 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 42 treesize of output 46 [2019-11-15 22:38:14,675 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:14,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:14,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-15 22:38:14,716 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:105, output treesize:84 [2019-11-15 22:38:14,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:14,806 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_73|, |v_#memory_$Pointer$.offset_72|], 6=[v_prenex_10, v_prenex_11]} [2019-11-15 22:38:14,820 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 55 treesize of output 47 [2019-11-15 22:38:14,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:14,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:14,888 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 44 treesize of output 36 [2019-11-15 22:38:14,889 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:14,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:14,953 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:14,953 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 66 treesize of output 85 [2019-11-15 22:38:14,954 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:15,043 INFO L567 ElimStorePlain]: treesize reduction 12, result has 89.4 percent of original size [2019-11-15 22:38:15,064 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:15,064 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 67 treesize of output 86 [2019-11-15 22:38:15,065 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:15,170 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-11-15 22:38:15,171 INFO L567 ElimStorePlain]: treesize reduction 16, result has 84.9 percent of original size [2019-11-15 22:38:15,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 22:38:15,171 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:122, output treesize:92 [2019-11-15 22:38:15,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:15,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:15,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:15,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:15,491 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:15,491 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 1 case distinctions, treesize of input 94 treesize of output 124 [2019-11-15 22:38:15,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:15,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:15,502 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 62 [2019-11-15 22:38:15,502 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:15,608 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-11-15 22:38:15,609 INFO L567 ElimStorePlain]: treesize reduction 42, result has 76.4 percent of original size [2019-11-15 22:38:15,627 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:15,628 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 56 treesize of output 63 [2019-11-15 22:38:15,628 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:15,680 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:15,680 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 79 treesize of output 104 [2019-11-15 22:38:15,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:15,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:15,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:15,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:15,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:15,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:15,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:15,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:15,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:15,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:15,686 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:38:15,784 INFO L567 ElimStorePlain]: treesize reduction 56, result has 64.8 percent of original size [2019-11-15 22:38:15,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 22:38:15,785 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:162, output treesize:104 [2019-11-15 22:38:15,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:15,902 INFO L392 ElimStorePlain]: Different costs {1=[v_prenex_12], 4=[v_prenex_13], 7=[|v_#memory_$Pointer$.base_75|, |v_#memory_$Pointer$.offset_74|]} [2019-11-15 22:38:15,921 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:15,922 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 104 treesize of output 81 [2019-11-15 22:38:15,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:16,082 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-11-15 22:38:16,083 INFO L567 ElimStorePlain]: treesize reduction 24, result has 90.7 percent of original size [2019-11-15 22:38:16,099 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 77 treesize of output 56 [2019-11-15 22:38:16,100 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:16,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:16,195 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:16,195 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 3 case distinctions, treesize of input 155 treesize of output 114 [2019-11-15 22:38:16,197 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:16,310 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-11-15 22:38:16,310 INFO L567 ElimStorePlain]: treesize reduction 96, result has 63.5 percent of original size [2019-11-15 22:38:16,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:16,337 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:16,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 106 [2019-11-15 22:38:16,338 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:16,442 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-11-15 22:38:16,443 INFO L567 ElimStorePlain]: treesize reduction 32, result has 80.0 percent of original size [2019-11-15 22:38:16,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 22:38:16,443 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:260, output treesize:128 [2019-11-15 22:38:17,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:17,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:17,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:17,828 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 95 [2019-11-15 22:38:18,039 INFO L341 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2019-11-15 22:38:18,039 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 128 treesize of output 89 [2019-11-15 22:38:18,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:18,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:18,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:18,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:18,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:18,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:18,049 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 22:38:18,119 INFO L567 ElimStorePlain]: treesize reduction 16, result has 80.2 percent of original size [2019-11-15 22:38:18,130 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:18,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 31 [2019-11-15 22:38:18,131 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:18,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:18,157 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 22:38:18,157 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:135, output treesize:22 [2019-11-15 22:38:18,330 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:38:18,331 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:38:18,331 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 43 [2019-11-15 22:38:18,331 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288501171] [2019-11-15 22:38:18,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-11-15 22:38:18,332 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:38:18,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-11-15 22:38:18,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1759, Unknown=0, NotChecked=0, Total=1892 [2019-11-15 22:38:18,333 INFO L87 Difference]: Start difference. First operand 278 states and 323 transitions. Second operand 44 states. [2019-11-15 22:38:19,641 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-11-15 22:38:20,033 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-11-15 22:38:20,264 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 55 [2019-11-15 22:38:20,479 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2019-11-15 22:38:22,244 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 54 [2019-11-15 22:38:22,742 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 62 [2019-11-15 22:38:23,030 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 65 [2019-11-15 22:38:23,318 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 61 [2019-11-15 22:38:23,711 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 115 [2019-11-15 22:38:24,031 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 110 [2019-11-15 22:38:24,413 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 118 [2019-11-15 22:38:24,893 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 152 [2019-11-15 22:38:25,302 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 95 [2019-11-15 22:38:25,942 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 103 [2019-11-15 22:38:26,380 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 101 [2019-11-15 22:38:26,657 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2019-11-15 22:38:27,078 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 138 [2019-11-15 22:38:27,331 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 98 [2019-11-15 22:38:27,650 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 108 [2019-11-15 22:38:28,186 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 142 [2019-11-15 22:38:28,673 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 87 [2019-11-15 22:38:29,292 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 95 [2019-11-15 22:38:29,725 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 93 [2019-11-15 22:38:30,254 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 130 [2019-11-15 22:38:30,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:30,564 INFO L93 Difference]: Finished difference Result 459 states and 522 transitions. [2019-11-15 22:38:30,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-11-15 22:38:30,564 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 49 [2019-11-15 22:38:30,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:30,567 INFO L225 Difference]: With dead ends: 459 [2019-11-15 22:38:30,567 INFO L226 Difference]: Without dead ends: 459 [2019-11-15 22:38:30,570 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1959 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=970, Invalid=7402, Unknown=0, NotChecked=0, Total=8372 [2019-11-15 22:38:30,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-11-15 22:38:30,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 295. [2019-11-15 22:38:30,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-11-15 22:38:30,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 345 transitions. [2019-11-15 22:38:30,577 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 345 transitions. Word has length 49 [2019-11-15 22:38:30,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:30,578 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 345 transitions. [2019-11-15 22:38:30,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-11-15 22:38:30,578 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 345 transitions. [2019-11-15 22:38:30,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 22:38:30,579 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:30,579 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:38:30,783 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:38:30,784 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:38:30,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:30,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1247659407, now seen corresponding path program 3 times [2019-11-15 22:38:30,784 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:38:30,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244192603] [2019-11-15 22:38:30,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:30,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:30,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:38:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:31,292 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:38:31,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244192603] [2019-11-15 22:38:31,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584365241] [2019-11-15 22:38:31,292 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:38:31,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-15 22:38:31,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:38:31,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 71 conjunts are in the unsatisfiable core [2019-11-15 22:38:31,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:38:31,676 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:31,677 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 22:38:31,677 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:31,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:31,686 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:31,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-15 22:38:31,724 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 22:38:31,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:31,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:31,739 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 22:38:31,739 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:31,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:31,750 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 22:38:31,750 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2019-11-15 22:38:31,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:31,872 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 22:38:31,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:31,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:31,902 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:31,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, 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 22:38:31,903 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:31,932 INFO L567 ElimStorePlain]: treesize reduction 16, result has 70.9 percent of original size [2019-11-15 22:38:31,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:31,932 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:39 [2019-11-15 22:38:31,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:31,994 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 22:38:31,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:32,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:32,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:32,022 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 22:38:32,023 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:32,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:32,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:38:32,049 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:39 [2019-11-15 22:38:32,118 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 22:38:32,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:32,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:32,142 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 22:38:32,143 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:32,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:32,158 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 22:38:32,158 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:37 [2019-11-15 22:38:32,307 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_80|], 6=[|v_#memory_$Pointer$.offset_79|]} [2019-11-15 22:38:32,328 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:32,328 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 59 treesize of output 70 [2019-11-15 22:38:32,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:32,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:32,330 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 22:38:32,385 INFO L567 ElimStorePlain]: treesize reduction 16, result has 82.4 percent of original size [2019-11-15 22:38:32,422 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:32,422 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 41 treesize of output 82 [2019-11-15 22:38:32,423 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:32,485 INFO L567 ElimStorePlain]: treesize reduction 48, result has 55.1 percent of original size [2019-11-15 22:38:32,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:32,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:38:32,487 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:59 [2019-11-15 22:38:32,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:32,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:32,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:32,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:32,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:32,775 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_81|], 19=[|v_#memory_$Pointer$.offset_80|]} [2019-11-15 22:38:32,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:32,859 INFO L341 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-11-15 22:38:32,859 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 94 treesize of output 95 [2019-11-15 22:38:32,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:32,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:32,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:32,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:32,861 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 22:38:32,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:32,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 72 [2019-11-15 22:38:32,870 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:33,005 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-11-15 22:38:33,006 INFO L567 ElimStorePlain]: treesize reduction 22, result has 86.4 percent of original size [2019-11-15 22:38:33,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:33,019 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 59 treesize of output 46 [2019-11-15 22:38:33,020 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:33,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:38:33,106 INFO L341 Elim1Store]: treesize reduction 48, result has 55.1 percent of original size [2019-11-15 22:38:33,106 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 4 case distinctions, treesize of input 80 treesize of output 114 [2019-11-15 22:38:33,107 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:33,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:33,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:33,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:33,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-15 22:38:33,190 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:183, output treesize:122 [2019-11-15 22:38:33,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:33,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:33,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:33,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:33,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:33,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:33,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:33,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:33,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:33,406 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:33,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 54 treesize of output 76 [2019-11-15 22:38:33,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:33,445 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:33,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 70 treesize of output 108 [2019-11-15 22:38:33,446 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:33,471 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:33,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 59 treesize of output 81 [2019-11-15 22:38:33,472 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:33,494 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:33,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 63 treesize of output 85 [2019-11-15 22:38:33,495 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:33,729 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-11-15 22:38:33,729 INFO L567 ElimStorePlain]: treesize reduction 74, result has 76.2 percent of original size [2019-11-15 22:38:33,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-11-15 22:38:33,730 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:247, output treesize:237 [2019-11-15 22:38:33,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:38:33,915 INFO L392 ElimStorePlain]: Different costs {2=[v_prenex_19, |v_#memory_$Pointer$.base_82|], 6=[|v_#memory_$Pointer$.offset_81|, v_prenex_21, v_prenex_24, v_prenex_23, v_prenex_18], 12=[v_prenex_20]} [2019-11-15 22:38:33,935 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 71 treesize of output 63 [2019-11-15 22:38:33,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:34,365 WARN L191 SmtUtils]: Spent 428.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-11-15 22:38:34,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:34,376 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 73 treesize of output 65 [2019-11-15 22:38:34,376 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:34,653 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2019-11-15 22:38:34,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:34,666 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 62 treesize of output 57 [2019-11-15 22:38:34,666 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:34,877 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-11-15 22:38:34,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:34,916 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:34,916 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 110 [2019-11-15 22:38:34,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:34,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:34,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:34,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:38:34,919 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:38:35,311 WARN L191 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 122 [2019-11-15 22:38:35,312 INFO L567 ElimStorePlain]: treesize reduction 16, result has 94.6 percent of original size [2019-11-15 22:38:35,327 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 77 treesize of output 72 [2019-11-15 22:38:35,328 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:35,488 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-11-15 22:38:35,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:35,498 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 66 treesize of output 61 [2019-11-15 22:38:35,499 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:35,636 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-11-15 22:38:35,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:35,649 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 60 treesize of output 55 [2019-11-15 22:38:35,649 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 22:38:35,771 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-15 22:38:35,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:38:35,973 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:38:35,974 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-11-15 22:38:35,977 INFO L168 Benchmark]: Toolchain (without parser) took 85224.60 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 707.8 MB). Free memory was 943.4 MB in the beginning and 1.4 GB in the end (delta: -460.6 MB). Peak memory consumption was 247.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:38:35,978 INFO L168 Benchmark]: CDTParser took 0.29 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 22:38:35,978 INFO L168 Benchmark]: CACSL2BoogieTranslator took 725.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -198.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:38:35,979 INFO L168 Benchmark]: Boogie Preprocessor took 79.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:38:35,979 INFO L168 Benchmark]: RCFGBuilder took 987.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:38:35,979 INFO L168 Benchmark]: TraceAbstraction took 83428.47 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 542.6 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -336.2 MB). Peak memory consumption was 206.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:38:35,981 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.29 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 725.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -198.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 79.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 987.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 83428.47 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 542.6 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -336.2 MB). Peak memory consumption was 206.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 22:38:38,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:38:38,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:38:38,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:38:38,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:38:38,579 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:38:38,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:38:38,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:38:38,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:38:38,586 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:38:38,587 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:38:38,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:38:38,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:38:38,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:38:38,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:38:38,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:38:38,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:38:38,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:38:38,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:38:38,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:38:38,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:38:38,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:38:38,603 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:38:38,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:38:38,606 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:38:38,607 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:38:38,607 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:38:38,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:38:38,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:38:38,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:38:38,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:38:38,613 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:38:38,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:38:38,614 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:38:38,615 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:38:38,616 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:38:38,617 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:38:38,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:38:38,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:38:38,618 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:38:38,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:38:38,620 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2019-11-15 22:38:38,636 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:38:38,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:38:38,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:38:38,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:38:38,638 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:38:38,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:38:38,639 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:38:38,639 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:38:38,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:38:38,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:38:38,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:38:38,640 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 22:38:38,641 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 22:38:38,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:38:38,641 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 22:38:38,641 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 22:38:38,642 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:38:38,642 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:38:38,642 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:38:38,643 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:38:38,643 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:38:38,643 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:38:38,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:38:38,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:38:38,644 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:38:38,644 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 22:38:38,645 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 22:38:38,645 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 22:38:38,645 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/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-memcleanup) ) 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 -> 8be34918f5cf463066a3551693e083428b9e6ee2 [2019-11-15 22:38:38,681 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:38:38,693 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:38:38,697 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:38:38,698 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:38:38,699 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:38:38,700 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-sorted-1.i [2019-11-15 22:38:38,763 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/bin/uautomizer/data/f62503746/8f536162f4874469b8e30fa5cd4a8c2f/FLAG6c1438d16 [2019-11-15 22:38:39,347 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:38:39,348 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/sv-benchmarks/c/forester-heap/sll-sorted-1.i [2019-11-15 22:38:39,368 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/bin/uautomizer/data/f62503746/8f536162f4874469b8e30fa5cd4a8c2f/FLAG6c1438d16 [2019-11-15 22:38:39,566 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/bin/uautomizer/data/f62503746/8f536162f4874469b8e30fa5cd4a8c2f [2019-11-15 22:38:39,569 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:38:39,571 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 22:38:39,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:38:39,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:38:39,577 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:38:39,578 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:38:39" (1/1) ... [2019-11-15 22:38:39,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10d0cfa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:38:39, skipping insertion in model container [2019-11-15 22:38:39,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:38:39" (1/1) ... [2019-11-15 22:38:39,591 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:38:39,660 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:38:40,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:38:40,163 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:38:40,260 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:38:40,330 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:38:40,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:38:40 WrapperNode [2019-11-15 22:38:40,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:38:40,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:38:40,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:38:40,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:38:40,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:38:40" (1/1) ... [2019-11-15 22:38:40,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:38:40" (1/1) ... [2019-11-15 22:38:40,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:38:40" (1/1) ... [2019-11-15 22:38:40,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:38:40" (1/1) ... [2019-11-15 22:38:40,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:38:40" (1/1) ... [2019-11-15 22:38:40,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:38:40" (1/1) ... [2019-11-15 22:38:40,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:38:40" (1/1) ... [2019-11-15 22:38:40,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:38:40,428 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:38:40,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:38:40,429 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:38:40,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:38:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/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 22:38:40,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 22:38:40,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:38:40,497 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 22:38:40,497 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 22:38:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 22:38:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 22:38:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 22:38:40,499 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 22:38:40,499 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 22:38:40,499 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 22:38:40,499 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 22:38:40,500 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 22:38:40,500 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 22:38:40,500 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 22:38:40,500 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 22:38:40,501 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 22:38:40,501 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 22:38:40,501 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 22:38:40,501 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 22:38:40,502 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 22:38:40,502 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 22:38:40,502 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 22:38:40,502 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 22:38:40,503 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 22:38:40,503 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 22:38:40,503 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 22:38:40,503 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 22:38:40,504 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 22:38:40,504 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 22:38:40,504 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 22:38:40,504 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 22:38:40,505 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 22:38:40,505 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 22:38:40,505 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 22:38:40,506 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 22:38:40,506 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 22:38:40,506 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 22:38:40,506 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 22:38:40,506 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 22:38:40,507 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 22:38:40,507 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 22:38:40,507 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 22:38:40,507 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 22:38:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 22:38:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 22:38:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 22:38:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 22:38:40,508 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 22:38:40,509 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 22:38:40,509 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 22:38:40,509 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 22:38:40,509 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 22:38:40,509 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 22:38:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 22:38:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 22:38:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 22:38:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 22:38:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 22:38:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 22:38:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 22:38:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 22:38:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 22:38:40,512 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 22:38:40,512 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 22:38:40,512 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 22:38:40,512 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 22:38:40,513 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 22:38:40,513 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 22:38:40,513 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 22:38:40,513 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 22:38:40,513 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 22:38:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 22:38:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 22:38:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 22:38:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 22:38:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 22:38:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 22:38:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 22:38:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 22:38:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 22:38:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 22:38:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 22:38:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 22:38:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 22:38:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 22:38:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 22:38:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 22:38:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 22:38:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 22:38:40,518 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 22:38:40,518 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 22:38:40,518 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 22:38:40,518 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 22:38:40,518 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 22:38:40,519 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 22:38:40,519 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 22:38:40,519 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 22:38:40,519 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 22:38:40,520 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 22:38:40,520 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 22:38:40,520 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 22:38:40,520 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 22:38:40,521 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 22:38:40,521 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 22:38:40,521 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 22:38:40,521 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 22:38:40,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 22:38:40,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 22:38:40,522 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 22:38:40,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:38:40,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:38:40,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 22:38:40,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:38:40,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 22:38:40,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:38:40,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 22:38:40,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:38:41,748 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:38:41,748 INFO L284 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-15 22:38:41,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:38:41 BoogieIcfgContainer [2019-11-15 22:38:41,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:38:41,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:38:41,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:38:41,755 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:38:41,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:38:39" (1/3) ... [2019-11-15 22:38:41,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a45ee1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:38:41, skipping insertion in model container [2019-11-15 22:38:41,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:38:40" (2/3) ... [2019-11-15 22:38:41,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a45ee1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:38:41, skipping insertion in model container [2019-11-15 22:38:41,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:38:41" (3/3) ... [2019-11-15 22:38:41,762 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-sorted-1.i [2019-11-15 22:38:41,773 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:38:41,783 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 62 error locations. [2019-11-15 22:38:41,800 INFO L249 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2019-11-15 22:38:41,825 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:38:41,825 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 22:38:41,825 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:38:41,826 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:38:41,826 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:38:41,826 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:38:41,826 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:38:41,826 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:38:41,846 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2019-11-15 22:38:41,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 22:38:41,859 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:41,868 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:38:41,871 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-15 22:38:41,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:41,877 INFO L82 PathProgramCache]: Analyzing trace with hash 2144237790, now seen corresponding path program 1 times [2019-11-15 22:38:41,888 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:38:41,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [905516782] [2019-11-15 22:38:41,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0e2fe300-c878-4ea7-af39-1ad8a0f4e33d/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:38:42,124 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:38:42,125 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort C_DOUBLE not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 22:38:42,132 INFO L168 Benchmark]: Toolchain (without parser) took 2560.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 948.3 MB in the beginning and 1.0 GB in the end (delta: -99.0 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:38:42,133 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:38:42,134 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:38:42,135 INFO L168 Benchmark]: Boogie Preprocessor took 95.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:38:42,135 INFO L168 Benchmark]: RCFGBuilder took 1321.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 71.3 MB). Peak memory consumption was 71.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:38:42,136 INFO L168 Benchmark]: TraceAbstraction took 378.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:38:42,146 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 759.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 95.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1321.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 71.3 MB). Peak memory consumption was 71.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 378.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Sort C_DOUBLE not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...