./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-01-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 877ba8a79b8b7ad33de53a48617e3dd4b0411834 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_4243f1d6-628b-4857-a82c-1c9c2a8efdda/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-01-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 877ba8a79b8b7ad33de53a48617e3dd4b0411834 ................................................................................................................................................................................................................................................................................................................................................... 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-16 00:28:00,615 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:28:00,618 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:28:00,629 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:28:00,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:28:00,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:28:00,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:28:00,640 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:28:00,642 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:28:00,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:28:00,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:28:00,645 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:28:00,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:28:00,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:28:00,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:28:00,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:28:00,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:28:00,654 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:28:00,657 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:28:00,661 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:28:00,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:28:00,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:28:00,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:28:00,673 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:28:00,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:28:00,677 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:28:00,677 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:28:00,678 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:28:00,680 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:28:00,681 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:28:00,682 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:28:00,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:28:00,683 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:28:00,684 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:28:00,686 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:28:00,686 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:28:00,687 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:28:00,687 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:28:00,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:28:00,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:28:00,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:28:00,693 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-16 00:28:00,711 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:28:00,712 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:28:00,713 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:28:00,714 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:28:00,714 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:28:00,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:28:00,714 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:28:00,714 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:28:00,715 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:28:00,715 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:28:00,716 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:28:00,716 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:28:00,717 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:28:00,717 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:28:00,717 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:28:00,717 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:28:00,717 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:28:00,718 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:28:00,718 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:28:00,718 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:28:00,718 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:28:00,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:28:00,719 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:28:00,719 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:28:00,719 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:28:00,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:28:00,720 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_4243f1d6-628b-4857-a82c-1c9c2a8efdda/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 877ba8a79b8b7ad33de53a48617e3dd4b0411834 [2019-11-16 00:28:00,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:28:00,778 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:28:00,784 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:28:00,785 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:28:00,786 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:28:00,786 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/bin/uautomizer/../../sv-benchmarks/c/forester-heap/dll-01-2.i [2019-11-16 00:28:00,848 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/bin/uautomizer/data/e2668c76d/0ded39b031cd40c0a6060cccc00ee192/FLAGe027985ea [2019-11-16 00:28:01,280 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:28:01,281 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/sv-benchmarks/c/forester-heap/dll-01-2.i [2019-11-16 00:28:01,292 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/bin/uautomizer/data/e2668c76d/0ded39b031cd40c0a6060cccc00ee192/FLAGe027985ea [2019-11-16 00:28:01,673 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/bin/uautomizer/data/e2668c76d/0ded39b031cd40c0a6060cccc00ee192 [2019-11-16 00:28:01,676 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:28:01,677 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:28:01,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:28:01,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:28:01,681 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:28:01,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:28:01" (1/1) ... [2019-11-16 00:28:01,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@366fa569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:01, skipping insertion in model container [2019-11-16 00:28:01,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:28:01" (1/1) ... [2019-11-16 00:28:01,691 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:28:01,749 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:28:02,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:28:02,099 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:28:02,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:28:02,233 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:28:02,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:02 WrapperNode [2019-11-16 00:28:02,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:28:02,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:28:02,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:28:02,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:28:02,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:02" (1/1) ... [2019-11-16 00:28:02,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:02" (1/1) ... [2019-11-16 00:28:02,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:02" (1/1) ... [2019-11-16 00:28:02,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:02" (1/1) ... [2019-11-16 00:28:02,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:02" (1/1) ... [2019-11-16 00:28:02,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:02" (1/1) ... [2019-11-16 00:28:02,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:02" (1/1) ... [2019-11-16 00:28:02,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:28:02,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:28:02,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:28:02,314 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:28:02,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/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-16 00:28:02,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:28:02,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:28:02,385 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:28:02,385 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:28:02,386 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:28:02,386 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:28:02,386 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:28:02,386 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:28:02,387 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:28:02,387 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:28:02,387 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:28:02,387 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:28:02,387 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:28:02,388 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:28:02,388 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:28:02,388 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:28:02,388 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:28:02,388 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:28:02,389 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:28:02,389 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:28:02,389 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:28:02,389 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:28:02,389 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:28:02,390 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:28:02,390 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:28:02,390 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:28:02,390 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:28:02,390 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:28:02,390 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:28:02,391 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:28:02,391 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:28:02,391 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:28:02,391 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:28:02,391 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:28:02,392 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:28:02,392 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:28:02,392 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:28:02,392 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:28:02,392 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:28:02,393 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:28:02,393 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:28:02,393 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:28:02,393 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:28:02,393 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:28:02,394 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:28:02,394 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:28:02,394 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:28:02,394 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:28:02,394 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:28:02,395 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:28:02,395 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:28:02,395 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:28:02,395 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:28:02,395 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:28:02,395 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:28:02,396 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:28:02,396 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:28:02,396 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-16 00:28:02,396 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:28:02,396 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:28:02,396 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:28:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-16 00:28:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:28:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:28:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-16 00:28:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:28:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:28:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-16 00:28:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:28:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:28:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:28:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:28:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:28:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:28:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:28:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:28:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:28:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:28:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:28:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:28:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:28:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:28:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:28:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:28:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:28:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:28:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:28:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:28:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:28:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:28:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:28:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:28:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:28:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:28:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:28:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:28:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:28:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:28:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:28:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:28:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:28:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:28:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:28:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:28:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:28:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:28:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-16 00:28:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-16 00:28:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:28:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:28:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:28:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:28:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:28:02,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:28:02,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:28:03,386 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:28:03,386 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-16 00:28:03,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:28:03 BoogieIcfgContainer [2019-11-16 00:28:03,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:28:03,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:28:03,389 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:28:03,392 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:28:03,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:28:01" (1/3) ... [2019-11-16 00:28:03,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5342d7a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:28:03, skipping insertion in model container [2019-11-16 00:28:03,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:02" (2/3) ... [2019-11-16 00:28:03,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5342d7a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:28:03, skipping insertion in model container [2019-11-16 00:28:03,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:28:03" (3/3) ... [2019-11-16 00:28:03,396 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-01-2.i [2019-11-16 00:28:03,406 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:28:03,414 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 73 error locations. [2019-11-16 00:28:03,426 INFO L249 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2019-11-16 00:28:03,453 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:28:03,454 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:28:03,455 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:28:03,458 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:28:03,459 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:28:03,459 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:28:03,459 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:28:03,459 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:28:03,493 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states. [2019-11-16 00:28:03,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-16 00:28:03,508 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:03,509 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:03,511 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:03,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:03,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1733607176, now seen corresponding path program 1 times [2019-11-16 00:28:03,527 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:03,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927303338] [2019-11-16 00:28:03,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:03,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:03,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:03,738 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-16 00:28:03,739 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927303338] [2019-11-16 00:28:03,741 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:03,741 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:28:03,741 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109640160] [2019-11-16 00:28:03,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:28:03,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:03,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:28:03,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:28:03,766 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 4 states. [2019-11-16 00:28:04,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:04,440 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2019-11-16 00:28:04,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:28:04,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-16 00:28:04,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:04,455 INFO L225 Difference]: With dead ends: 176 [2019-11-16 00:28:04,455 INFO L226 Difference]: Without dead ends: 172 [2019-11-16 00:28:04,457 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-16 00:28:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-16 00:28:04,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 168. [2019-11-16 00:28:04,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-16 00:28:04,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 179 transitions. [2019-11-16 00:28:04,535 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 179 transitions. Word has length 7 [2019-11-16 00:28:04,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:04,536 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 179 transitions. [2019-11-16 00:28:04,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:28:04,536 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 179 transitions. [2019-11-16 00:28:04,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-16 00:28:04,537 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:04,537 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:04,538 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:04,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:04,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1733607177, now seen corresponding path program 1 times [2019-11-16 00:28:04,539 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:04,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497811503] [2019-11-16 00:28:04,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:04,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:04,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:04,629 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-16 00:28:04,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497811503] [2019-11-16 00:28:04,630 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:04,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:28:04,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154957600] [2019-11-16 00:28:04,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:28:04,632 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:04,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:28:04,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:28:04,633 INFO L87 Difference]: Start difference. First operand 168 states and 179 transitions. Second operand 4 states. [2019-11-16 00:28:05,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:05,089 INFO L93 Difference]: Finished difference Result 191 states and 201 transitions. [2019-11-16 00:28:05,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:28:05,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-16 00:28:05,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:05,092 INFO L225 Difference]: With dead ends: 191 [2019-11-16 00:28:05,092 INFO L226 Difference]: Without dead ends: 191 [2019-11-16 00:28:05,093 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-16 00:28:05,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-16 00:28:05,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 177. [2019-11-16 00:28:05,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-11-16 00:28:05,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 196 transitions. [2019-11-16 00:28:05,108 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 196 transitions. Word has length 7 [2019-11-16 00:28:05,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:05,109 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 196 transitions. [2019-11-16 00:28:05,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:28:05,109 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 196 transitions. [2019-11-16 00:28:05,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-16 00:28:05,110 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:05,110 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:05,111 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:05,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:05,111 INFO L82 PathProgramCache]: Analyzing trace with hash -784316965, now seen corresponding path program 1 times [2019-11-16 00:28:05,111 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:05,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019781787] [2019-11-16 00:28:05,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:05,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:05,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:05,263 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-16 00:28:05,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019781787] [2019-11-16 00:28:05,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:05,264 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:28:05,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227664125] [2019-11-16 00:28:05,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:28:05,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:05,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:28:05,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:28:05,265 INFO L87 Difference]: Start difference. First operand 177 states and 196 transitions. Second operand 6 states. [2019-11-16 00:28:06,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:06,180 INFO L93 Difference]: Finished difference Result 303 states and 330 transitions. [2019-11-16 00:28:06,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:28:06,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-16 00:28:06,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:06,184 INFO L225 Difference]: With dead ends: 303 [2019-11-16 00:28:06,184 INFO L226 Difference]: Without dead ends: 303 [2019-11-16 00:28:06,184 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:28:06,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-11-16 00:28:06,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 176. [2019-11-16 00:28:06,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-11-16 00:28:06,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 195 transitions. [2019-11-16 00:28:06,213 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 195 transitions. Word has length 15 [2019-11-16 00:28:06,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:06,214 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 195 transitions. [2019-11-16 00:28:06,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:28:06,214 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 195 transitions. [2019-11-16 00:28:06,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-16 00:28:06,221 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:06,221 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:06,221 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:06,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:06,223 INFO L82 PathProgramCache]: Analyzing trace with hash -784316964, now seen corresponding path program 1 times [2019-11-16 00:28:06,223 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:06,223 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010443926] [2019-11-16 00:28:06,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:06,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:06,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:06,360 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-16 00:28:06,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010443926] [2019-11-16 00:28:06,361 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:06,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:28:06,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654775889] [2019-11-16 00:28:06,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:28:06,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:06,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:28:06,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:28:06,367 INFO L87 Difference]: Start difference. First operand 176 states and 195 transitions. Second operand 6 states. [2019-11-16 00:28:07,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:07,215 INFO L93 Difference]: Finished difference Result 328 states and 365 transitions. [2019-11-16 00:28:07,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:28:07,216 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-16 00:28:07,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:07,218 INFO L225 Difference]: With dead ends: 328 [2019-11-16 00:28:07,219 INFO L226 Difference]: Without dead ends: 328 [2019-11-16 00:28:07,219 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:28:07,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-11-16 00:28:07,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 175. [2019-11-16 00:28:07,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-11-16 00:28:07,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 194 transitions. [2019-11-16 00:28:07,242 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 194 transitions. Word has length 15 [2019-11-16 00:28:07,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:07,243 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 194 transitions. [2019-11-16 00:28:07,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:28:07,243 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 194 transitions. [2019-11-16 00:28:07,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-16 00:28:07,244 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:07,244 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:07,244 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:07,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:07,245 INFO L82 PathProgramCache]: Analyzing trace with hash -964601131, now seen corresponding path program 1 times [2019-11-16 00:28:07,245 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:07,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961986134] [2019-11-16 00:28:07,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:07,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:07,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:07,485 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-16 00:28:07,485 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961986134] [2019-11-16 00:28:07,485 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:07,486 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:28:07,486 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73359383] [2019-11-16 00:28:07,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:28:07,487 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:07,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:28:07,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:28:07,487 INFO L87 Difference]: Start difference. First operand 175 states and 194 transitions. Second operand 9 states. [2019-11-16 00:28:08,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:08,676 INFO L93 Difference]: Finished difference Result 304 states and 330 transitions. [2019-11-16 00:28:08,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:28:08,677 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-16 00:28:08,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:08,679 INFO L225 Difference]: With dead ends: 304 [2019-11-16 00:28:08,679 INFO L226 Difference]: Without dead ends: 304 [2019-11-16 00:28:08,680 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:28:08,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-11-16 00:28:08,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 174. [2019-11-16 00:28:08,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-16 00:28:08,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 193 transitions. [2019-11-16 00:28:08,700 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 193 transitions. Word has length 18 [2019-11-16 00:28:08,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:08,701 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 193 transitions. [2019-11-16 00:28:08,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:28:08,701 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 193 transitions. [2019-11-16 00:28:08,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-16 00:28:08,702 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:08,703 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:08,704 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:08,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:08,705 INFO L82 PathProgramCache]: Analyzing trace with hash -964601130, now seen corresponding path program 1 times [2019-11-16 00:28:08,705 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:08,705 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944409629] [2019-11-16 00:28:08,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:08,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:08,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:08,916 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-16 00:28:08,916 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944409629] [2019-11-16 00:28:08,917 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:08,917 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:28:08,917 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913137278] [2019-11-16 00:28:08,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:28:08,918 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:08,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:28:08,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:28:08,918 INFO L87 Difference]: Start difference. First operand 174 states and 193 transitions. Second operand 9 states. [2019-11-16 00:28:10,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:10,109 INFO L93 Difference]: Finished difference Result 305 states and 331 transitions. [2019-11-16 00:28:10,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:28:10,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-16 00:28:10,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:10,112 INFO L225 Difference]: With dead ends: 305 [2019-11-16 00:28:10,112 INFO L226 Difference]: Without dead ends: 305 [2019-11-16 00:28:10,112 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:28:10,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-16 00:28:10,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 173. [2019-11-16 00:28:10,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-11-16 00:28:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 192 transitions. [2019-11-16 00:28:10,128 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 192 transitions. Word has length 18 [2019-11-16 00:28:10,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:10,128 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 192 transitions. [2019-11-16 00:28:10,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:28:10,129 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 192 transitions. [2019-11-16 00:28:10,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-16 00:28:10,130 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:10,130 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:10,132 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:10,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:10,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1666769389, now seen corresponding path program 1 times [2019-11-16 00:28:10,133 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:10,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897427124] [2019-11-16 00:28:10,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:10,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:10,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:10,251 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-16 00:28:10,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897427124] [2019-11-16 00:28:10,252 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:10,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:28:10,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592071656] [2019-11-16 00:28:10,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:28:10,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:10,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:28:10,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:28:10,254 INFO L87 Difference]: Start difference. First operand 173 states and 192 transitions. Second operand 6 states. [2019-11-16 00:28:10,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:10,677 INFO L93 Difference]: Finished difference Result 256 states and 280 transitions. [2019-11-16 00:28:10,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:28:10,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-16 00:28:10,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:10,680 INFO L225 Difference]: With dead ends: 256 [2019-11-16 00:28:10,680 INFO L226 Difference]: Without dead ends: 256 [2019-11-16 00:28:10,680 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:28:10,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-16 00:28:10,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 176. [2019-11-16 00:28:10,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-11-16 00:28:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 195 transitions. [2019-11-16 00:28:10,702 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 195 transitions. Word has length 22 [2019-11-16 00:28:10,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:10,702 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 195 transitions. [2019-11-16 00:28:10,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:28:10,703 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 195 transitions. [2019-11-16 00:28:10,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-16 00:28:10,704 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:10,704 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:10,704 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:10,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:10,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1364914450, now seen corresponding path program 1 times [2019-11-16 00:28:10,705 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:10,705 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102321839] [2019-11-16 00:28:10,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:10,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:10,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:10,756 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-16 00:28:10,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102321839] [2019-11-16 00:28:10,757 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:10,757 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:28:10,757 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508741814] [2019-11-16 00:28:10,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:28:10,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:10,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:28:10,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:28:10,758 INFO L87 Difference]: Start difference. First operand 176 states and 195 transitions. Second operand 5 states. [2019-11-16 00:28:11,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:11,046 INFO L93 Difference]: Finished difference Result 176 states and 193 transitions. [2019-11-16 00:28:11,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:28:11,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-16 00:28:11,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:11,047 INFO L225 Difference]: With dead ends: 176 [2019-11-16 00:28:11,048 INFO L226 Difference]: Without dead ends: 176 [2019-11-16 00:28:11,048 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-16 00:28:11,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-16 00:28:11,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 166. [2019-11-16 00:28:11,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-16 00:28:11,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 185 transitions. [2019-11-16 00:28:11,053 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 185 transitions. Word has length 24 [2019-11-16 00:28:11,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:11,054 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 185 transitions. [2019-11-16 00:28:11,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:28:11,054 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 185 transitions. [2019-11-16 00:28:11,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-16 00:28:11,055 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:11,055 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:11,055 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:11,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:11,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1364914451, now seen corresponding path program 1 times [2019-11-16 00:28:11,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:11,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827431013] [2019-11-16 00:28:11,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:11,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:11,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:11,178 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-16 00:28:11,178 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827431013] [2019-11-16 00:28:11,178 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:11,179 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:28:11,179 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44979379] [2019-11-16 00:28:11,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:28:11,179 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:11,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:28:11,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:28:11,180 INFO L87 Difference]: Start difference. First operand 166 states and 185 transitions. Second operand 8 states. [2019-11-16 00:28:11,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:11,564 INFO L93 Difference]: Finished difference Result 218 states and 232 transitions. [2019-11-16 00:28:11,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:28:11,564 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-11-16 00:28:11,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:11,566 INFO L225 Difference]: With dead ends: 218 [2019-11-16 00:28:11,566 INFO L226 Difference]: Without dead ends: 218 [2019-11-16 00:28:11,566 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:28:11,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-11-16 00:28:11,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 189. [2019-11-16 00:28:11,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-11-16 00:28:11,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 218 transitions. [2019-11-16 00:28:11,572 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 218 transitions. Word has length 24 [2019-11-16 00:28:11,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:11,573 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 218 transitions. [2019-11-16 00:28:11,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:28:11,573 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 218 transitions. [2019-11-16 00:28:11,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-16 00:28:11,574 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:11,574 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:11,574 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:11,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:11,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1717763253, now seen corresponding path program 1 times [2019-11-16 00:28:11,575 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:11,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553024625] [2019-11-16 00:28:11,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:11,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:11,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:11,640 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-16 00:28:11,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553024625] [2019-11-16 00:28:11,640 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:11,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:28:11,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361279803] [2019-11-16 00:28:11,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:28:11,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:11,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:28:11,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:28:11,642 INFO L87 Difference]: Start difference. First operand 189 states and 218 transitions. Second operand 6 states. [2019-11-16 00:28:12,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:12,039 INFO L93 Difference]: Finished difference Result 266 states and 307 transitions. [2019-11-16 00:28:12,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:28:12,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-16 00:28:12,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:12,041 INFO L225 Difference]: With dead ends: 266 [2019-11-16 00:28:12,041 INFO L226 Difference]: Without dead ends: 266 [2019-11-16 00:28:12,041 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:28:12,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-16 00:28:12,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 188. [2019-11-16 00:28:12,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-16 00:28:12,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 216 transitions. [2019-11-16 00:28:12,047 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 216 transitions. Word has length 26 [2019-11-16 00:28:12,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:12,048 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 216 transitions. [2019-11-16 00:28:12,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:28:12,048 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 216 transitions. [2019-11-16 00:28:12,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-16 00:28:12,048 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:12,049 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:12,049 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:12,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:12,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1717763254, now seen corresponding path program 1 times [2019-11-16 00:28:12,049 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:12,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912182431] [2019-11-16 00:28:12,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:12,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:12,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:12,118 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-16 00:28:12,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912182431] [2019-11-16 00:28:12,119 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:12,119 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:28:12,119 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8696226] [2019-11-16 00:28:12,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:28:12,119 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:12,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:28:12,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:28:12,120 INFO L87 Difference]: Start difference. First operand 188 states and 216 transitions. Second operand 6 states. [2019-11-16 00:28:12,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:12,633 INFO L93 Difference]: Finished difference Result 291 states and 339 transitions. [2019-11-16 00:28:12,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:28:12,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-16 00:28:12,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:12,640 INFO L225 Difference]: With dead ends: 291 [2019-11-16 00:28:12,640 INFO L226 Difference]: Without dead ends: 291 [2019-11-16 00:28:12,641 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:28:12,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-16 00:28:12,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 187. [2019-11-16 00:28:12,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-16 00:28:12,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 214 transitions. [2019-11-16 00:28:12,647 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 214 transitions. Word has length 26 [2019-11-16 00:28:12,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:12,647 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 214 transitions. [2019-11-16 00:28:12,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:28:12,647 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 214 transitions. [2019-11-16 00:28:12,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-16 00:28:12,648 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:12,649 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:12,649 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:12,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:12,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1621527503, now seen corresponding path program 1 times [2019-11-16 00:28:12,649 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:12,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613803173] [2019-11-16 00:28:12,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:12,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:12,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:12,716 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-16 00:28:12,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613803173] [2019-11-16 00:28:12,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:12,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:28:12,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923210532] [2019-11-16 00:28:12,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:28:12,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:12,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:28:12,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:28:12,718 INFO L87 Difference]: Start difference. First operand 187 states and 214 transitions. Second operand 6 states. [2019-11-16 00:28:12,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:12,986 INFO L93 Difference]: Finished difference Result 205 states and 218 transitions. [2019-11-16 00:28:12,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:28:12,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-16 00:28:12,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:12,988 INFO L225 Difference]: With dead ends: 205 [2019-11-16 00:28:12,988 INFO L226 Difference]: Without dead ends: 205 [2019-11-16 00:28:12,988 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:28:12,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-11-16 00:28:12,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 187. [2019-11-16 00:28:12,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-16 00:28:12,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 213 transitions. [2019-11-16 00:28:12,994 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 213 transitions. Word has length 30 [2019-11-16 00:28:12,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:12,995 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 213 transitions. [2019-11-16 00:28:12,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:28:12,995 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 213 transitions. [2019-11-16 00:28:12,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-16 00:28:12,996 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:12,996 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:12,997 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:12,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:12,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1318910007, now seen corresponding path program 1 times [2019-11-16 00:28:12,997 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:12,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190272837] [2019-11-16 00:28:12,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:12,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:12,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:13,114 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-16 00:28:13,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190272837] [2019-11-16 00:28:13,114 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:13,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:28:13,114 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904036652] [2019-11-16 00:28:13,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:28:13,115 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:13,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:28:13,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:28:13,116 INFO L87 Difference]: Start difference. First operand 187 states and 213 transitions. Second operand 10 states. [2019-11-16 00:28:13,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:13,957 INFO L93 Difference]: Finished difference Result 189 states and 214 transitions. [2019-11-16 00:28:13,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:28:13,957 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2019-11-16 00:28:13,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:13,958 INFO L225 Difference]: With dead ends: 189 [2019-11-16 00:28:13,958 INFO L226 Difference]: Without dead ends: 189 [2019-11-16 00:28:13,959 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:28:13,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-16 00:28:13,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2019-11-16 00:28:13,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-16 00:28:13,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 212 transitions. [2019-11-16 00:28:13,964 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 212 transitions. Word has length 30 [2019-11-16 00:28:13,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:13,964 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 212 transitions. [2019-11-16 00:28:13,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:28:13,964 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 212 transitions. [2019-11-16 00:28:13,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-16 00:28:13,965 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:13,965 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:13,965 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:13,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:13,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1318910008, now seen corresponding path program 1 times [2019-11-16 00:28:13,966 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:13,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269231348] [2019-11-16 00:28:13,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:13,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:13,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:14,110 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-16 00:28:14,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269231348] [2019-11-16 00:28:14,110 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:14,110 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:28:14,111 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043836049] [2019-11-16 00:28:14,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:28:14,111 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:14,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:28:14,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:28:14,112 INFO L87 Difference]: Start difference. First operand 186 states and 212 transitions. Second operand 11 states. [2019-11-16 00:28:14,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:14,893 INFO L93 Difference]: Finished difference Result 181 states and 206 transitions. [2019-11-16 00:28:14,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:28:14,893 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2019-11-16 00:28:14,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:14,894 INFO L225 Difference]: With dead ends: 181 [2019-11-16 00:28:14,894 INFO L226 Difference]: Without dead ends: 181 [2019-11-16 00:28:14,895 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:28:14,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-16 00:28:14,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 169. [2019-11-16 00:28:14,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-16 00:28:14,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 194 transitions. [2019-11-16 00:28:14,901 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 194 transitions. Word has length 30 [2019-11-16 00:28:14,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:14,901 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 194 transitions. [2019-11-16 00:28:14,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:28:14,901 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 194 transitions. [2019-11-16 00:28:14,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-16 00:28:14,902 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:14,902 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:14,903 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:14,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:14,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1471411324, now seen corresponding path program 1 times [2019-11-16 00:28:14,903 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:14,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022897045] [2019-11-16 00:28:14,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:14,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:14,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:14,948 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-16 00:28:14,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022897045] [2019-11-16 00:28:14,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:14,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:28:14,949 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974694400] [2019-11-16 00:28:14,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:28:14,949 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:14,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:28:14,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:28:14,950 INFO L87 Difference]: Start difference. First operand 169 states and 194 transitions. Second operand 4 states. [2019-11-16 00:28:15,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:15,138 INFO L93 Difference]: Finished difference Result 237 states and 274 transitions. [2019-11-16 00:28:15,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:28:15,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-11-16 00:28:15,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:15,140 INFO L225 Difference]: With dead ends: 237 [2019-11-16 00:28:15,140 INFO L226 Difference]: Without dead ends: 237 [2019-11-16 00:28:15,141 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-16 00:28:15,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-16 00:28:15,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 173. [2019-11-16 00:28:15,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-11-16 00:28:15,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 200 transitions. [2019-11-16 00:28:15,147 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 200 transitions. Word has length 34 [2019-11-16 00:28:15,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:15,147 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 200 transitions. [2019-11-16 00:28:15,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:28:15,147 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 200 transitions. [2019-11-16 00:28:15,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-16 00:28:15,148 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:15,148 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:15,149 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:15,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:15,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1471351742, now seen corresponding path program 1 times [2019-11-16 00:28:15,149 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:15,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061566043] [2019-11-16 00:28:15,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:15,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:15,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:15,296 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-16 00:28:15,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061566043] [2019-11-16 00:28:15,297 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:15,297 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:28:15,297 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576293596] [2019-11-16 00:28:15,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:28:15,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:15,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:28:15,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:28:15,298 INFO L87 Difference]: Start difference. First operand 173 states and 200 transitions. Second operand 9 states. [2019-11-16 00:28:15,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:15,985 INFO L93 Difference]: Finished difference Result 269 states and 304 transitions. [2019-11-16 00:28:15,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:28:15,986 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-11-16 00:28:15,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:15,988 INFO L225 Difference]: With dead ends: 269 [2019-11-16 00:28:15,988 INFO L226 Difference]: Without dead ends: 269 [2019-11-16 00:28:15,988 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:28:15,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-11-16 00:28:15,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 185. [2019-11-16 00:28:15,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-16 00:28:15,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 213 transitions. [2019-11-16 00:28:15,997 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 213 transitions. Word has length 34 [2019-11-16 00:28:15,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:15,997 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 213 transitions. [2019-11-16 00:28:15,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:28:15,998 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 213 transitions. [2019-11-16 00:28:15,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-16 00:28:16,000 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:16,000 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] [2019-11-16 00:28:16,001 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:16,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:16,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1155756595, now seen corresponding path program 1 times [2019-11-16 00:28:16,001 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:16,002 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076722425] [2019-11-16 00:28:16,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:16,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:16,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:16,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:28:16,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076722425] [2019-11-16 00:28:16,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612621004] [2019-11-16 00:28:16,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/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-16 00:28:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:16,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-16 00:28:16,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:16,377 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-16 00:28:16,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:16,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:16,403 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-16 00:28:16,403 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:16,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:16,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:28:16,410 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2019-11-16 00:28:16,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:16,444 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 21 treesize of output 20 [2019-11-16 00:28:16,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:16,481 INFO L567 ElimStorePlain]: treesize reduction 5, result has 89.6 percent of original size [2019-11-16 00:28:16,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:16,488 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 21 treesize of output 20 [2019-11-16 00:28:16,488 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:16,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:16,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:28:16,502 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:39 [2019-11-16 00:28:16,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:16,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:16,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:16,551 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 30 treesize of output 32 [2019-11-16 00:28:16,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:16,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:16,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:16,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:16,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:16,604 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 30 treesize of output 32 [2019-11-16 00:28:16,605 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:16,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:16,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:28:16,631 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:57 [2019-11-16 00:28:16,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:16,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:16,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:16,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-11-16 00:28:16,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:16,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:16,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:16,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:16,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:16,756 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:16,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 13 [2019-11-16 00:28:16,757 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:16,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:16,766 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-16 00:28:16,766 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:7 [2019-11-16 00:28:16,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:28:16,776 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:28:16,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2019-11-16 00:28:16,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329230358] [2019-11-16 00:28:16,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:28:16,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:16,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:28:16,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:28:16,779 INFO L87 Difference]: Start difference. First operand 185 states and 213 transitions. Second operand 12 states. [2019-11-16 00:28:17,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:17,559 INFO L93 Difference]: Finished difference Result 317 states and 345 transitions. [2019-11-16 00:28:17,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-16 00:28:17,559 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2019-11-16 00:28:17,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:17,561 INFO L225 Difference]: With dead ends: 317 [2019-11-16 00:28:17,561 INFO L226 Difference]: Without dead ends: 317 [2019-11-16 00:28:17,562 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:28:17,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-11-16 00:28:17,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 212. [2019-11-16 00:28:17,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-16 00:28:17,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 250 transitions. [2019-11-16 00:28:17,569 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 250 transitions. Word has length 36 [2019-11-16 00:28:17,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:17,569 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 250 transitions. [2019-11-16 00:28:17,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:28:17,570 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 250 transitions. [2019-11-16 00:28:17,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-16 00:28:17,570 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:17,570 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:17,773 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:28:17,774 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:17,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:17,774 INFO L82 PathProgramCache]: Analyzing trace with hash 803599858, now seen corresponding path program 1 times [2019-11-16 00:28:17,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:17,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976046496] [2019-11-16 00:28:17,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:17,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:17,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:18,129 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-16 00:28:18,129 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976046496] [2019-11-16 00:28:18,129 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:18,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-16 00:28:18,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696258485] [2019-11-16 00:28:18,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-16 00:28:18,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:18,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-16 00:28:18,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:28:18,131 INFO L87 Difference]: Start difference. First operand 212 states and 250 transitions. Second operand 17 states. [2019-11-16 00:28:21,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:21,347 INFO L93 Difference]: Finished difference Result 484 states and 529 transitions. [2019-11-16 00:28:21,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-16 00:28:21,347 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2019-11-16 00:28:21,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:21,355 INFO L225 Difference]: With dead ends: 484 [2019-11-16 00:28:21,356 INFO L226 Difference]: Without dead ends: 484 [2019-11-16 00:28:21,357 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=410, Invalid=1846, Unknown=0, NotChecked=0, Total=2256 [2019-11-16 00:28:21,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-11-16 00:28:21,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 213. [2019-11-16 00:28:21,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-16 00:28:21,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 248 transitions. [2019-11-16 00:28:21,368 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 248 transitions. Word has length 38 [2019-11-16 00:28:21,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:21,368 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 248 transitions. [2019-11-16 00:28:21,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-16 00:28:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 248 transitions. [2019-11-16 00:28:21,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-16 00:28:21,369 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:21,370 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:21,370 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:21,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:21,371 INFO L82 PathProgramCache]: Analyzing trace with hash 803599859, now seen corresponding path program 1 times [2019-11-16 00:28:21,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:21,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161106579] [2019-11-16 00:28:21,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:21,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:21,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:21,725 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-16 00:28:21,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161106579] [2019-11-16 00:28:21,726 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:21,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-16 00:28:21,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841760307] [2019-11-16 00:28:21,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-16 00:28:21,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:21,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-16 00:28:21,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:28:21,727 INFO L87 Difference]: Start difference. First operand 213 states and 248 transitions. Second operand 17 states. [2019-11-16 00:28:24,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:24,292 INFO L93 Difference]: Finished difference Result 469 states and 514 transitions. [2019-11-16 00:28:24,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-16 00:28:24,292 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2019-11-16 00:28:24,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:24,294 INFO L225 Difference]: With dead ends: 469 [2019-11-16 00:28:24,294 INFO L226 Difference]: Without dead ends: 469 [2019-11-16 00:28:24,295 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=337, Invalid=1555, Unknown=0, NotChecked=0, Total=1892 [2019-11-16 00:28:24,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-11-16 00:28:24,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 219. [2019-11-16 00:28:24,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-16 00:28:24,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 253 transitions. [2019-11-16 00:28:24,302 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 253 transitions. Word has length 38 [2019-11-16 00:28:24,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:24,302 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 253 transitions. [2019-11-16 00:28:24,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-16 00:28:24,302 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 253 transitions. [2019-11-16 00:28:24,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-16 00:28:24,303 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:24,303 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:24,303 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:24,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:24,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1714389186, now seen corresponding path program 1 times [2019-11-16 00:28:24,304 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:24,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808701121] [2019-11-16 00:28:24,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:24,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:24,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:24,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:28:24,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808701121] [2019-11-16 00:28:24,363 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:24,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:28:24,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070129213] [2019-11-16 00:28:24,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:28:24,364 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:24,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:28:24,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:28:24,364 INFO L87 Difference]: Start difference. First operand 219 states and 253 transitions. Second operand 5 states. [2019-11-16 00:28:24,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:24,575 INFO L93 Difference]: Finished difference Result 228 states and 255 transitions. [2019-11-16 00:28:24,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:28:24,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-11-16 00:28:24,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:24,578 INFO L225 Difference]: With dead ends: 228 [2019-11-16 00:28:24,578 INFO L226 Difference]: Without dead ends: 228 [2019-11-16 00:28:24,578 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-16 00:28:24,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-11-16 00:28:24,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 219. [2019-11-16 00:28:24,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-16 00:28:24,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 252 transitions. [2019-11-16 00:28:24,584 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 252 transitions. Word has length 38 [2019-11-16 00:28:24,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:24,584 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 252 transitions. [2019-11-16 00:28:24,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:28:24,584 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 252 transitions. [2019-11-16 00:28:24,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-16 00:28:24,585 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:24,585 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:24,585 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:24,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:24,586 INFO L82 PathProgramCache]: Analyzing trace with hash -290444429, now seen corresponding path program 1 times [2019-11-16 00:28:24,586 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:24,586 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305373952] [2019-11-16 00:28:24,586 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:24,586 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:24,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:24,657 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-16 00:28:24,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305373952] [2019-11-16 00:28:24,657 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:24,657 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:28:24,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683155736] [2019-11-16 00:28:24,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:28:24,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:24,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:28:24,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:28:24,659 INFO L87 Difference]: Start difference. First operand 219 states and 252 transitions. Second operand 6 states. [2019-11-16 00:28:25,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:25,321 INFO L93 Difference]: Finished difference Result 318 states and 366 transitions. [2019-11-16 00:28:25,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:28:25,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-11-16 00:28:25,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:25,324 INFO L225 Difference]: With dead ends: 318 [2019-11-16 00:28:25,324 INFO L226 Difference]: Without dead ends: 318 [2019-11-16 00:28:25,325 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:28:25,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-16 00:28:25,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 218. [2019-11-16 00:28:25,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-11-16 00:28:25,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 251 transitions. [2019-11-16 00:28:25,331 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 251 transitions. Word has length 39 [2019-11-16 00:28:25,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:25,332 INFO L462 AbstractCegarLoop]: Abstraction has 218 states and 251 transitions. [2019-11-16 00:28:25,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:28:25,332 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 251 transitions. [2019-11-16 00:28:25,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-16 00:28:25,333 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:25,333 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:25,333 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:25,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:25,333 INFO L82 PathProgramCache]: Analyzing trace with hash -290444428, now seen corresponding path program 1 times [2019-11-16 00:28:25,334 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:25,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876178634] [2019-11-16 00:28:25,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:25,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:25,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:25,430 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-16 00:28:25,430 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876178634] [2019-11-16 00:28:25,430 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:25,430 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:28:25,431 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891721886] [2019-11-16 00:28:25,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:28:25,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:25,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:28:25,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:28:25,435 INFO L87 Difference]: Start difference. First operand 218 states and 251 transitions. Second operand 6 states. [2019-11-16 00:28:25,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:25,963 INFO L93 Difference]: Finished difference Result 346 states and 401 transitions. [2019-11-16 00:28:25,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:28:25,965 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-11-16 00:28:25,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:25,966 INFO L225 Difference]: With dead ends: 346 [2019-11-16 00:28:25,967 INFO L226 Difference]: Without dead ends: 346 [2019-11-16 00:28:25,967 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:28:25,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-11-16 00:28:25,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 217. [2019-11-16 00:28:25,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-16 00:28:25,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 250 transitions. [2019-11-16 00:28:25,973 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 250 transitions. Word has length 39 [2019-11-16 00:28:25,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:25,973 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 250 transitions. [2019-11-16 00:28:25,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:28:25,973 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 250 transitions. [2019-11-16 00:28:25,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-16 00:28:25,974 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:25,974 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:25,974 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:25,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:25,975 INFO L82 PathProgramCache]: Analyzing trace with hash 157605777, now seen corresponding path program 1 times [2019-11-16 00:28:25,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:25,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025459651] [2019-11-16 00:28:25,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:25,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:25,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:26,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:28:26,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025459651] [2019-11-16 00:28:26,111 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:26,111 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:28:26,111 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117248928] [2019-11-16 00:28:26,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:28:26,112 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:26,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:28:26,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:28:26,112 INFO L87 Difference]: Start difference. First operand 217 states and 250 transitions. Second operand 8 states. [2019-11-16 00:28:26,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:26,447 INFO L93 Difference]: Finished difference Result 240 states and 273 transitions. [2019-11-16 00:28:26,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:28:26,448 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-11-16 00:28:26,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:26,449 INFO L225 Difference]: With dead ends: 240 [2019-11-16 00:28:26,449 INFO L226 Difference]: Without dead ends: 240 [2019-11-16 00:28:26,450 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:28:26,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-11-16 00:28:26,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 226. [2019-11-16 00:28:26,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-16 00:28:26,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 259 transitions. [2019-11-16 00:28:26,456 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 259 transitions. Word has length 42 [2019-11-16 00:28:26,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:26,456 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 259 transitions. [2019-11-16 00:28:26,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:28:26,456 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 259 transitions. [2019-11-16 00:28:26,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-16 00:28:26,457 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:26,457 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:26,457 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:26,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:26,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1729244240, now seen corresponding path program 1 times [2019-11-16 00:28:26,458 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:26,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486178895] [2019-11-16 00:28:26,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:26,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:26,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:26,715 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-16 00:28:26,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486178895] [2019-11-16 00:28:26,715 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:26,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-16 00:28:26,716 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097424082] [2019-11-16 00:28:26,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-16 00:28:26,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:26,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:28:26,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:28:26,718 INFO L87 Difference]: Start difference. First operand 226 states and 259 transitions. Second operand 15 states. [2019-11-16 00:28:27,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:27,682 INFO L93 Difference]: Finished difference Result 241 states and 276 transitions. [2019-11-16 00:28:27,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-16 00:28:27,683 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2019-11-16 00:28:27,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:27,684 INFO L225 Difference]: With dead ends: 241 [2019-11-16 00:28:27,684 INFO L226 Difference]: Without dead ends: 241 [2019-11-16 00:28:27,684 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=639, Unknown=0, NotChecked=0, Total=812 [2019-11-16 00:28:27,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-16 00:28:27,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2019-11-16 00:28:27,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-11-16 00:28:27,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 258 transitions. [2019-11-16 00:28:27,689 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 258 transitions. Word has length 42 [2019-11-16 00:28:27,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:27,690 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 258 transitions. [2019-11-16 00:28:27,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-16 00:28:27,690 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 258 transitions. [2019-11-16 00:28:27,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-16 00:28:27,690 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:27,690 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:27,691 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:27,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:27,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1729244241, now seen corresponding path program 1 times [2019-11-16 00:28:27,691 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:27,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619950439] [2019-11-16 00:28:27,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:27,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:27,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:27,919 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-16 00:28:27,919 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619950439] [2019-11-16 00:28:27,920 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:27,920 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-16 00:28:27,920 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577409156] [2019-11-16 00:28:27,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-16 00:28:27,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:27,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:28:27,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:28:27,921 INFO L87 Difference]: Start difference. First operand 225 states and 258 transitions. Second operand 15 states. [2019-11-16 00:28:29,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:29,091 INFO L93 Difference]: Finished difference Result 240 states and 275 transitions. [2019-11-16 00:28:29,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-16 00:28:29,094 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2019-11-16 00:28:29,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:29,096 INFO L225 Difference]: With dead ends: 240 [2019-11-16 00:28:29,096 INFO L226 Difference]: Without dead ends: 240 [2019-11-16 00:28:29,097 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2019-11-16 00:28:29,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-11-16 00:28:29,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 224. [2019-11-16 00:28:29,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-16 00:28:29,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 257 transitions. [2019-11-16 00:28:29,107 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 257 transitions. Word has length 42 [2019-11-16 00:28:29,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:29,108 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 257 transitions. [2019-11-16 00:28:29,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-16 00:28:29,108 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 257 transitions. [2019-11-16 00:28:29,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-16 00:28:29,109 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:29,109 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:29,109 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:29,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:29,110 INFO L82 PathProgramCache]: Analyzing trace with hash 650747475, now seen corresponding path program 1 times [2019-11-16 00:28:29,110 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:29,113 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063413990] [2019-11-16 00:28:29,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:29,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:29,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:29,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:28:29,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063413990] [2019-11-16 00:28:29,170 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:29,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:28:29,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321557086] [2019-11-16 00:28:29,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:28:29,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:29,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:28:29,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:28:29,173 INFO L87 Difference]: Start difference. First operand 224 states and 257 transitions. Second operand 4 states. [2019-11-16 00:28:29,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:29,395 INFO L93 Difference]: Finished difference Result 231 states and 258 transitions. [2019-11-16 00:28:29,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:28:29,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-11-16 00:28:29,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:29,397 INFO L225 Difference]: With dead ends: 231 [2019-11-16 00:28:29,397 INFO L226 Difference]: Without dead ends: 231 [2019-11-16 00:28:29,397 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-16 00:28:29,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-11-16 00:28:29,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 225. [2019-11-16 00:28:29,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-11-16 00:28:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 258 transitions. [2019-11-16 00:28:29,402 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 258 transitions. Word has length 43 [2019-11-16 00:28:29,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:29,402 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 258 transitions. [2019-11-16 00:28:29,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:28:29,402 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 258 transitions. [2019-11-16 00:28:29,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-16 00:28:29,403 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:29,403 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:28:29,404 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:29,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:29,404 INFO L82 PathProgramCache]: Analyzing trace with hash 989091269, now seen corresponding path program 1 times [2019-11-16 00:28:29,405 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:29,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971302870] [2019-11-16 00:28:29,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:29,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:29,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:29,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:28:29,530 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971302870] [2019-11-16 00:28:29,530 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:29,530 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:28:29,530 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829438198] [2019-11-16 00:28:29,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:28:29,531 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:29,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:28:29,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:28:29,531 INFO L87 Difference]: Start difference. First operand 225 states and 258 transitions. Second operand 10 states. [2019-11-16 00:28:30,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:30,189 INFO L93 Difference]: Finished difference Result 267 states and 297 transitions. [2019-11-16 00:28:30,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:28:30,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2019-11-16 00:28:30,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:30,191 INFO L225 Difference]: With dead ends: 267 [2019-11-16 00:28:30,191 INFO L226 Difference]: Without dead ends: 267 [2019-11-16 00:28:30,191 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:28:30,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-11-16 00:28:30,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 232. [2019-11-16 00:28:30,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-16 00:28:30,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 267 transitions. [2019-11-16 00:28:30,196 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 267 transitions. Word has length 46 [2019-11-16 00:28:30,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:30,196 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 267 transitions. [2019-11-16 00:28:30,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:28:30,196 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 267 transitions. [2019-11-16 00:28:30,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-16 00:28:30,196 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:30,197 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:28:30,197 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:30,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:30,197 INFO L82 PathProgramCache]: Analyzing trace with hash 989091270, now seen corresponding path program 1 times [2019-11-16 00:28:30,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:30,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858639972] [2019-11-16 00:28:30,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:30,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:30,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:28:30,595 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858639972] [2019-11-16 00:28:30,595 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:30,595 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:28:30,596 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32331592] [2019-11-16 00:28:30,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:28:30,596 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:30,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:28:30,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:28:30,596 INFO L87 Difference]: Start difference. First operand 232 states and 267 transitions. Second operand 11 states. [2019-11-16 00:28:31,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:31,302 INFO L93 Difference]: Finished difference Result 269 states and 293 transitions. [2019-11-16 00:28:31,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:28:31,303 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2019-11-16 00:28:31,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:31,304 INFO L225 Difference]: With dead ends: 269 [2019-11-16 00:28:31,304 INFO L226 Difference]: Without dead ends: 269 [2019-11-16 00:28:31,305 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:28:31,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-11-16 00:28:31,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 232. [2019-11-16 00:28:31,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-16 00:28:31,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 266 transitions. [2019-11-16 00:28:31,310 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 266 transitions. Word has length 46 [2019-11-16 00:28:31,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:31,311 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 266 transitions. [2019-11-16 00:28:31,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:28:31,311 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 266 transitions. [2019-11-16 00:28:31,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-16 00:28:31,312 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:31,312 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] [2019-11-16 00:28:31,312 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:31,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:31,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1063911095, now seen corresponding path program 1 times [2019-11-16 00:28:31,313 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:31,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695083207] [2019-11-16 00:28:31,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:31,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:31,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:31,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:28:31,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695083207] [2019-11-16 00:28:31,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590148152] [2019-11-16 00:28:31,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/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-16 00:28:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:31,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-16 00:28:31,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:31,661 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 13 treesize of output 9 [2019-11-16 00:28:31,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:31,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:31,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:28:31,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-16 00:28:31,874 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 6=[|#memory_$Pointer$.offset|]} [2019-11-16 00:28:31,883 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:31,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2019-11-16 00:28:31,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-16 00:28:31,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:31,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:31,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:31,915 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:31,915 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 18 [2019-11-16 00:28:31,916 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-16 00:28:31,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:31,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:31,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:31,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:31,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-16 00:28:31,936 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:37 [2019-11-16 00:28:32,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:32,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:28:32,031 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:28:32,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 18 [2019-11-16 00:28:32,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112677045] [2019-11-16 00:28:32,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-16 00:28:32,031 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:32,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-16 00:28:32,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:28:32,032 INFO L87 Difference]: Start difference. First operand 232 states and 266 transitions. Second operand 18 states. [2019-11-16 00:28:33,000 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 25 [2019-11-16 00:28:34,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:34,207 INFO L93 Difference]: Finished difference Result 364 states and 389 transitions. [2019-11-16 00:28:34,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-16 00:28:34,207 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2019-11-16 00:28:34,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:34,209 INFO L225 Difference]: With dead ends: 364 [2019-11-16 00:28:34,209 INFO L226 Difference]: Without dead ends: 364 [2019-11-16 00:28:34,210 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=234, Invalid=1248, Unknown=0, NotChecked=0, Total=1482 [2019-11-16 00:28:34,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-11-16 00:28:34,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 256. [2019-11-16 00:28:34,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-16 00:28:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 298 transitions. [2019-11-16 00:28:34,215 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 298 transitions. Word has length 46 [2019-11-16 00:28:34,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:34,215 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 298 transitions. [2019-11-16 00:28:34,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-16 00:28:34,216 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 298 transitions. [2019-11-16 00:28:34,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:28:34,216 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:34,217 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:28:34,420 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:28:34,422 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:34,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:34,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1378495491, now seen corresponding path program 1 times [2019-11-16 00:28:34,422 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:34,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502427600] [2019-11-16 00:28:34,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:34,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:34,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:28:34,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502427600] [2019-11-16 00:28:34,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760447086] [2019-11-16 00:28:34,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/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-16 00:28:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:34,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:28:34,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:34,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:28:34,703 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:28:34,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-16 00:28:34,703 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226715323] [2019-11-16 00:28:34,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:28:34,705 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:34,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:28:34,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:28:34,705 INFO L87 Difference]: Start difference. First operand 256 states and 298 transitions. Second operand 7 states. [2019-11-16 00:28:35,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:35,095 INFO L93 Difference]: Finished difference Result 287 states and 329 transitions. [2019-11-16 00:28:35,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:28:35,096 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-11-16 00:28:35,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:35,097 INFO L225 Difference]: With dead ends: 287 [2019-11-16 00:28:35,097 INFO L226 Difference]: Without dead ends: 263 [2019-11-16 00:28:35,098 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:28:35,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-11-16 00:28:35,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2019-11-16 00:28:35,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-16 00:28:35,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 305 transitions. [2019-11-16 00:28:35,103 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 305 transitions. Word has length 47 [2019-11-16 00:28:35,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:35,103 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 305 transitions. [2019-11-16 00:28:35,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:28:35,104 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 305 transitions. [2019-11-16 00:28:35,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:28:35,104 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:35,104 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:28:35,305 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:28:35,305 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:35,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:35,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1752292272, now seen corresponding path program 1 times [2019-11-16 00:28:35,306 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:35,306 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547275429] [2019-11-16 00:28:35,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:35,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:35,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:28:35,540 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547275429] [2019-11-16 00:28:35,540 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:35,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-16 00:28:35,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588506230] [2019-11-16 00:28:35,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:28:35,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:35,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:28:35,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:28:35,541 INFO L87 Difference]: Start difference. First operand 263 states and 305 transitions. Second operand 14 states. [2019-11-16 00:28:36,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:36,967 INFO L93 Difference]: Finished difference Result 681 states and 766 transitions. [2019-11-16 00:28:36,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-16 00:28:36,967 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2019-11-16 00:28:36,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:36,970 INFO L225 Difference]: With dead ends: 681 [2019-11-16 00:28:36,971 INFO L226 Difference]: Without dead ends: 681 [2019-11-16 00:28:36,971 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=278, Invalid=982, Unknown=0, NotChecked=0, Total=1260 [2019-11-16 00:28:36,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-11-16 00:28:36,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 358. [2019-11-16 00:28:36,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-16 00:28:36,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 428 transitions. [2019-11-16 00:28:36,980 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 428 transitions. Word has length 49 [2019-11-16 00:28:36,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:36,981 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 428 transitions. [2019-11-16 00:28:36,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:28:36,981 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 428 transitions. [2019-11-16 00:28:36,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:28:36,982 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:36,982 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:36,983 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:36,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:36,983 INFO L82 PathProgramCache]: Analyzing trace with hash 2032318516, now seen corresponding path program 1 times [2019-11-16 00:28:36,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:36,984 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702497015] [2019-11-16 00:28:36,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:36,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:36,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:37,081 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:28:37,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702497015] [2019-11-16 00:28:37,082 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:37,082 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:28:37,082 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984972920] [2019-11-16 00:28:37,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:28:37,083 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:37,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:28:37,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:28:37,083 INFO L87 Difference]: Start difference. First operand 358 states and 428 transitions. Second operand 7 states. [2019-11-16 00:28:37,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:37,441 INFO L93 Difference]: Finished difference Result 344 states and 400 transitions. [2019-11-16 00:28:37,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:28:37,442 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-11-16 00:28:37,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:37,444 INFO L225 Difference]: With dead ends: 344 [2019-11-16 00:28:37,444 INFO L226 Difference]: Without dead ends: 344 [2019-11-16 00:28:37,444 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:28:37,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-11-16 00:28:37,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2019-11-16 00:28:37,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-11-16 00:28:37,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 400 transitions. [2019-11-16 00:28:37,454 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 400 transitions. Word has length 50 [2019-11-16 00:28:37,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:37,454 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 400 transitions. [2019-11-16 00:28:37,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:28:37,455 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 400 transitions. [2019-11-16 00:28:37,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:28:37,455 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:37,456 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:28:37,456 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:37,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:37,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1989178959, now seen corresponding path program 1 times [2019-11-16 00:28:37,457 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:37,457 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535471379] [2019-11-16 00:28:37,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:37,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:37,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:37,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:28:37,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535471379] [2019-11-16 00:28:37,569 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:37,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:28:37,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637522959] [2019-11-16 00:28:37,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:28:37,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:37,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:28:37,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:28:37,571 INFO L87 Difference]: Start difference. First operand 344 states and 400 transitions. Second operand 8 states. [2019-11-16 00:28:38,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:38,006 INFO L93 Difference]: Finished difference Result 363 states and 418 transitions. [2019-11-16 00:28:38,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:28:38,006 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-11-16 00:28:38,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:38,008 INFO L225 Difference]: With dead ends: 363 [2019-11-16 00:28:38,008 INFO L226 Difference]: Without dead ends: 363 [2019-11-16 00:28:38,008 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:28:38,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-16 00:28:38,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 344. [2019-11-16 00:28:38,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-11-16 00:28:38,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 399 transitions. [2019-11-16 00:28:38,014 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 399 transitions. Word has length 51 [2019-11-16 00:28:38,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:38,015 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 399 transitions. [2019-11-16 00:28:38,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:28:38,015 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 399 transitions. [2019-11-16 00:28:38,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:28:38,016 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:38,016 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:28:38,017 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:38,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:38,017 INFO L82 PathProgramCache]: Analyzing trace with hash 551179475, now seen corresponding path program 1 times [2019-11-16 00:28:38,017 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:38,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631483445] [2019-11-16 00:28:38,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:38,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:38,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:38,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:28:38,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631483445] [2019-11-16 00:28:38,410 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:38,410 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-16 00:28:38,410 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844279303] [2019-11-16 00:28:38,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:28:38,411 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:38,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:28:38,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:28:38,412 INFO L87 Difference]: Start difference. First operand 344 states and 399 transitions. Second operand 16 states. [2019-11-16 00:28:40,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:40,153 INFO L93 Difference]: Finished difference Result 613 states and 705 transitions. [2019-11-16 00:28:40,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-16 00:28:40,154 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2019-11-16 00:28:40,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:40,157 INFO L225 Difference]: With dead ends: 613 [2019-11-16 00:28:40,157 INFO L226 Difference]: Without dead ends: 613 [2019-11-16 00:28:40,159 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=302, Invalid=1180, Unknown=0, NotChecked=0, Total=1482 [2019-11-16 00:28:40,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-11-16 00:28:40,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 351. [2019-11-16 00:28:40,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-11-16 00:28:40,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 406 transitions. [2019-11-16 00:28:40,168 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 406 transitions. Word has length 53 [2019-11-16 00:28:40,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:40,168 INFO L462 AbstractCegarLoop]: Abstraction has 351 states and 406 transitions. [2019-11-16 00:28:40,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:28:40,169 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 406 transitions. [2019-11-16 00:28:40,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:28:40,170 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:40,170 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:28:40,170 INFO L410 AbstractCegarLoop]: === Iteration 35 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:40,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:40,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1856825290, now seen corresponding path program 1 times [2019-11-16 00:28:40,171 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:40,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179283957] [2019-11-16 00:28:40,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:40,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:40,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:40,335 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-16 00:28:40,335 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179283957] [2019-11-16 00:28:40,335 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:40,335 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-16 00:28:40,335 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641576859] [2019-11-16 00:28:40,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:28:40,336 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:40,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:28:40,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:28:40,336 INFO L87 Difference]: Start difference. First operand 351 states and 406 transitions. Second operand 11 states. [2019-11-16 00:28:40,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:40,997 INFO L93 Difference]: Finished difference Result 553 states and 649 transitions. [2019-11-16 00:28:40,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:28:40,997 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-11-16 00:28:40,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:40,999 INFO L225 Difference]: With dead ends: 553 [2019-11-16 00:28:41,000 INFO L226 Difference]: Without dead ends: 553 [2019-11-16 00:28:41,000 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:28:41,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-11-16 00:28:41,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 328. [2019-11-16 00:28:41,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-11-16 00:28:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 381 transitions. [2019-11-16 00:28:41,007 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 381 transitions. Word has length 53 [2019-11-16 00:28:41,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:41,008 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 381 transitions. [2019-11-16 00:28:41,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:28:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 381 transitions. [2019-11-16 00:28:41,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-16 00:28:41,009 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:41,009 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:28:41,010 INFO L410 AbstractCegarLoop]: === Iteration 36 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:41,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:41,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1402511670, now seen corresponding path program 1 times [2019-11-16 00:28:41,010 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:41,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115729098] [2019-11-16 00:28:41,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:41,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:41,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:41,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:28:41,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115729098] [2019-11-16 00:28:41,416 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:41,416 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-16 00:28:41,416 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247104478] [2019-11-16 00:28:41,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:28:41,417 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:41,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:28:41,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:28:41,417 INFO L87 Difference]: Start difference. First operand 328 states and 381 transitions. Second operand 16 states. [2019-11-16 00:28:43,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:43,068 INFO L93 Difference]: Finished difference Result 588 states and 678 transitions. [2019-11-16 00:28:43,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-16 00:28:43,069 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-11-16 00:28:43,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:43,073 INFO L225 Difference]: With dead ends: 588 [2019-11-16 00:28:43,073 INFO L226 Difference]: Without dead ends: 588 [2019-11-16 00:28:43,073 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=318, Invalid=872, Unknown=0, NotChecked=0, Total=1190 [2019-11-16 00:28:43,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-11-16 00:28:43,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 330. [2019-11-16 00:28:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-11-16 00:28:43,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 383 transitions. [2019-11-16 00:28:43,082 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 383 transitions. Word has length 55 [2019-11-16 00:28:43,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:43,083 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 383 transitions. [2019-11-16 00:28:43,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:28:43,083 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 383 transitions. [2019-11-16 00:28:43,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-16 00:28:43,084 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:43,084 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:43,085 INFO L410 AbstractCegarLoop]: === Iteration 37 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:43,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:43,085 INFO L82 PathProgramCache]: Analyzing trace with hash -649324317, now seen corresponding path program 1 times [2019-11-16 00:28:43,085 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:43,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144318849] [2019-11-16 00:28:43,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:43,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:43,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:43,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:28:43,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144318849] [2019-11-16 00:28:43,162 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:43,163 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:28:43,163 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394491753] [2019-11-16 00:28:43,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:28:43,164 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:43,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:28:43,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:28:43,165 INFO L87 Difference]: Start difference. First operand 330 states and 383 transitions. Second operand 6 states. [2019-11-16 00:28:43,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:43,463 INFO L93 Difference]: Finished difference Result 343 states and 396 transitions. [2019-11-16 00:28:43,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:28:43,463 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-11-16 00:28:43,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:43,465 INFO L225 Difference]: With dead ends: 343 [2019-11-16 00:28:43,465 INFO L226 Difference]: Without dead ends: 343 [2019-11-16 00:28:43,465 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:28:43,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-11-16 00:28:43,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 333. [2019-11-16 00:28:43,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-11-16 00:28:43,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 385 transitions. [2019-11-16 00:28:43,471 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 385 transitions. Word has length 55 [2019-11-16 00:28:43,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:43,472 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 385 transitions. [2019-11-16 00:28:43,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:28:43,472 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 385 transitions. [2019-11-16 00:28:43,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-16 00:28:43,473 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:43,473 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:43,474 INFO L410 AbstractCegarLoop]: === Iteration 38 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:43,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:43,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1107856318, now seen corresponding path program 1 times [2019-11-16 00:28:43,475 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:43,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956917274] [2019-11-16 00:28:43,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:43,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:43,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:44,050 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-16 00:28:44,050 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956917274] [2019-11-16 00:28:44,050 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010271156] [2019-11-16 00:28:44,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/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-16 00:28:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:44,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-16 00:28:44,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:44,277 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 13 treesize of output 9 [2019-11-16 00:28:44,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:44,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:44,298 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 13 treesize of output 9 [2019-11-16 00:28:44,298 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:44,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:44,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:28:44,316 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-11-16 00:28:44,389 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:44,389 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-16 00:28:44,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:44,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:44,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:28:44,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2019-11-16 00:28:44,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:44,477 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2019-11-16 00:28:44,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:44,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:44,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:44,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2019-11-16 00:28:44,519 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:44,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:44,574 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-16 00:28:44,574 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:36 [2019-11-16 00:28:44,679 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_56|], 6=[|v_#memory_$Pointer$.base_55|]} [2019-11-16 00:28:44,693 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 31 treesize of output 26 [2019-11-16 00:28:44,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:44,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:44,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:44,763 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:44,763 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 52 treesize of output 107 [2019-11-16 00:28:44,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:44,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:28:44,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:28:44,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:44,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:28:44,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:44,768 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:44,904 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2019-11-16 00:28:44,904 INFO L567 ElimStorePlain]: treesize reduction 549, result has 10.3 percent of original size [2019-11-16 00:28:44,905 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-16 00:28:44,905 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:62 [2019-11-16 00:28:45,123 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_57|], 12=[|v_#memory_$Pointer$.base_56|]} [2019-11-16 00:28:45,142 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:45,143 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 62 [2019-11-16 00:28:45,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:45,214 INFO L567 ElimStorePlain]: treesize reduction 26, result has 75.7 percent of original size [2019-11-16 00:28:45,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:45,308 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:45,308 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 172 [2019-11-16 00:28:45,310 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:45,382 INFO L567 ElimStorePlain]: treesize reduction 100, result has 41.5 percent of original size [2019-11-16 00:28:45,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:45,383 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-16 00:28:45,384 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:71 [2019-11-16 00:28:45,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:45,500 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_58|], 12=[|v_#memory_$Pointer$.base_57|]} [2019-11-16 00:28:45,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:45,507 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 42 treesize of output 40 [2019-11-16 00:28:45,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:45,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:45,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:45,667 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-11-16 00:28:45,667 INFO L341 Elim1Store]: treesize reduction 46, result has 65.2 percent of original size [2019-11-16 00:28:45,667 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 124 [2019-11-16 00:28:45,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:45,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:28:45,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:45,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:45,671 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:45,728 INFO L567 ElimStorePlain]: treesize reduction 198, result has 28.5 percent of original size [2019-11-16 00:28:45,729 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-16 00:28:45,729 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:78 [2019-11-16 00:28:45,926 INFO L392 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.offset|], 10=[|#memory_$Pointer$.base|]} [2019-11-16 00:28:45,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:45,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 13 [2019-11-16 00:28:45,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:45,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:46,008 INFO L341 Elim1Store]: treesize reduction 10, result has 84.1 percent of original size [2019-11-16 00:28:46,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 72 [2019-11-16 00:28:46,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:46,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:46,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:46,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:46,011 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-16 00:28:46,027 INFO L567 ElimStorePlain]: treesize reduction 26, result has 29.7 percent of original size [2019-11-16 00:28:46,027 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-16 00:28:46,027 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:7 [2019-11-16 00:28:46,049 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-16 00:28:46,049 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:28:46,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 31 [2019-11-16 00:28:46,050 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949449107] [2019-11-16 00:28:46,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-16 00:28:46,051 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:46,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-16 00:28:46,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=779, Unknown=1, NotChecked=0, Total=930 [2019-11-16 00:28:46,052 INFO L87 Difference]: Start difference. First operand 333 states and 385 transitions. Second operand 31 states. [2019-11-16 00:28:49,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:49,277 INFO L93 Difference]: Finished difference Result 579 states and 646 transitions. [2019-11-16 00:28:49,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-11-16 00:28:49,278 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 57 [2019-11-16 00:28:49,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:49,280 INFO L225 Difference]: With dead ends: 579 [2019-11-16 00:28:49,281 INFO L226 Difference]: Without dead ends: 579 [2019-11-16 00:28:49,282 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=670, Invalid=3231, Unknown=5, NotChecked=0, Total=3906 [2019-11-16 00:28:49,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-11-16 00:28:49,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 384. [2019-11-16 00:28:49,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-16 00:28:49,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 440 transitions. [2019-11-16 00:28:49,290 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 440 transitions. Word has length 57 [2019-11-16 00:28:49,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:49,291 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 440 transitions. [2019-11-16 00:28:49,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-16 00:28:49,291 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 440 transitions. [2019-11-16 00:28:49,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-16 00:28:49,292 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:49,292 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:49,498 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:28:49,498 INFO L410 AbstractCegarLoop]: === Iteration 39 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr58REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr65REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr48REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2019-11-16 00:28:49,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:49,499 INFO L82 PathProgramCache]: Analyzing trace with hash -270994893, now seen corresponding path program 1 times [2019-11-16 00:28:49,499 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:49,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981334775] [2019-11-16 00:28:49,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:49,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:49,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:28:49,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981334775] [2019-11-16 00:28:49,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514032583] [2019-11-16 00:28:49,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/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-16 00:28:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:49,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-16 00:28:49,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:50,121 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_59|], 2=[|v_#memory_$Pointer$.base_58|]} [2019-11-16 00:28:50,125 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-16 00:28:50,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:50,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:50,157 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:50,158 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 42 [2019-11-16 00:28:50,158 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:50,219 INFO L567 ElimStorePlain]: treesize reduction 16, result has 75.4 percent of original size [2019-11-16 00:28:50,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:28:50,220 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:49 [2019-11-16 00:28:50,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:50,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:50,285 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 52 treesize of output 51 [2019-11-16 00:28:50,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:50,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:50,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:50,300 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:50,301 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 81 [2019-11-16 00:28:50,302 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:50,397 INFO L567 ElimStorePlain]: treesize reduction 28, result has 82.2 percent of original size [2019-11-16 00:28:50,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:50,407 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 80 treesize of output 75 [2019-11-16 00:28:50,408 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:50,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:50,415 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 47 [2019-11-16 00:28:50,416 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:50,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:50,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-16 00:28:50,456 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:141, output treesize:117 [2019-11-16 00:28:50,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:50,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:50,650 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 58 treesize of output 44 [2019-11-16 00:28:50,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:50,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:50,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:50,672 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:50,673 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 67 [2019-11-16 00:28:50,674 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:50,808 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-11-16 00:28:50,809 INFO L567 ElimStorePlain]: treesize reduction 4, result has 95.7 percent of original size [2019-11-16 00:28:50,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:50,817 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 38 treesize of output 24 [2019-11-16 00:28:50,817 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:51,019 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:28:51,019 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-16 00:28:51,024 INFO L168 Benchmark]: Toolchain (without parser) took 49347.58 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 491.8 MB). Free memory was 940.7 MB in the beginning and 1.2 GB in the end (delta: -263.5 MB). Peak memory consumption was 228.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:28:51,026 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:28:51,027 INFO L168 Benchmark]: CACSL2BoogieTranslator took 556.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.3 MB). Free memory was 940.7 MB in the beginning and 1.2 GB in the end (delta: -231.2 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:28:51,027 INFO L168 Benchmark]: Boogie Preprocessor took 78.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:28:51,027 INFO L168 Benchmark]: RCFGBuilder took 1073.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 76.1 MB). Peak memory consumption was 76.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:28:51,028 INFO L168 Benchmark]: TraceAbstraction took 47634.44 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 302.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -113.8 MB). Peak memory consumption was 188.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:28:51,030 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 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 556.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.3 MB). Free memory was 940.7 MB in the beginning and 1.2 GB in the end (delta: -231.2 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1073.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 76.1 MB). Peak memory consumption was 76.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 47634.44 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 302.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -113.8 MB). Peak memory consumption was 188.7 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-16 00:28:53,345 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:28:53,346 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:28:53,359 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:28:53,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:28:53,361 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:28:53,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:28:53,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:28:53,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:28:53,368 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:28:53,369 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:28:53,370 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:28:53,371 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:28:53,372 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:28:53,373 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:28:53,374 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:28:53,375 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:28:53,376 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:28:53,379 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:28:53,382 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:28:53,384 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:28:53,386 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:28:53,387 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:28:53,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:28:53,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:28:53,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:28:53,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:28:53,394 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:28:53,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:28:53,396 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:28:53,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:28:53,397 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:28:53,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:28:53,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:28:53,400 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:28:53,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:28:53,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:28:53,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:28:53,402 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:28:53,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:28:53,404 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:28:53,405 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-16 00:28:53,422 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:28:53,422 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:28:53,424 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:28:53,424 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:28:53,424 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:28:53,425 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:28:53,425 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:28:53,425 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:28:53,426 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:28:53,426 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:28:53,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:28:53,427 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:28:53,427 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:28:53,427 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:28:53,427 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:28:53,428 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:28:53,428 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:28:53,428 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:28:53,428 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:28:53,429 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:28:53,429 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:28:53,429 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:28:53,430 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:28:53,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:28:53,430 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:28:53,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:28:53,431 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:28:53,431 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:28:53,431 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:28:53,432 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_4243f1d6-628b-4857-a82c-1c9c2a8efdda/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 877ba8a79b8b7ad33de53a48617e3dd4b0411834 [2019-11-16 00:28:53,469 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:28:53,481 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:28:53,485 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:28:53,487 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:28:53,487 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:28:53,488 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/bin/uautomizer/../../sv-benchmarks/c/forester-heap/dll-01-2.i [2019-11-16 00:28:53,550 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/bin/uautomizer/data/104d06bd6/2bc4ab0044b44a81943158d02b470446/FLAGf2252043b [2019-11-16 00:28:54,086 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:28:54,087 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/sv-benchmarks/c/forester-heap/dll-01-2.i [2019-11-16 00:28:54,101 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/bin/uautomizer/data/104d06bd6/2bc4ab0044b44a81943158d02b470446/FLAGf2252043b [2019-11-16 00:28:54,421 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/bin/uautomizer/data/104d06bd6/2bc4ab0044b44a81943158d02b470446 [2019-11-16 00:28:54,425 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:28:54,426 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:28:54,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:28:54,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:28:54,438 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:28:54,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:28:54" (1/1) ... [2019-11-16 00:28:54,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b82f1f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:54, skipping insertion in model container [2019-11-16 00:28:54,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:28:54" (1/1) ... [2019-11-16 00:28:54,451 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:28:54,526 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:28:55,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:28:55,057 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:28:55,111 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:28:55,178 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:28:55,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:55 WrapperNode [2019-11-16 00:28:55,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:28:55,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:28:55,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:28:55,180 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:28:55,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:55" (1/1) ... [2019-11-16 00:28:55,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:55" (1/1) ... [2019-11-16 00:28:55,217 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:55" (1/1) ... [2019-11-16 00:28:55,217 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:55" (1/1) ... [2019-11-16 00:28:55,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:55" (1/1) ... [2019-11-16 00:28:55,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:55" (1/1) ... [2019-11-16 00:28:55,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:55" (1/1) ... [2019-11-16 00:28:55,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:28:55,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:28:55,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:28:55,278 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:28:55,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/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-16 00:28:55,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:28:55,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:28:55,340 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:28:55,341 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:28:55,341 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:28:55,341 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:28:55,341 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:28:55,342 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:28:55,342 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:28:55,343 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:28:55,343 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:28:55,343 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:28:55,343 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:28:55,343 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:28:55,343 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:28:55,344 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:28:55,344 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:28:55,344 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:28:55,344 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:28:55,344 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:28:55,345 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:28:55,345 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:28:55,345 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:28:55,345 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:28:55,345 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:28:55,345 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:28:55,346 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:28:55,346 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:28:55,346 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:28:55,346 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:28:55,346 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:28:55,346 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:28:55,346 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:28:55,347 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:28:55,347 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:28:55,347 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:28:55,347 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:28:55,347 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:28:55,347 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:28:55,347 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:28:55,347 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:28:55,347 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:28:55,348 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:28:55,348 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:28:55,348 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:28:55,348 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:28:55,348 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:28:55,349 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:28:55,349 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:28:55,349 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:28:55,349 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:28:55,349 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:28:55,350 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:28:55,350 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:28:55,350 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:28:55,350 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:28:55,350 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:28:55,350 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-16 00:28:55,351 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:28:55,351 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:28:55,351 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:28:55,351 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-16 00:28:55,351 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:28:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:28:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-16 00:28:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:28:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:28:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-16 00:28:55,353 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:28:55,353 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:28:55,353 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:28:55,353 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:28:55,354 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:28:55,354 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:28:55,354 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:28:55,354 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:28:55,354 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:28:55,355 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:28:55,355 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:28:55,355 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:28:55,355 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:28:55,355 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:28:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:28:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:28:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:28:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:28:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:28:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:28:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:28:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:28:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:28:55,358 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:28:55,358 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:28:55,358 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:28:55,358 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:28:55,358 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:28:55,359 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:28:55,359 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:28:55,359 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:28:55,359 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:28:55,360 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:28:55,360 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:28:55,360 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:28:55,360 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:28:55,360 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:28:55,361 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:28:55,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-16 00:28:55,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-16 00:28:55,361 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:28:55,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:28:55,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:28:55,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:28:55,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:28:55,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:28:55,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:28:56,633 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:28:56,634 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-16 00:28:56,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:28:56 BoogieIcfgContainer [2019-11-16 00:28:56,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:28:56,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:28:56,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:28:56,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:28:56,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:28:54" (1/3) ... [2019-11-16 00:28:56,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569ca1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:28:56, skipping insertion in model container [2019-11-16 00:28:56,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:55" (2/3) ... [2019-11-16 00:28:56,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569ca1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:28:56, skipping insertion in model container [2019-11-16 00:28:56,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:28:56" (3/3) ... [2019-11-16 00:28:56,647 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-01-2.i [2019-11-16 00:28:56,659 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:28:56,670 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 73 error locations. [2019-11-16 00:28:56,683 INFO L249 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2019-11-16 00:28:56,708 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:28:56,708 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:28:56,708 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:28:56,709 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:28:56,709 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:28:56,709 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:28:56,709 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:28:56,710 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:28:56,733 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states. [2019-11-16 00:28:56,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-16 00:28:56,743 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:56,744 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:56,746 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr71ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr65REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr67REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr66REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr68REQUIRES_VIOLATION, mainErr72ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr70ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-16 00:28:56,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:56,753 INFO L82 PathProgramCache]: Analyzing trace with hash -928996123, now seen corresponding path program 1 times [2019-11-16 00:28:56,764 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:28:56,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [865981545] [2019-11-16 00:28:56,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4243f1d6-628b-4857-a82c-1c9c2a8efdda/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-16 00:28:56,999 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:28:57,000 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-16 00:28:57,005 INFO L168 Benchmark]: Toolchain (without parser) took 2577.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 948.3 MB in the beginning and 1.0 GB in the end (delta: -91.1 MB). Peak memory consumption was 62.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:28:57,005 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:28:57,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:28:57,006 INFO L168 Benchmark]: Boogie Preprocessor took 93.33 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-16 00:28:57,008 INFO L168 Benchmark]: RCFGBuilder took 1362.05 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: 76.8 MB). Peak memory consumption was 76.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:28:57,009 INFO L168 Benchmark]: TraceAbstraction took 365.78 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.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:28:57,012 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.37 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 747.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.33 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 1362.05 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: 76.8 MB). Peak memory consumption was 76.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 365.78 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.0 MB). Peak memory consumption was 13.0 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...