./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-simple-white-blue-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_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/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 a0270bdb02afc11bd88836e5502a475e981de345 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/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 a0270bdb02afc11bd88836e5502a475e981de345 ..................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:54:29,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:54:29,016 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:54:29,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:54:29,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:54:29,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:54:29,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:54:29,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:54:29,038 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:54:29,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:54:29,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:54:29,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:54:29,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:54:29,044 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:54:29,045 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:54:29,046 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:54:29,047 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:54:29,048 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:54:29,050 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:54:29,053 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:54:29,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:54:29,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:54:29,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:54:29,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:54:29,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:54:29,064 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:54:29,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:54:29,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:54:29,066 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:54:29,067 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:54:29,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:54:29,068 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:54:29,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:54:29,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:54:29,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:54:29,078 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:54:29,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:54:29,079 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:54:29,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:54:29,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:54:29,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:54:29,082 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 22:54:29,105 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:54:29,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:54:29,107 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:54:29,107 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:54:29,108 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:54:29,108 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:54:29,108 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:54:29,109 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:54:29,109 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:54:29,109 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:54:29,109 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:54:29,110 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 22:54:29,110 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 22:54:29,110 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 22:54:29,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:54:29,111 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:54:29,111 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:54:29,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:54:29,112 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:54:29,112 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:54:29,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:54:29,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:54:29,113 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:54:29,113 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:54:29,113 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:54:29,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:54:29,114 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_fec08634-5de8-4ed6-ad03-1168063a7098/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 -> a0270bdb02afc11bd88836e5502a475e981de345 [2019-11-15 22:54:29,150 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:54:29,162 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:54:29,175 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:54:29,177 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:54:29,177 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:54:29,181 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/../../sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i [2019-11-15 22:54:29,262 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/data/3453e9df5/702e424815dc4c7db54a9777f71140c7/FLAG7590d299b [2019-11-15 22:54:29,798 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:54:29,799 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i [2019-11-15 22:54:29,818 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/data/3453e9df5/702e424815dc4c7db54a9777f71140c7/FLAG7590d299b [2019-11-15 22:54:30,107 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/data/3453e9df5/702e424815dc4c7db54a9777f71140c7 [2019-11-15 22:54:30,111 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:54:30,113 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 22:54:30,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:54:30,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:54:30,119 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:54:30,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:54:30" (1/1) ... [2019-11-15 22:54:30,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@511c7b40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:54:30, skipping insertion in model container [2019-11-15 22:54:30,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:54:30" (1/1) ... [2019-11-15 22:54:30,134 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:54:30,190 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:54:30,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:54:30,694 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:54:30,757 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:54:30,826 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:54:30,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:54:30 WrapperNode [2019-11-15 22:54:30,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:54:30,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:54:30,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:54:30,828 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:54:30,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:54:30" (1/1) ... [2019-11-15 22:54:30,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:54:30" (1/1) ... [2019-11-15 22:54:30,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:54:30" (1/1) ... [2019-11-15 22:54:30,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:54:30" (1/1) ... [2019-11-15 22:54:30,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:54:30" (1/1) ... [2019-11-15 22:54:30,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:54:30" (1/1) ... [2019-11-15 22:54:30,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:54:30" (1/1) ... [2019-11-15 22:54:30,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:54:30,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:54:30,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:54:30,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:54:30,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:54:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:54:31,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 22:54:31,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:54:31,038 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 22:54:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 22:54:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 22:54:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 22:54:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 22:54:31,040 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 22:54:31,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 22:54:31,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 22:54:31,040 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 22:54:31,041 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 22:54:31,041 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 22:54:31,041 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 22:54:31,041 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 22:54:31,042 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 22:54:31,042 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 22:54:31,042 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 22:54:31,042 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 22:54:31,043 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 22:54:31,043 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 22:54:31,043 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 22:54:31,043 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 22:54:31,044 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 22:54:31,044 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 22:54:31,044 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 22:54:31,044 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 22:54:31,044 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 22:54:31,045 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 22:54:31,045 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 22:54:31,045 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 22:54:31,045 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 22:54:31,046 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 22:54:31,046 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 22:54:31,046 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 22:54:31,046 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 22:54:31,046 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 22:54:31,047 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 22:54:31,047 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 22:54:31,047 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 22:54:31,047 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 22:54:31,048 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 22:54:31,048 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 22:54:31,048 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 22:54:31,048 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 22:54:31,048 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 22:54:31,049 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 22:54:31,049 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 22:54:31,049 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 22:54:31,049 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 22:54:31,049 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 22:54:31,050 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 22:54:31,050 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 22:54:31,050 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 22:54:31,050 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 22:54:31,051 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 22:54:31,051 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 22:54:31,051 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 22:54:31,051 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 22:54:31,051 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 22:54:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 22:54:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 22:54:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 22:54:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 22:54:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 22:54:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 22:54:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 22:54:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 22:54:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 22:54:31,054 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 22:54:31,054 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 22:54:31,054 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 22:54:31,054 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 22:54:31,054 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 22:54:31,055 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 22:54:31,055 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 22:54:31,055 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 22:54:31,055 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 22:54:31,056 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 22:54:31,056 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 22:54:31,056 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 22:54:31,056 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 22:54:31,056 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 22:54:31,057 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 22:54:31,057 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 22:54:31,057 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 22:54:31,057 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 22:54:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 22:54:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 22:54:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 22:54:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 22:54:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 22:54:31,059 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 22:54:31,059 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 22:54:31,059 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 22:54:31,059 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 22:54:31,059 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 22:54:31,060 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 22:54:31,060 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 22:54:31,060 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 22:54:31,060 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 22:54:31,061 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 22:54:31,061 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 22:54:31,061 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 22:54:31,061 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 22:54:31,062 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 22:54:31,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 22:54:31,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 22:54:31,062 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 22:54:31,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:54:31,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:54:31,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:54:31,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:54:31,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:54:31,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:54:31,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 22:54:31,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:54:32,217 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:54:32,218 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 22:54:32,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:54:32 BoogieIcfgContainer [2019-11-15 22:54:32,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:54:32,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:54:32,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:54:32,224 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:54:32,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:54:30" (1/3) ... [2019-11-15 22:54:32,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b250f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:54:32, skipping insertion in model container [2019-11-15 22:54:32,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:54:30" (2/3) ... [2019-11-15 22:54:32,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b250f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:54:32, skipping insertion in model container [2019-11-15 22:54:32,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:54:32" (3/3) ... [2019-11-15 22:54:32,229 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-simple-white-blue-2.i [2019-11-15 22:54:32,240 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:54:32,248 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 58 error locations. [2019-11-15 22:54:32,259 INFO L249 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2019-11-15 22:54:32,278 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:54:32,278 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 22:54:32,279 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:54:32,280 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:54:32,280 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:54:32,280 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:54:32,280 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:54:32,280 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:54:32,303 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-11-15 22:54:32,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 22:54:32,314 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:54:32,315 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:54:32,317 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:54:32,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:32,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1740098892, now seen corresponding path program 1 times [2019-11-15 22:54:32,333 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:54:32,333 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826929813] [2019-11-15 22:54:32,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:32,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:32,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:54:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:32,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:32,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826929813] [2019-11-15 22:54:32,566 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:54:32,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:54:32,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145708762] [2019-11-15 22:54:32,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:54:32,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:54:32,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:54:32,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:54:32,591 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 4 states. [2019-11-15 22:54:33,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:54:33,248 INFO L93 Difference]: Finished difference Result 150 states and 160 transitions. [2019-11-15 22:54:33,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:54:33,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 22:54:33,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:54:33,266 INFO L225 Difference]: With dead ends: 150 [2019-11-15 22:54:33,266 INFO L226 Difference]: Without dead ends: 144 [2019-11-15 22:54:33,268 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:54:33,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-15 22:54:33,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 117. [2019-11-15 22:54:33,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-15 22:54:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2019-11-15 22:54:33,322 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 7 [2019-11-15 22:54:33,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:54:33,322 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2019-11-15 22:54:33,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:54:33,323 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2019-11-15 22:54:33,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 22:54:33,323 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:54:33,324 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:54:33,324 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:54:33,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:33,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1740098891, now seen corresponding path program 1 times [2019-11-15 22:54:33,325 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:54:33,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521614125] [2019-11-15 22:54:33,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:33,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:33,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:54:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:33,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:33,403 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521614125] [2019-11-15 22:54:33,404 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:54:33,404 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:54:33,404 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125348766] [2019-11-15 22:54:33,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:54:33,413 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:54:33,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:54:33,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:54:33,414 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 4 states. [2019-11-15 22:54:33,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:54:33,934 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2019-11-15 22:54:33,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:54:33,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 22:54:33,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:54:33,937 INFO L225 Difference]: With dead ends: 141 [2019-11-15 22:54:33,937 INFO L226 Difference]: Without dead ends: 141 [2019-11-15 22:54:33,938 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:54:33,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-15 22:54:33,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 114. [2019-11-15 22:54:33,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 22:54:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2019-11-15 22:54:33,970 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 7 [2019-11-15 22:54:33,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:54:33,971 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2019-11-15 22:54:33,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:54:33,971 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2019-11-15 22:54:33,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 22:54:33,973 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:54:33,973 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:54:33,974 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:54:33,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:33,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1100463805, now seen corresponding path program 1 times [2019-11-15 22:54:33,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:54:33,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687112933] [2019-11-15 22:54:33,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:33,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:33,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:54:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:34,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:34,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687112933] [2019-11-15 22:54:34,163 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:54:34,163 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:54:34,169 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055871328] [2019-11-15 22:54:34,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:54:34,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:54:34,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:54:34,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:54:34,173 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 5 states. [2019-11-15 22:54:34,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:54:34,624 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2019-11-15 22:54:34,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:54:34,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-15 22:54:34,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:54:34,627 INFO L225 Difference]: With dead ends: 114 [2019-11-15 22:54:34,627 INFO L226 Difference]: Without dead ends: 114 [2019-11-15 22:54:34,628 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-15 22:54:34,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-15 22:54:34,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2019-11-15 22:54:34,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-15 22:54:34,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2019-11-15 22:54:34,646 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 13 [2019-11-15 22:54:34,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:54:34,647 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2019-11-15 22:54:34,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:54:34,648 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2019-11-15 22:54:34,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 22:54:34,654 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:54:34,655 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:54:34,655 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:54:34,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:34,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1100463806, now seen corresponding path program 1 times [2019-11-15 22:54:34,656 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:54:34,656 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492899371] [2019-11-15 22:54:34,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:34,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:34,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:54:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:34,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:34,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492899371] [2019-11-15 22:54:34,821 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:54:34,821 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:54:34,821 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171889041] [2019-11-15 22:54:34,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:54:34,822 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:54:34,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:54:34,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:54:34,823 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand 5 states. [2019-11-15 22:54:35,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:54:35,237 INFO L93 Difference]: Finished difference Result 147 states and 160 transitions. [2019-11-15 22:54:35,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:54:35,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-15 22:54:35,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:54:35,239 INFO L225 Difference]: With dead ends: 147 [2019-11-15 22:54:35,239 INFO L226 Difference]: Without dead ends: 147 [2019-11-15 22:54:35,239 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:54:35,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-15 22:54:35,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 124. [2019-11-15 22:54:35,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-15 22:54:35,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 142 transitions. [2019-11-15 22:54:35,251 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 142 transitions. Word has length 13 [2019-11-15 22:54:35,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:54:35,251 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 142 transitions. [2019-11-15 22:54:35,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:54:35,251 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 142 transitions. [2019-11-15 22:54:35,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 22:54:35,252 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:54:35,252 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:54:35,253 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:54:35,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:35,253 INFO L82 PathProgramCache]: Analyzing trace with hash 983761664, now seen corresponding path program 1 times [2019-11-15 22:54:35,253 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:54:35,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333410807] [2019-11-15 22:54:35,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:35,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:35,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:54:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:35,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:35,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333410807] [2019-11-15 22:54:35,329 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:54:35,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:54:35,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066600775] [2019-11-15 22:54:35,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:54:35,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:54:35,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:54:35,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:54:35,331 INFO L87 Difference]: Start difference. First operand 124 states and 142 transitions. Second operand 6 states. [2019-11-15 22:54:35,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:54:35,845 INFO L93 Difference]: Finished difference Result 202 states and 231 transitions. [2019-11-15 22:54:35,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:54:35,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-15 22:54:35,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:54:35,849 INFO L225 Difference]: With dead ends: 202 [2019-11-15 22:54:35,850 INFO L226 Difference]: Without dead ends: 202 [2019-11-15 22:54:35,850 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-15 22:54:35,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-15 22:54:35,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 123. [2019-11-15 22:54:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-15 22:54:35,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 140 transitions. [2019-11-15 22:54:35,862 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 140 transitions. Word has length 15 [2019-11-15 22:54:35,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:54:35,862 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 140 transitions. [2019-11-15 22:54:35,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:54:35,863 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 140 transitions. [2019-11-15 22:54:35,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 22:54:35,863 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:54:35,863 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:54:35,864 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:54:35,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:35,864 INFO L82 PathProgramCache]: Analyzing trace with hash 983761665, now seen corresponding path program 1 times [2019-11-15 22:54:35,865 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:54:35,865 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532957799] [2019-11-15 22:54:35,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:35,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:35,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:54:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:35,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:35,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532957799] [2019-11-15 22:54:35,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:54:35,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:54:35,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319965036] [2019-11-15 22:54:35,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:54:35,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:54:35,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:54:35,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:54:35,961 INFO L87 Difference]: Start difference. First operand 123 states and 140 transitions. Second operand 6 states. [2019-11-15 22:54:36,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:54:36,584 INFO L93 Difference]: Finished difference Result 211 states and 241 transitions. [2019-11-15 22:54:36,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:54:36,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-15 22:54:36,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:54:36,586 INFO L225 Difference]: With dead ends: 211 [2019-11-15 22:54:36,586 INFO L226 Difference]: Without dead ends: 211 [2019-11-15 22:54:36,586 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-15 22:54:36,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-15 22:54:36,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 122. [2019-11-15 22:54:36,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-15 22:54:36,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2019-11-15 22:54:36,601 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 15 [2019-11-15 22:54:36,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:54:36,601 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2019-11-15 22:54:36,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:54:36,602 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2019-11-15 22:54:36,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 22:54:36,603 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:54:36,603 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:54:36,603 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:54:36,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:36,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1533704130, now seen corresponding path program 1 times [2019-11-15 22:54:36,604 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:54:36,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62982732] [2019-11-15 22:54:36,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:36,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:36,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:54:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:36,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62982732] [2019-11-15 22:54:36,773 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:54:36,773 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:54:36,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633484400] [2019-11-15 22:54:36,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:54:36,774 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:54:36,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:54:36,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:54:36,775 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 10 states. [2019-11-15 22:54:37,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:54:37,463 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2019-11-15 22:54:37,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:54:37,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-15 22:54:37,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:54:37,464 INFO L225 Difference]: With dead ends: 126 [2019-11-15 22:54:37,464 INFO L226 Difference]: Without dead ends: 126 [2019-11-15 22:54:37,465 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:54:37,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-15 22:54:37,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 121. [2019-11-15 22:54:37,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 22:54:37,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 137 transitions. [2019-11-15 22:54:37,471 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 137 transitions. Word has length 19 [2019-11-15 22:54:37,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:54:37,472 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 137 transitions. [2019-11-15 22:54:37,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:54:37,472 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 137 transitions. [2019-11-15 22:54:37,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 22:54:37,473 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:54:37,473 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:54:37,473 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:54:37,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:37,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1533704131, now seen corresponding path program 1 times [2019-11-15 22:54:37,474 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:54:37,474 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937680590] [2019-11-15 22:54:37,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:37,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:37,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:54:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:37,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:37,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937680590] [2019-11-15 22:54:37,660 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:54:37,660 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 22:54:37,661 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097014171] [2019-11-15 22:54:37,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 22:54:37,661 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:54:37,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 22:54:37,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:54:37,662 INFO L87 Difference]: Start difference. First operand 121 states and 137 transitions. Second operand 11 states. [2019-11-15 22:54:38,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:54:38,816 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2019-11-15 22:54:38,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 22:54:38,817 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-15 22:54:38,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:54:38,818 INFO L225 Difference]: With dead ends: 124 [2019-11-15 22:54:38,818 INFO L226 Difference]: Without dead ends: 124 [2019-11-15 22:54:38,819 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-11-15 22:54:38,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-15 22:54:38,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 109. [2019-11-15 22:54:38,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-15 22:54:38,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2019-11-15 22:54:38,826 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 19 [2019-11-15 22:54:38,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:54:38,827 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2019-11-15 22:54:38,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 22:54:38,827 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2019-11-15 22:54:38,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 22:54:38,830 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:54:38,830 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:54:38,832 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:54:38,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:38,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1148521791, now seen corresponding path program 1 times [2019-11-15 22:54:38,834 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:54:38,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991785769] [2019-11-15 22:54:38,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:38,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:38,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:54:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:38,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:38,974 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991785769] [2019-11-15 22:54:38,975 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:54:38,975 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:54:38,975 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160125375] [2019-11-15 22:54:38,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:54:38,976 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:54:38,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:54:38,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:54:38,976 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand 6 states. [2019-11-15 22:54:39,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:54:39,288 INFO L93 Difference]: Finished difference Result 120 states and 137 transitions. [2019-11-15 22:54:39,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:54:39,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-15 22:54:39,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:54:39,290 INFO L225 Difference]: With dead ends: 120 [2019-11-15 22:54:39,290 INFO L226 Difference]: Without dead ends: 120 [2019-11-15 22:54:39,291 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:54:39,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-15 22:54:39,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 115. [2019-11-15 22:54:39,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-15 22:54:39,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2019-11-15 22:54:39,295 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 20 [2019-11-15 22:54:39,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:54:39,296 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2019-11-15 22:54:39,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:54:39,296 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2019-11-15 22:54:39,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 22:54:39,297 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:54:39,298 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:54:39,298 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:54:39,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:39,299 INFO L82 PathProgramCache]: Analyzing trace with hash 2005762767, now seen corresponding path program 1 times [2019-11-15 22:54:39,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:54:39,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046303711] [2019-11-15 22:54:39,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:39,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:39,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:54:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:39,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046303711] [2019-11-15 22:54:39,429 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:54:39,429 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:54:39,429 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734881209] [2019-11-15 22:54:39,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:54:39,430 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:54:39,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:54:39,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:54:39,430 INFO L87 Difference]: Start difference. First operand 115 states and 132 transitions. Second operand 7 states. [2019-11-15 22:54:39,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:54:39,892 INFO L93 Difference]: Finished difference Result 177 states and 199 transitions. [2019-11-15 22:54:39,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:54:39,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-15 22:54:39,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:54:39,894 INFO L225 Difference]: With dead ends: 177 [2019-11-15 22:54:39,894 INFO L226 Difference]: Without dead ends: 177 [2019-11-15 22:54:39,895 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:54:39,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-15 22:54:39,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 126. [2019-11-15 22:54:39,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-15 22:54:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 147 transitions. [2019-11-15 22:54:39,914 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 147 transitions. Word has length 23 [2019-11-15 22:54:39,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:54:39,914 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 147 transitions. [2019-11-15 22:54:39,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:54:39,915 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 147 transitions. [2019-11-15 22:54:39,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 22:54:39,916 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:54:39,916 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-15 22:54:39,917 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:54:39,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:39,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1697020642, now seen corresponding path program 1 times [2019-11-15 22:54:39,917 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:54:39,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389609555] [2019-11-15 22:54:39,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:39,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:39,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:54:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:40,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389609555] [2019-11-15 22:54:40,081 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662239170] [2019-11-15 22:54:40,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:54:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:40,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 22:54:40,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:54:40,397 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:40,398 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 22:54:40,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:40,421 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-15 22:54:40,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:54:40,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2019-11-15 22:54:40,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:54:40,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:40,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:40,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:54:40,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2019-11-15 22:54:40,528 INFO L341 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-11-15 22:54:40,529 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 31 treesize of output 26 [2019-11-15 22:54:40,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:40,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:40,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:54:40,542 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-11-15 22:54:40,612 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-15 22:54:40,613 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 34 treesize of output 16 [2019-11-15 22:54:40,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:40,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:40,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:54:40,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:15 [2019-11-15 22:54:40,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:40,718 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:54:40,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-15 22:54:40,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915113983] [2019-11-15 22:54:40,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 22:54:40,720 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:54:40,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 22:54:40,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:54:40,721 INFO L87 Difference]: Start difference. First operand 126 states and 147 transitions. Second operand 15 states. [2019-11-15 22:54:41,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:54:41,567 INFO L93 Difference]: Finished difference Result 172 states and 195 transitions. [2019-11-15 22:54:41,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 22:54:41,567 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2019-11-15 22:54:41,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:54:41,569 INFO L225 Difference]: With dead ends: 172 [2019-11-15 22:54:41,569 INFO L226 Difference]: Without dead ends: 172 [2019-11-15 22:54:41,569 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2019-11-15 22:54:41,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-15 22:54:41,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 129. [2019-11-15 22:54:41,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-15 22:54:41,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 151 transitions. [2019-11-15 22:54:41,574 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 151 transitions. Word has length 24 [2019-11-15 22:54:41,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:54:41,575 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 151 transitions. [2019-11-15 22:54:41,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 22:54:41,575 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 151 transitions. [2019-11-15 22:54:41,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 22:54:41,576 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:54:41,577 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-15 22:54:41,784 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:54:41,785 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:54:41,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:41,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1697020641, now seen corresponding path program 1 times [2019-11-15 22:54:41,785 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:54:41,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369649957] [2019-11-15 22:54:41,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:41,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:41,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:54:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:41,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:41,970 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369649957] [2019-11-15 22:54:41,970 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858597675] [2019-11-15 22:54:41,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:54:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:42,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-15 22:54:42,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:54:42,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:54:42,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-15 22:54:42,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:42,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:42,222 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:42,223 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:54:42,224 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:42,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:42,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:54:42,239 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-15 22:54:42,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:54:42,287 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:42,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:42,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:54:42,313 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:42,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:42,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:54:42,328 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:38 [2019-11-15 22:54:42,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:54:42,371 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 37 treesize of output 32 [2019-11-15 22:54:42,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:42,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:42,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:54:42,395 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 38 treesize of output 33 [2019-11-15 22:54:42,396 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:42,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:42,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:54:42,413 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:56 [2019-11-15 22:54:42,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:54:42,495 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 40 treesize of output 22 [2019-11-15 22:54:42,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:42,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:42,515 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-15 22:54:42,515 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 1 case distinctions, treesize of input 37 treesize of output 19 [2019-11-15 22:54:42,516 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:42,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:42,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:54:42,532 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:22 [2019-11-15 22:54:42,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:42,594 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:54:42,594 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2019-11-15 22:54:42,595 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805789503] [2019-11-15 22:54:42,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 22:54:42,595 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:54:42,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 22:54:42,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:54:42,596 INFO L87 Difference]: Start difference. First operand 129 states and 151 transitions. Second operand 17 states. [2019-11-15 22:54:43,447 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2019-11-15 22:54:44,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:54:44,377 INFO L93 Difference]: Finished difference Result 202 states and 224 transitions. [2019-11-15 22:54:44,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 22:54:44,378 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2019-11-15 22:54:44,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:54:44,379 INFO L225 Difference]: With dead ends: 202 [2019-11-15 22:54:44,380 INFO L226 Difference]: Without dead ends: 202 [2019-11-15 22:54:44,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756 [2019-11-15 22:54:44,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-15 22:54:44,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 128. [2019-11-15 22:54:44,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-15 22:54:44,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 149 transitions. [2019-11-15 22:54:44,390 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 149 transitions. Word has length 24 [2019-11-15 22:54:44,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:54:44,390 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 149 transitions. [2019-11-15 22:54:44,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 22:54:44,391 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 149 transitions. [2019-11-15 22:54:44,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 22:54:44,398 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:54:44,401 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] [2019-11-15 22:54:44,604 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:54:44,604 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:54:44,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:44,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1069663173, now seen corresponding path program 1 times [2019-11-15 22:54:44,605 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:54:44,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321064080] [2019-11-15 22:54:44,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:44,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:44,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:54:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:44,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:44,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321064080] [2019-11-15 22:54:44,748 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:54:44,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:54:44,749 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770354429] [2019-11-15 22:54:44,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:54:44,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:54:44,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:54:44,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:54:44,750 INFO L87 Difference]: Start difference. First operand 128 states and 149 transitions. Second operand 9 states. [2019-11-15 22:54:45,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:54:45,245 INFO L93 Difference]: Finished difference Result 170 states and 194 transitions. [2019-11-15 22:54:45,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:54:45,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-15 22:54:45,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:54:45,247 INFO L225 Difference]: With dead ends: 170 [2019-11-15 22:54:45,248 INFO L226 Difference]: Without dead ends: 170 [2019-11-15 22:54:45,248 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:54:45,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-15 22:54:45,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 132. [2019-11-15 22:54:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-15 22:54:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 155 transitions. [2019-11-15 22:54:45,254 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 155 transitions. Word has length 25 [2019-11-15 22:54:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:54:45,255 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 155 transitions. [2019-11-15 22:54:45,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:54:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 155 transitions. [2019-11-15 22:54:45,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 22:54:45,256 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:54:45,256 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] [2019-11-15 22:54:45,257 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:54:45,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:45,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1069663172, now seen corresponding path program 1 times [2019-11-15 22:54:45,258 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:54:45,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043733479] [2019-11-15 22:54:45,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:45,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:45,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:54:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:45,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043733479] [2019-11-15 22:54:45,451 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:54:45,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:54:45,451 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813554438] [2019-11-15 22:54:45,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:54:45,451 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:54:45,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:54:45,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:54:45,453 INFO L87 Difference]: Start difference. First operand 132 states and 155 transitions. Second operand 9 states. [2019-11-15 22:54:46,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:54:46,234 INFO L93 Difference]: Finished difference Result 200 states and 222 transitions. [2019-11-15 22:54:46,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:54:46,235 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-15 22:54:46,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:54:46,236 INFO L225 Difference]: With dead ends: 200 [2019-11-15 22:54:46,237 INFO L226 Difference]: Without dead ends: 200 [2019-11-15 22:54:46,237 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:54:46,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-11-15 22:54:46,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 134. [2019-11-15 22:54:46,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-15 22:54:46,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2019-11-15 22:54:46,244 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 25 [2019-11-15 22:54:46,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:54:46,244 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2019-11-15 22:54:46,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:54:46,244 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2019-11-15 22:54:46,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 22:54:46,245 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:54:46,245 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] [2019-11-15 22:54:46,246 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:54:46,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:46,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1973955135, now seen corresponding path program 1 times [2019-11-15 22:54:46,247 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:54:46,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622575421] [2019-11-15 22:54:46,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:46,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:46,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:54:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:46,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622575421] [2019-11-15 22:54:46,311 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:54:46,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:54:46,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216086227] [2019-11-15 22:54:46,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:54:46,314 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:54:46,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:54:46,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:54:46,315 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand 5 states. [2019-11-15 22:54:46,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:54:46,562 INFO L93 Difference]: Finished difference Result 162 states and 182 transitions. [2019-11-15 22:54:46,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:54:46,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-15 22:54:46,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:54:46,564 INFO L225 Difference]: With dead ends: 162 [2019-11-15 22:54:46,564 INFO L226 Difference]: Without dead ends: 162 [2019-11-15 22:54:46,565 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:54:46,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-15 22:54:46,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 134. [2019-11-15 22:54:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-15 22:54:46,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 155 transitions. [2019-11-15 22:54:46,570 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 155 transitions. Word has length 28 [2019-11-15 22:54:46,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:54:46,570 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 155 transitions. [2019-11-15 22:54:46,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:54:46,571 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 155 transitions. [2019-11-15 22:54:46,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 22:54:46,571 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:54:46,572 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:54:46,572 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:54:46,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:46,572 INFO L82 PathProgramCache]: Analyzing trace with hash -631022956, now seen corresponding path program 2 times [2019-11-15 22:54:46,572 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:54:46,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8005078] [2019-11-15 22:54:46,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:46,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:46,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:54:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:46,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:54:46,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8005078] [2019-11-15 22:54:46,771 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:54:46,771 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:54:46,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909644706] [2019-11-15 22:54:46,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:54:46,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:54:46,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:54:46,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:54:46,772 INFO L87 Difference]: Start difference. First operand 134 states and 155 transitions. Second operand 9 states. [2019-11-15 22:54:47,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:54:47,432 INFO L93 Difference]: Finished difference Result 170 states and 189 transitions. [2019-11-15 22:54:47,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:54:47,433 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-11-15 22:54:47,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:54:47,435 INFO L225 Difference]: With dead ends: 170 [2019-11-15 22:54:47,435 INFO L226 Difference]: Without dead ends: 170 [2019-11-15 22:54:47,435 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:54:47,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-15 22:54:47,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 132. [2019-11-15 22:54:47,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-15 22:54:47,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 152 transitions. [2019-11-15 22:54:47,440 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 152 transitions. Word has length 28 [2019-11-15 22:54:47,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:54:47,441 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 152 transitions. [2019-11-15 22:54:47,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:54:47,441 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 152 transitions. [2019-11-15 22:54:47,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 22:54:47,442 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:54:47,442 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] [2019-11-15 22:54:47,442 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:54:47,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:47,443 INFO L82 PathProgramCache]: Analyzing trace with hash 99255680, now seen corresponding path program 1 times [2019-11-15 22:54:47,443 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:54:47,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975109421] [2019-11-15 22:54:47,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:47,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:47,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:54:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:47,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975109421] [2019-11-15 22:54:47,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:54:47,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:54:47,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337783568] [2019-11-15 22:54:47,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:54:47,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:54:47,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:54:47,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:54:47,692 INFO L87 Difference]: Start difference. First operand 132 states and 152 transitions. Second operand 9 states. [2019-11-15 22:54:48,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:54:48,167 INFO L93 Difference]: Finished difference Result 188 states and 208 transitions. [2019-11-15 22:54:48,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:54:48,167 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-11-15 22:54:48,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:54:48,169 INFO L225 Difference]: With dead ends: 188 [2019-11-15 22:54:48,169 INFO L226 Difference]: Without dead ends: 188 [2019-11-15 22:54:48,169 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:54:48,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-15 22:54:48,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 136. [2019-11-15 22:54:48,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-15 22:54:48,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 156 transitions. [2019-11-15 22:54:48,173 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 156 transitions. Word has length 28 [2019-11-15 22:54:48,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:54:48,174 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 156 transitions. [2019-11-15 22:54:48,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:54:48,174 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2019-11-15 22:54:48,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 22:54:48,175 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:54:48,175 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] [2019-11-15 22:54:48,175 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:54:48,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:48,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1219672039, now seen corresponding path program 1 times [2019-11-15 22:54:48,176 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:54:48,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011784035] [2019-11-15 22:54:48,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:48,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:48,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:54:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:48,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011784035] [2019-11-15 22:54:48,375 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:54:48,376 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-15 22:54:48,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853410985] [2019-11-15 22:54:48,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 22:54:48,378 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:54:48,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 22:54:48,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:54:48,379 INFO L87 Difference]: Start difference. First operand 136 states and 156 transitions. Second operand 12 states. [2019-11-15 22:54:49,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:54:49,490 INFO L93 Difference]: Finished difference Result 173 states and 191 transitions. [2019-11-15 22:54:49,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 22:54:49,491 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2019-11-15 22:54:49,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:54:49,493 INFO L225 Difference]: With dead ends: 173 [2019-11-15 22:54:49,493 INFO L226 Difference]: Without dead ends: 173 [2019-11-15 22:54:49,493 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:54:49,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-15 22:54:49,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 142. [2019-11-15 22:54:49,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-15 22:54:49,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 162 transitions. [2019-11-15 22:54:49,499 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 162 transitions. Word has length 29 [2019-11-15 22:54:49,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:54:49,499 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 162 transitions. [2019-11-15 22:54:49,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 22:54:49,499 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 162 transitions. [2019-11-15 22:54:49,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 22:54:49,503 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:54:49,503 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-15 22:54:49,505 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:54:49,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:49,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1406114565, now seen corresponding path program 1 times [2019-11-15 22:54:49,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:54:49,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958914333] [2019-11-15 22:54:49,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:49,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:49,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:54:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:49,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:49,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958914333] [2019-11-15 22:54:49,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:54:49,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:54:49,613 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627142002] [2019-11-15 22:54:49,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:54:49,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:54:49,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:54:49,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:54:49,616 INFO L87 Difference]: Start difference. First operand 142 states and 162 transitions. Second operand 8 states. [2019-11-15 22:54:50,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:54:50,197 INFO L93 Difference]: Finished difference Result 186 states and 204 transitions. [2019-11-15 22:54:50,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:54:50,198 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-11-15 22:54:50,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:54:50,199 INFO L225 Difference]: With dead ends: 186 [2019-11-15 22:54:50,199 INFO L226 Difference]: Without dead ends: 186 [2019-11-15 22:54:50,200 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:54:50,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-15 22:54:50,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 142. [2019-11-15 22:54:50,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-15 22:54:50,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 161 transitions. [2019-11-15 22:54:50,203 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 161 transitions. Word has length 30 [2019-11-15 22:54:50,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:54:50,204 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 161 transitions. [2019-11-15 22:54:50,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:54:50,204 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 161 transitions. [2019-11-15 22:54:50,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 22:54:50,205 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:54:50,205 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:54:50,206 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:54:50,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:50,206 INFO L82 PathProgramCache]: Analyzing trace with hash -2047125898, now seen corresponding path program 1 times [2019-11-15 22:54:50,206 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:54:50,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469658190] [2019-11-15 22:54:50,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:50,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:50,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:54:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:50,497 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-15 22:54:50,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469658190] [2019-11-15 22:54:50,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312778113] [2019-11-15 22:54:50,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:54:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:50,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-15 22:54:50,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:54:50,680 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:54:50,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:50,705 INFO L567 ElimStorePlain]: treesize reduction 3, result has 90.0 percent of original size [2019-11-15 22:54:50,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:54:50,712 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:50,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:50,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:54:50,720 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2019-11-15 22:54:50,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:54:50,756 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-15 22:54:50,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:50,787 INFO L567 ElimStorePlain]: treesize reduction 5, result has 90.0 percent of original size [2019-11-15 22:54:50,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:54:50,792 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-15 22:54:50,793 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:50,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:50,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:54:50,805 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:41 [2019-11-15 22:54:50,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:54:50,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:54:50,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:54:50,850 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 36 treesize of output 23 [2019-11-15 22:54:50,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:50,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:50,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:54:50,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:54:50,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:54:50,876 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 36 treesize of output 23 [2019-11-15 22:54:50,876 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:50,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:50,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:54:50,890 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:41 [2019-11-15 22:54:50,908 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:50,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:54:50,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:50,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:50,925 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:54:50,925 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:40 [2019-11-15 22:54:50,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:54:50,983 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 36 treesize of output 23 [2019-11-15 22:54:50,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:51,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:51,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:54:51,008 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 36 treesize of output 23 [2019-11-15 22:54:51,009 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:51,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:51,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:54:51,029 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:40 [2019-11-15 22:54:51,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-11-15 22:54:51,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:51,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:51,073 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-11-15 22:54:51,074 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:51,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:51,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:54:51,097 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:60 [2019-11-15 22:54:51,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:54:51,216 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:51,216 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 138 [2019-11-15 22:54:51,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:51,275 INFO L567 ElimStorePlain]: treesize reduction 120, result has 40.6 percent of original size [2019-11-15 22:54:51,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:54:51,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2019-11-15 22:54:51,281 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:51,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:51,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:54:51,298 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:78 [2019-11-15 22:54:51,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:54:51,731 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:51,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 100 treesize of output 138 [2019-11-15 22:54:51,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:54:51,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:54:51,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:54:51,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:54:51,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:54:51,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:54:51,740 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:54:51,788 INFO L567 ElimStorePlain]: treesize reduction 40, result has 57.0 percent of original size [2019-11-15 22:54:51,809 INFO L341 Elim1Store]: treesize reduction 10, result has 63.0 percent of original size [2019-11-15 22:54:51,810 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 35 [2019-11-15 22:54:51,810 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:51,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:51,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:54:51,826 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:116, output treesize:7 [2019-11-15 22:54:51,834 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-15 22:54:51,834 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:54:51,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2019-11-15 22:54:51,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99750421] [2019-11-15 22:54:51,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 22:54:51,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:54:51,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 22:54:51,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-11-15 22:54:51,836 INFO L87 Difference]: Start difference. First operand 142 states and 161 transitions. Second operand 22 states. [2019-11-15 22:54:53,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:54:53,762 INFO L93 Difference]: Finished difference Result 183 states and 203 transitions. [2019-11-15 22:54:53,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 22:54:53,763 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-11-15 22:54:53,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:54:53,764 INFO L225 Difference]: With dead ends: 183 [2019-11-15 22:54:53,765 INFO L226 Difference]: Without dead ends: 183 [2019-11-15 22:54:53,765 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 22:54:53,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-15 22:54:53,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 156. [2019-11-15 22:54:53,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-15 22:54:53,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2019-11-15 22:54:53,771 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 30 [2019-11-15 22:54:53,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:54:53,772 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2019-11-15 22:54:53,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 22:54:53,772 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2019-11-15 22:54:53,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 22:54:53,773 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:54:53,773 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:54:53,974 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:54:53,974 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:54:53,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:53,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1798526450, now seen corresponding path program 1 times [2019-11-15 22:54:53,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:54:53,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423819157] [2019-11-15 22:54:53,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:53,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:53,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:54:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:54,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:54,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423819157] [2019-11-15 22:54:54,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179689606] [2019-11-15 22:54:54,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:54:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:54,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-15 22:54:54,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:54:54,516 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:54,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 22:54:54,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:54,558 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-15 22:54:54,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:54:54,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-15 22:54:54,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:54:54,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:54,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:54,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:54:54,634 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-11-15 22:54:54,722 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:54,723 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 57 [2019-11-15 22:54:54,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:54:54,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:54:54,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:54:54,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 22:54:54,771 INFO L567 ElimStorePlain]: treesize reduction 136, result has 24.0 percent of original size [2019-11-15 22:54:54,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:54:54,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2019-11-15 22:54:55,013 INFO L341 Elim1Store]: treesize reduction 52, result has 50.5 percent of original size [2019-11-15 22:54:55,014 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 71 [2019-11-15 22:54:55,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:55,055 INFO L567 ElimStorePlain]: treesize reduction 24, result has 61.9 percent of original size [2019-11-15 22:54:55,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:54:55,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:22 [2019-11-15 22:54:55,114 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:55,114 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2019-11-15 22:54:55,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:54:55,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:55,135 INFO L567 ElimStorePlain]: treesize reduction 20, result has 63.0 percent of original size [2019-11-15 22:54:55,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:54:55,135 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2019-11-15 22:54:55,238 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:55,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-11-15 22:54:55,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:55,253 INFO L567 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2019-11-15 22:54:55,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:54:55,254 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2019-11-15 22:54:55,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:55,319 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:54:55,320 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2019-11-15 22:54:55,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987032251] [2019-11-15 22:54:55,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-15 22:54:55,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:54:55,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-15 22:54:55,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2019-11-15 22:54:55,325 INFO L87 Difference]: Start difference. First operand 156 states and 175 transitions. Second operand 26 states. [2019-11-15 22:54:56,056 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2019-11-15 22:54:58,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:54:58,090 INFO L93 Difference]: Finished difference Result 238 states and 264 transitions. [2019-11-15 22:54:58,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-15 22:54:58,091 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 30 [2019-11-15 22:54:58,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:54:58,092 INFO L225 Difference]: With dead ends: 238 [2019-11-15 22:54:58,093 INFO L226 Difference]: Without dead ends: 238 [2019-11-15 22:54:58,094 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=482, Invalid=1870, Unknown=0, NotChecked=0, Total=2352 [2019-11-15 22:54:58,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-11-15 22:54:58,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 174. [2019-11-15 22:54:58,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-15 22:54:58,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 198 transitions. [2019-11-15 22:54:58,100 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 198 transitions. Word has length 30 [2019-11-15 22:54:58,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:54:58,101 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 198 transitions. [2019-11-15 22:54:58,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-15 22:54:58,101 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 198 transitions. [2019-11-15 22:54:58,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 22:54:58,102 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:54:58,102 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:54:58,307 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:54:58,307 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:54:58,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:54:58,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1798526451, now seen corresponding path program 1 times [2019-11-15 22:54:58,308 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:54:58,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812364069] [2019-11-15 22:54:58,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:58,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:54:58,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:54:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:58,591 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812364069] [2019-11-15 22:54:58,591 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458534944] [2019-11-15 22:54:58,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:54:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:54:58,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-15 22:54:58,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:54:58,742 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_66|], 1=[|v_#valid_78|]} [2019-11-15 22:54:58,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 22:54:58,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:58,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:58,787 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:58,787 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:54:58,788 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:58,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:58,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:54:58,807 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-15 22:54:58,827 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:54:58,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:58,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:58,851 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:54:58,851 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:58,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:58,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:54:58,870 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-11-15 22:54:58,953 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:58,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 70 [2019-11-15 22:54:58,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:54:58,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:58,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:58,985 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 29 treesize of output 24 [2019-11-15 22:54:58,986 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:59,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:59,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:54:59,006 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2019-11-15 22:54:59,234 INFO L341 Elim1Store]: treesize reduction 52, result has 50.5 percent of original size [2019-11-15 22:54:59,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 80 [2019-11-15 22:54:59,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:59,297 INFO L567 ElimStorePlain]: treesize reduction 24, result has 74.2 percent of original size [2019-11-15 22:54:59,317 INFO L341 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2019-11-15 22:54:59,317 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 36 treesize of output 31 [2019-11-15 22:54:59,317 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:59,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:59,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:54:59,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:54:59,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:54:59,339 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:24 [2019-11-15 22:54:59,414 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 62 [2019-11-15 22:54:59,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:54:59,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:54:59,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 22:54:59,476 INFO L567 ElimStorePlain]: treesize reduction 108, result has 34.1 percent of original size [2019-11-15 22:54:59,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2019-11-15 22:54:59,481 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:59,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:59,497 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:54:59,498 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2019-11-15 22:54:59,690 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:59,691 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2019-11-15 22:54:59,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:59,723 INFO L567 ElimStorePlain]: treesize reduction 12, result has 72.1 percent of original size [2019-11-15 22:54:59,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:54:59,729 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:54:59,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:54:59,743 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:54:59,743 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2019-11-15 22:54:59,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:54:59,752 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:54:59,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2019-11-15 22:54:59,753 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607939840] [2019-11-15 22:54:59,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 22:54:59,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:54:59,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 22:54:59,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2019-11-15 22:54:59,754 INFO L87 Difference]: Start difference. First operand 174 states and 198 transitions. Second operand 22 states. [2019-11-15 22:55:02,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:02,293 INFO L93 Difference]: Finished difference Result 255 states and 284 transitions. [2019-11-15 22:55:02,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 22:55:02,296 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-11-15 22:55:02,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:02,298 INFO L225 Difference]: With dead ends: 255 [2019-11-15 22:55:02,298 INFO L226 Difference]: Without dead ends: 255 [2019-11-15 22:55:02,299 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=229, Invalid=1251, Unknown=2, NotChecked=0, Total=1482 [2019-11-15 22:55:02,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-15 22:55:02,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 187. [2019-11-15 22:55:02,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-15 22:55:02,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 213 transitions. [2019-11-15 22:55:02,306 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 213 transitions. Word has length 30 [2019-11-15 22:55:02,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:02,308 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 213 transitions. [2019-11-15 22:55:02,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 22:55:02,308 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 213 transitions. [2019-11-15 22:55:02,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 22:55:02,309 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:02,310 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-15 22:55:02,516 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:55:02,516 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:55:02,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:02,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1371321881, now seen corresponding path program 1 times [2019-11-15 22:55:02,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:02,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116012769] [2019-11-15 22:55:02,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:02,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:02,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:02,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:55:02,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116012769] [2019-11-15 22:55:02,607 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:55:02,607 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:55:02,607 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350516901] [2019-11-15 22:55:02,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:55:02,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:02,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:55:02,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:55:02,609 INFO L87 Difference]: Start difference. First operand 187 states and 213 transitions. Second operand 5 states. [2019-11-15 22:55:02,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:02,941 INFO L93 Difference]: Finished difference Result 201 states and 227 transitions. [2019-11-15 22:55:02,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:55:02,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-15 22:55:02,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:02,943 INFO L225 Difference]: With dead ends: 201 [2019-11-15 22:55:02,944 INFO L226 Difference]: Without dead ends: 201 [2019-11-15 22:55:02,944 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:55:02,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-11-15 22:55:02,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 188. [2019-11-15 22:55:02,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-15 22:55:02,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 214 transitions. [2019-11-15 22:55:02,953 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 214 transitions. Word has length 34 [2019-11-15 22:55:02,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:02,953 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 214 transitions. [2019-11-15 22:55:02,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:55:02,953 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 214 transitions. [2019-11-15 22:55:02,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 22:55:02,954 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:02,954 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] [2019-11-15 22:55:02,954 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:55:02,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:02,955 INFO L82 PathProgramCache]: Analyzing trace with hash 79566448, now seen corresponding path program 1 times [2019-11-15 22:55:02,955 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:02,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642434464] [2019-11-15 22:55:02,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:02,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:02,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:03,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:55:03,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642434464] [2019-11-15 22:55:03,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039206002] [2019-11-15 22:55:03,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:55:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:03,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-15 22:55:03,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:55:03,575 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:03,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 22:55:03,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:03,603 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-15 22:55:03,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:55:03,603 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-15 22:55:03,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:55:03,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:03,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:03,665 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:55:03,665 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:03,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:03,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:55:03,680 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2019-11-15 22:55:03,783 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:03,784 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 70 [2019-11-15 22:55:03,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:03,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:55:03,861 INFO L567 ElimStorePlain]: treesize reduction 52, result has 58.7 percent of original size [2019-11-15 22:55:03,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2019-11-15 22:55:03,869 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:03,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:03,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:55:03,889 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:65 [2019-11-15 22:55:03,951 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 28 treesize of output 10 [2019-11-15 22:55:03,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:03,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:03,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:55:03,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:42 [2019-11-15 22:55:04,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:55:04,095 INFO L341 Elim1Store]: treesize reduction 28, result has 56.3 percent of original size [2019-11-15 22:55:04,095 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 50 treesize of output 58 [2019-11-15 22:55:04,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:04,166 INFO L567 ElimStorePlain]: treesize reduction 22, result has 72.5 percent of original size [2019-11-15 22:55:04,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:55:04,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:50 [2019-11-15 22:55:04,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:04,243 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_57|], 10=[|v_#memory_$Pointer$.base_64|]} [2019-11-15 22:55:04,252 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2019-11-15 22:55:04,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:04,260 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 61 treesize of output 57 [2019-11-15 22:55:04,260 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:04,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:04,326 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:04,326 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 58 [2019-11-15 22:55:04,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:04,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:04,328 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:04,377 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:04,378 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 114 [2019-11-15 22:55:04,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:04,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:04,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:04,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:55:04,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:04,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:04,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:04,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:55:04,384 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:55:04,484 INFO L567 ElimStorePlain]: treesize reduction 104, result has 49.5 percent of original size [2019-11-15 22:55:04,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:04,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-15 22:55:04,486 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:126, output treesize:101 [2019-11-15 22:55:04,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:04,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:04,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:04,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:04,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:05,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:55:05,119 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:55:05,120 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2019-11-15 22:55:05,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:05,141 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:05,141 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 67 treesize of output 67 [2019-11-15 22:55:05,142 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:05,149 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 62 treesize of output 50 [2019-11-15 22:55:05,150 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:05,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:05,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:05,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-15 22:55:05,238 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:185, output treesize:150 [2019-11-15 22:55:05,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:05,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:55:05,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:05,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:05,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:05,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:05,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:05,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:05,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:05,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:05,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:05,551 INFO L392 ElimStorePlain]: Different costs {1=[|#memory_$Pointer$.base|], 5=[v_prenex_3]} [2019-11-15 22:55:05,563 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:05,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 32 [2019-11-15 22:55:05,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:05,616 INFO L567 ElimStorePlain]: treesize reduction 8, result has 89.7 percent of original size [2019-11-15 22:55:05,638 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:05,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 59 [2019-11-15 22:55:05,639 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:05,705 INFO L567 ElimStorePlain]: treesize reduction 14, result has 77.8 percent of original size [2019-11-15 22:55:05,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:05,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-15 22:55:05,707 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:96, output treesize:49 [2019-11-15 22:55:05,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:05,812 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:05,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-11-15 22:55:05,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:05,843 INFO L567 ElimStorePlain]: treesize reduction 28, result has 50.0 percent of original size [2019-11-15 22:55:05,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:55:05,844 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:28 [2019-11-15 22:55:05,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:55:05,904 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:55:05,904 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 30 [2019-11-15 22:55:05,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706281594] [2019-11-15 22:55:05,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-15 22:55:05,905 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:05,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-15 22:55:05,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2019-11-15 22:55:05,907 INFO L87 Difference]: Start difference. First operand 188 states and 214 transitions. Second operand 31 states. [2019-11-15 22:55:07,367 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2019-11-15 22:55:07,794 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 74 [2019-11-15 22:55:08,067 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2019-11-15 22:55:08,282 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 67 [2019-11-15 22:55:08,515 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2019-11-15 22:55:08,759 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 81 [2019-11-15 22:55:08,985 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 70 [2019-11-15 22:55:09,398 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2019-11-15 22:55:11,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:11,037 INFO L93 Difference]: Finished difference Result 339 states and 379 transitions. [2019-11-15 22:55:11,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-11-15 22:55:11,037 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 34 [2019-11-15 22:55:11,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:11,039 INFO L225 Difference]: With dead ends: 339 [2019-11-15 22:55:11,039 INFO L226 Difference]: Without dead ends: 339 [2019-11-15 22:55:11,041 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=622, Invalid=3284, Unknown=0, NotChecked=0, Total=3906 [2019-11-15 22:55:11,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-11-15 22:55:11,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 194. [2019-11-15 22:55:11,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-15 22:55:11,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 222 transitions. [2019-11-15 22:55:11,048 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 222 transitions. Word has length 34 [2019-11-15 22:55:11,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:11,048 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 222 transitions. [2019-11-15 22:55:11,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-15 22:55:11,049 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 222 transitions. [2019-11-15 22:55:11,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 22:55:11,049 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:11,050 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] [2019-11-15 22:55:11,250 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:55:11,251 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:55:11,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:11,251 INFO L82 PathProgramCache]: Analyzing trace with hash 79566449, now seen corresponding path program 1 times [2019-11-15 22:55:11,251 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:11,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912774585] [2019-11-15 22:55:11,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:11,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:11,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:11,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:55:11,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912774585] [2019-11-15 22:55:11,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153019993] [2019-11-15 22:55:11,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:55:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:11,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 54 conjunts are in the unsatisfiable core [2019-11-15 22:55:11,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:55:11,873 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_67|], 3=[|v_#valid_81|]} [2019-11-15 22:55:11,876 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 22:55:11,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:11,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:11,910 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:11,910 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 22:55:11,911 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:11,949 INFO L567 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2019-11-15 22:55:11,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:55:11,949 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2019-11-15 22:55:11,995 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:55:11,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:12,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:12,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:55:12,022 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:12,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:12,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:55:12,042 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:48 [2019-11-15 22:55:12,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2019-11-15 22:55:12,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:12,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:12,215 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:12,216 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 71 [2019-11-15 22:55:12,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:55:12,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:12,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:12,218 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 22:55:12,293 INFO L567 ElimStorePlain]: treesize reduction 208, result has 26.5 percent of original size [2019-11-15 22:55:12,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:55:12,294 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:90, output treesize:74 [2019-11-15 22:55:12,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:55:12,528 INFO L341 Elim1Store]: treesize reduction 28, result has 56.3 percent of original size [2019-11-15 22:55:12,529 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 79 treesize of output 75 [2019-11-15 22:55:12,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:12,598 INFO L567 ElimStorePlain]: treesize reduction 30, result has 78.4 percent of original size [2019-11-15 22:55:12,618 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:12,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 66 [2019-11-15 22:55:12,619 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:12,682 INFO L567 ElimStorePlain]: treesize reduction 28, result has 77.0 percent of original size [2019-11-15 22:55:12,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:12,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:12,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:55:12,684 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:120, output treesize:52 [2019-11-15 22:55:12,768 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:12,768 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 59 [2019-11-15 22:55:12,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:12,769 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:12,806 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.8 percent of original size [2019-11-15 22:55:12,811 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 27 treesize of output 22 [2019-11-15 22:55:12,811 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:12,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:12,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:55:12,829 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:64 [2019-11-15 22:55:13,001 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:13,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 39 [2019-11-15 22:55:13,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:13,048 INFO L567 ElimStorePlain]: treesize reduction 8, result has 83.7 percent of original size [2019-11-15 22:55:13,052 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:55:13,052 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:13,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:13,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:55:13,066 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:23 [2019-11-15 22:55:13,150 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_68|], 3=[|v_#valid_82|]} [2019-11-15 22:55:13,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:55:13,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 22:55:13,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:13,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:13,212 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:13,213 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-15 22:55:13,213 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:13,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:13,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:55:13,225 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:18 [2019-11-15 22:55:13,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:55:13,282 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:55:13,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2019-11-15 22:55:13,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635195296] [2019-11-15 22:55:13,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-15 22:55:13,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:13,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-15 22:55:13,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-11-15 22:55:13,284 INFO L87 Difference]: Start difference. First operand 194 states and 222 transitions. Second operand 29 states. [2019-11-15 22:55:15,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:15,954 INFO L93 Difference]: Finished difference Result 312 states and 347 transitions. [2019-11-15 22:55:15,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-15 22:55:15,955 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 34 [2019-11-15 22:55:15,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:15,957 INFO L225 Difference]: With dead ends: 312 [2019-11-15 22:55:15,957 INFO L226 Difference]: Without dead ends: 312 [2019-11-15 22:55:15,958 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=337, Invalid=1555, Unknown=0, NotChecked=0, Total=1892 [2019-11-15 22:55:15,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-15 22:55:15,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 197. [2019-11-15 22:55:15,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-15 22:55:15,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 224 transitions. [2019-11-15 22:55:15,964 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 224 transitions. Word has length 34 [2019-11-15 22:55:15,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:15,964 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 224 transitions. [2019-11-15 22:55:15,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-15 22:55:15,964 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 224 transitions. [2019-11-15 22:55:15,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 22:55:15,965 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:15,965 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:55:16,169 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:55:16,170 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:55:16,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:16,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1208161322, now seen corresponding path program 2 times [2019-11-15 22:55:16,171 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:16,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525986987] [2019-11-15 22:55:16,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:16,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:16,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:16,538 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:55:16,538 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525986987] [2019-11-15 22:55:16,539 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995224761] [2019-11-15 22:55:16,539 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:55:16,701 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:55:16,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:55:16,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-15 22:55:16,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:55:16,794 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:16,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:55:16,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:16,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:16,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:55:16,803 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-15 22:55:16,836 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:55:16,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:16,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:16,846 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:55:16,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2019-11-15 22:55:16,965 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:16,966 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 52 [2019-11-15 22:55:16,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:55:16,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:16,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:16,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 22:55:17,041 INFO L567 ElimStorePlain]: treesize reduction 108, result has 22.9 percent of original size [2019-11-15 22:55:17,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:55:17,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2019-11-15 22:55:17,278 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_62|], 6=[|v_#memory_$Pointer$.base_71|]} [2019-11-15 22:55:17,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:55:17,289 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 27 treesize of output 11 [2019-11-15 22:55:17,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:17,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:17,427 INFO L341 Elim1Store]: treesize reduction 52, result has 50.5 percent of original size [2019-11-15 22:55:17,427 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 66 [2019-11-15 22:55:17,428 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:17,476 INFO L567 ElimStorePlain]: treesize reduction 24, result has 61.9 percent of original size [2019-11-15 22:55:17,477 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:55:17,477 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:77, output treesize:22 [2019-11-15 22:55:17,591 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:17,591 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 73 [2019-11-15 22:55:17,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:55:17,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:17,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 22:55:17,639 INFO L567 ElimStorePlain]: treesize reduction 110, result has 31.7 percent of original size [2019-11-15 22:55:17,647 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2019-11-15 22:55:17,647 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:17,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:17,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:55:17,665 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:42 [2019-11-15 22:55:17,990 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:17,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 52 [2019-11-15 22:55:17,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:17,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:17,993 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:55:18,015 INFO L567 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2019-11-15 22:55:18,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-11-15 22:55:18,019 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:18,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:18,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:55:18,025 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:7 [2019-11-15 22:55:18,031 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:55:18,031 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:55:18,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2019-11-15 22:55:18,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856119404] [2019-11-15 22:55:18,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-15 22:55:18,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:18,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-15 22:55:18,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=779, Unknown=0, NotChecked=0, Total=870 [2019-11-15 22:55:18,034 INFO L87 Difference]: Start difference. First operand 197 states and 224 transitions. Second operand 30 states. [2019-11-15 22:55:19,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:19,703 INFO L93 Difference]: Finished difference Result 225 states and 248 transitions. [2019-11-15 22:55:19,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 22:55:19,704 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 35 [2019-11-15 22:55:19,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:19,705 INFO L225 Difference]: With dead ends: 225 [2019-11-15 22:55:19,705 INFO L226 Difference]: Without dead ends: 225 [2019-11-15 22:55:19,706 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=278, Invalid=1702, Unknown=0, NotChecked=0, Total=1980 [2019-11-15 22:55:19,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-11-15 22:55:19,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 190. [2019-11-15 22:55:19,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-15 22:55:19,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 214 transitions. [2019-11-15 22:55:19,710 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 214 transitions. Word has length 35 [2019-11-15 22:55:19,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:19,710 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 214 transitions. [2019-11-15 22:55:19,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-15 22:55:19,711 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 214 transitions. [2019-11-15 22:55:19,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 22:55:19,711 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:19,711 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] [2019-11-15 22:55:19,911 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:55:19,912 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:55:19,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:19,913 INFO L82 PathProgramCache]: Analyzing trace with hash 678989762, now seen corresponding path program 1 times [2019-11-15 22:55:19,913 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:19,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48641814] [2019-11-15 22:55:19,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:19,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:19,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:20,137 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-15 22:55:20,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48641814] [2019-11-15 22:55:20,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181869841] [2019-11-15 22:55:20,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:55:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:20,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-15 22:55:20,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:55:20,365 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:55:20,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:20,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:20,375 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:55:20,375 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:20,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:20,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:55:20,381 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2019-11-15 22:55:20,477 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:20,478 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-15 22:55:20,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:55:20,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:20,500 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:20,500 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-15 22:55:20,500 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 22:55:20,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:20,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:20,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:20,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:20,517 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-15 22:55:20,517 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:37 [2019-11-15 22:55:20,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:20,599 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-15 22:55:20,599 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:55:20,600 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-11-15 22:55:20,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681650709] [2019-11-15 22:55:20,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-15 22:55:20,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:20,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-15 22:55:20,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2019-11-15 22:55:20,601 INFO L87 Difference]: Start difference. First operand 190 states and 214 transitions. Second operand 20 states. [2019-11-15 22:55:21,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:21,954 INFO L93 Difference]: Finished difference Result 234 states and 257 transitions. [2019-11-15 22:55:21,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 22:55:21,954 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2019-11-15 22:55:21,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:21,956 INFO L225 Difference]: With dead ends: 234 [2019-11-15 22:55:21,956 INFO L226 Difference]: Without dead ends: 234 [2019-11-15 22:55:21,957 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=192, Invalid=930, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 22:55:21,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-11-15 22:55:21,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 206. [2019-11-15 22:55:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-15 22:55:21,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 234 transitions. [2019-11-15 22:55:21,962 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 234 transitions. Word has length 37 [2019-11-15 22:55:21,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:21,963 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 234 transitions. [2019-11-15 22:55:21,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-15 22:55:21,963 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 234 transitions. [2019-11-15 22:55:21,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 22:55:21,964 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:21,964 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:55:22,164 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:55:22,165 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:55:22,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:22,165 INFO L82 PathProgramCache]: Analyzing trace with hash 68481311, now seen corresponding path program 1 times [2019-11-15 22:55:22,166 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:22,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721108616] [2019-11-15 22:55:22,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:22,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:22,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:22,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:55:22,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721108616] [2019-11-15 22:55:22,421 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659148767] [2019-11-15 22:55:22,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:55:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:22,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-15 22:55:22,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:55:22,607 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-15 22:55:22,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:22,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:22,618 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-15 22:55:22,619 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:22,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:22,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:55:22,625 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-11-15 22:55:22,892 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:22,892 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 34 [2019-11-15 22:55:22,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:22,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:22,894 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:55:22,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:22,952 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:22,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2019-11-15 22:55:22,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:22,954 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:22,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:22,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:22,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:23,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:23,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:23,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:23,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:23,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:23,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:23,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:23,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:23,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:23,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:23,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 5 xjuncts. [2019-11-15 22:55:23,016 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:340 [2019-11-15 22:55:23,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:23,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:55:23,302 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:55:23,302 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2019-11-15 22:55:23,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540919618] [2019-11-15 22:55:23,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-15 22:55:23,303 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:23,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-15 22:55:23,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2019-11-15 22:55:23,304 INFO L87 Difference]: Start difference. First operand 206 states and 234 transitions. Second operand 26 states. [2019-11-15 22:55:26,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:26,016 INFO L93 Difference]: Finished difference Result 259 states and 283 transitions. [2019-11-15 22:55:26,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-15 22:55:26,017 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2019-11-15 22:55:26,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:26,018 INFO L225 Difference]: With dead ends: 259 [2019-11-15 22:55:26,018 INFO L226 Difference]: Without dead ends: 259 [2019-11-15 22:55:26,020 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=525, Invalid=2555, Unknown=0, NotChecked=0, Total=3080 [2019-11-15 22:55:26,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-15 22:55:26,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 217. [2019-11-15 22:55:26,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-15 22:55:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 249 transitions. [2019-11-15 22:55:26,025 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 249 transitions. Word has length 38 [2019-11-15 22:55:26,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:26,026 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 249 transitions. [2019-11-15 22:55:26,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-15 22:55:26,026 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 249 transitions. [2019-11-15 22:55:26,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 22:55:26,027 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:26,027 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:55:26,232 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:55:26,233 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:55:26,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:26,233 INFO L82 PathProgramCache]: Analyzing trace with hash 68481310, now seen corresponding path program 1 times [2019-11-15 22:55:26,234 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:26,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761753294] [2019-11-15 22:55:26,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:26,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:26,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:26,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:55:26,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761753294] [2019-11-15 22:55:26,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104666625] [2019-11-15 22:55:26,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:55:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:55:26,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-15 22:55:26,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:55:26,840 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 22:55:26,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:26,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:26,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:55:26,861 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2019-11-15 22:55:26,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:55:26,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:26,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:26,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:55:26,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-15 22:55:27,136 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:27,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-15 22:55:27,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:27,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:55:27,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:27,151 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:55:27,151 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-11-15 22:55:27,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:27,799 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:55:27,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 74 [2019-11-15 22:55:27,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:27,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:27,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:27,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:27,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:27,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:27,803 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:55:27,846 INFO L567 ElimStorePlain]: treesize reduction 24, result has 61.9 percent of original size [2019-11-15 22:55:27,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:27,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:27,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:27,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:55:27,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:81 [2019-11-15 22:55:27,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:55:28,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 22:55:28,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:55:28,068 INFO L567 ElimStorePlain]: treesize reduction 4, result has 78.9 percent of original size [2019-11-15 22:55:28,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:55:28,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2019-11-15 22:55:28,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:55:28,131 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:55:28,131 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2019-11-15 22:55:28,131 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803804595] [2019-11-15 22:55:28,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-15 22:55:28,132 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:55:28,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-15 22:55:28,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=968, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 22:55:28,134 INFO L87 Difference]: Start difference. First operand 217 states and 249 transitions. Second operand 33 states. [2019-11-15 22:55:31,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:55:31,536 INFO L93 Difference]: Finished difference Result 246 states and 274 transitions. [2019-11-15 22:55:31,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-15 22:55:31,537 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 38 [2019-11-15 22:55:31,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:55:31,539 INFO L225 Difference]: With dead ends: 246 [2019-11-15 22:55:31,539 INFO L226 Difference]: Without dead ends: 246 [2019-11-15 22:55:31,540 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=427, Invalid=2879, Unknown=0, NotChecked=0, Total=3306 [2019-11-15 22:55:31,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-11-15 22:55:31,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 217. [2019-11-15 22:55:31,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-15 22:55:31,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 248 transitions. [2019-11-15 22:55:31,553 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 248 transitions. Word has length 38 [2019-11-15 22:55:31,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:55:31,553 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 248 transitions. [2019-11-15 22:55:31,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-15 22:55:31,554 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 248 transitions. [2019-11-15 22:55:31,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 22:55:31,555 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:31,555 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-15 22:55:31,759 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:55:31,760 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-15 22:55:31,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:31,760 INFO L82 PathProgramCache]: Analyzing trace with hash -426155234, now seen corresponding path program 1 times [2019-11-15 22:55:31,760 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:55:31,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059764263] [2019-11-15 22:55:31,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:31,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:55:31,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:55:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:55:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:55:31,868 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:55:31,869 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:55:31,906 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-15 22:55:31,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:55:31 BoogieIcfgContainer [2019-11-15 22:55:31,963 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:55:31,963 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:55:31,964 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:55:31,965 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:55:31,965 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:54:32" (3/4) ... [2019-11-15 22:55:31,970 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:55:31,970 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:55:31,972 INFO L168 Benchmark]: Toolchain (without parser) took 61858.81 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 481.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -118.5 MB). Peak memory consumption was 362.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:55:31,972 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:55:31,973 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -186.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:55:31,973 INFO L168 Benchmark]: Boogie Preprocessor took 116.41 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:55:31,974 INFO L168 Benchmark]: RCFGBuilder took 1274.57 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: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:55:31,976 INFO L168 Benchmark]: TraceAbstraction took 59742.58 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 337.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -2.3 MB). Peak memory consumption was 335.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:55:31,976 INFO L168 Benchmark]: Witness Printer took 7.35 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:55:31,979 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 712.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -186.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 116.41 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1274.57 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: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 59742.58 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 337.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -2.3 MB). Peak memory consumption was 335.3 MB. Max. memory is 11.5 GB. * Witness Printer took 7.35 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 986]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 986. Possible FailurePath: [L989] SLL* head = malloc(sizeof(SLL)); VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L990] head->next = ((void*)0) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L991] head->prev = ((void*)0) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L992] head->data = 0 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L994] SLL* x = head; VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] [L997] COND FALSE !(__VERIFIER_nondet_int()) [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1018] x = head VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] [L1019] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}, x->next={0:0}] [L1019] COND FALSE !(x->next != ((void*)0)) [L1026] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}, x->next={0:0}] [L1026] SLL* y = x->next; [L1027] x->next = malloc(sizeof(SLL)) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={1:0}, x={-1:0}, y={0:0}] [L1028] x->data = 1 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={1:0}, x={-1:0}, y={0:0}] [L1029] x->next = y VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={1:0}, x={-1:0}, y={0:0}] [L1030] COND FALSE !(y != ((void*)0)) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={1:0}, x={-1:0}, y={0:0}] [L1038] x = head VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={1:0}, x={-1:0}, y={0:0}] [L1041] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={1:0}, x={-1:0}, x->data=1, y={0:0}] [L1041] COND FALSE !(x->data != 1) [L1047] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={1:0}, x={-1:0}, x->next={0:0}, y={0:0}] [L1047] x = x->next [L1048] COND FALSE !(\read(*x)) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={1:0}, x={0:0}, y={0:0}] [L1056] x = head VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={1:0}, x={-1:0}, y={0:0}] [L1057] COND TRUE x != ((void*)0) [L1059] head = x VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={1:0}, x={-1:0}, y={0:0}] [L1060] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={1:0}, x={-1:0}, x->next={0:0}, y={0:0}] [L1060] x = x->next [L1061] free(head) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={1:0}, x={0:0}, y={0:0}] [L1061] free(head) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={1:0}, x={0:0}, y={0:0}] [L1061] free(head) [L1057] COND FALSE !(x != ((void*)0)) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={1:0}, x={0:0}, y={0:0}] [L1064] return 0; VAL [\result=0, head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={1:0}, x={0:0}, y={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 125 locations, 58 error locations. Result: UNSAFE, OverallTime: 59.6s, OverallIterations: 30, TraceHistogramMax: 2, AutomataDifference: 37.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1855 SDtfs, 6965 SDslu, 7495 SDs, 0 SdLazy, 21077 SolverSat, 1674 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 20.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 952 GetRequests, 319 SyntacticMatches, 27 SemanticMatches, 606 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4827 ImplicationChecksByTransitivity, 22.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 29 MinimizatonAttempts, 1309 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 16.5s InterpolantComputationTime, 1124 NumberOfCodeBlocks, 1124 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1046 ConstructedInterpolants, 81 QuantifiedInterpolants, 457723 SizeOfPredicates, 160 NumberOfNonLiveVariables, 1924 ConjunctsInSsa, 426 ConjunctsInUnsatCore, 40 InterpolantComputations, 18 PerfectInterpolantSequences, 22/70 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 22:55:34,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:55:34,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:55:34,939 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:55:34,939 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:55:34,941 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:55:34,943 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:55:34,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:55:34,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:55:34,951 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:55:34,952 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:55:34,954 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:55:34,954 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:55:34,955 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:55:34,957 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:55:34,958 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:55:34,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:55:34,961 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:55:34,963 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:55:34,967 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:55:34,969 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:55:34,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:55:34,973 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:55:34,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:55:34,978 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:55:34,979 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:55:34,979 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:55:34,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:55:34,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:55:34,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:55:34,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:55:34,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:55:34,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:55:34,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:55:34,989 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:55:34,990 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:55:34,991 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:55:34,991 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:55:34,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:55:34,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:55:34,994 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:55:34,995 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-15 22:55:35,016 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:55:35,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:55:35,019 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:55:35,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:55:35,020 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:55:35,020 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:55:35,020 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:55:35,021 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:55:35,021 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:55:35,021 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:55:35,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:55:35,022 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 22:55:35,023 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 22:55:35,023 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 22:55:35,023 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:55:35,024 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 22:55:35,024 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 22:55:35,024 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:55:35,025 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:55:35,025 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:55:35,025 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:55:35,026 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:55:35,026 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:55:35,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:55:35,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:55:35,027 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:55:35,027 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 22:55:35,033 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 22:55:35,034 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 22:55:35,034 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_fec08634-5de8-4ed6-ad03-1168063a7098/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 -> a0270bdb02afc11bd88836e5502a475e981de345 [2019-11-15 22:55:35,089 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:55:35,110 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:55:35,120 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:55:35,124 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:55:35,127 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:55:35,128 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/../../sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i [2019-11-15 22:55:35,210 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/data/900e8a6ad/3506be0157da408da5ec72b1d7aed3ae/FLAGee0872290 [2019-11-15 22:55:35,880 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:55:35,881 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i [2019-11-15 22:55:35,902 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/data/900e8a6ad/3506be0157da408da5ec72b1d7aed3ae/FLAGee0872290 [2019-11-15 22:55:36,071 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/data/900e8a6ad/3506be0157da408da5ec72b1d7aed3ae [2019-11-15 22:55:36,074 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:55:36,076 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 22:55:36,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:55:36,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:55:36,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:55:36,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:55:36" (1/1) ... [2019-11-15 22:55:36,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cbc3622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:36, skipping insertion in model container [2019-11-15 22:55:36,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:55:36" (1/1) ... [2019-11-15 22:55:36,098 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:55:36,158 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:55:36,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:55:36,802 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:55:36,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:55:36,942 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:55:36,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:36 WrapperNode [2019-11-15 22:55:36,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:55:36,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:55:36,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:55:36,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:55:36,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:36" (1/1) ... [2019-11-15 22:55:36,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:36" (1/1) ... [2019-11-15 22:55:36,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:36" (1/1) ... [2019-11-15 22:55:36,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:36" (1/1) ... [2019-11-15 22:55:37,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:36" (1/1) ... [2019-11-15 22:55:37,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:36" (1/1) ... [2019-11-15 22:55:37,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:36" (1/1) ... [2019-11-15 22:55:37,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:55:37,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:55:37,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:55:37,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:55:37,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:55:37,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 22:55:37,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:55:37,130 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 22:55:37,130 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 22:55:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 22:55:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 22:55:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 22:55:37,131 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 22:55:37,132 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 22:55:37,132 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 22:55:37,132 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 22:55:37,133 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 22:55:37,133 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 22:55:37,133 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 22:55:37,134 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 22:55:37,134 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 22:55:37,134 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 22:55:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 22:55:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 22:55:37,135 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 22:55:37,136 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 22:55:37,136 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 22:55:37,136 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 22:55:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 22:55:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 22:55:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 22:55:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 22:55:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 22:55:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 22:55:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 22:55:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 22:55:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 22:55:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 22:55:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 22:55:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 22:55:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 22:55:37,141 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 22:55:37,141 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 22:55:37,141 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 22:55:37,141 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 22:55:37,142 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 22:55:37,142 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 22:55:37,142 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 22:55:37,142 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 22:55:37,143 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 22:55:37,143 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 22:55:37,143 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 22:55:37,144 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 22:55:37,144 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 22:55:37,144 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 22:55:37,144 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 22:55:37,145 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 22:55:37,145 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 22:55:37,145 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 22:55:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 22:55:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 22:55:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 22:55:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 22:55:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 22:55:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 22:55:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 22:55:37,148 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 22:55:37,148 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 22:55:37,148 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 22:55:37,148 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 22:55:37,149 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 22:55:37,149 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 22:55:37,149 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 22:55:37,150 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 22:55:37,150 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 22:55:37,150 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 22:55:37,150 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 22:55:37,151 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 22:55:37,151 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 22:55:37,151 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 22:55:37,151 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 22:55:37,152 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 22:55:37,152 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 22:55:37,152 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 22:55:37,152 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 22:55:37,153 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 22:55:37,153 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 22:55:37,153 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 22:55:37,153 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 22:55:37,154 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 22:55:37,154 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 22:55:37,154 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 22:55:37,154 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 22:55:37,154 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 22:55:37,155 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 22:55:37,155 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 22:55:37,155 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 22:55:37,155 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 22:55:37,156 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 22:55:37,156 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 22:55:37,156 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 22:55:37,156 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 22:55:37,156 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 22:55:37,157 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 22:55:37,157 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 22:55:37,157 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 22:55:37,157 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 22:55:37,158 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 22:55:37,158 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 22:55:37,158 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 22:55:37,158 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 22:55:37,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 22:55:37,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 22:55:37,159 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 22:55:37,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:55:37,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:55:37,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 22:55:37,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:55:37,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 22:55:37,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:55:37,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 22:55:37,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:55:38,524 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:55:38,524 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 22:55:38,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:55:38 BoogieIcfgContainer [2019-11-15 22:55:38,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:55:38,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:55:38,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:55:38,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:55:38,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:55:36" (1/3) ... [2019-11-15 22:55:38,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14792d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:55:38, skipping insertion in model container [2019-11-15 22:55:38,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:55:36" (2/3) ... [2019-11-15 22:55:38,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14792d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:55:38, skipping insertion in model container [2019-11-15 22:55:38,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:55:38" (3/3) ... [2019-11-15 22:55:38,545 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-simple-white-blue-2.i [2019-11-15 22:55:38,561 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:55:38,577 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 58 error locations. [2019-11-15 22:55:38,592 INFO L249 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2019-11-15 22:55:38,622 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:55:38,624 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 22:55:38,624 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:55:38,624 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:55:38,625 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:55:38,626 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:55:38,626 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:55:38,627 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:55:38,660 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2019-11-15 22:55:38,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 22:55:38,688 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:55:38,689 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:55:38,691 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr57ENSURES_VIOLATIONMEMORY_LEAK, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION]=== [2019-11-15 22:55:38,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:55:38,697 INFO L82 PathProgramCache]: Analyzing trace with hash 779799538, now seen corresponding path program 1 times [2019-11-15 22:55:38,708 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:55:38,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [645749638] [2019-11-15 22:55:38,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec08634-5de8-4ed6-ad03-1168063a7098/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:55:38,937 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:55:38,938 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort C_DOUBLE not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 22:55:38,946 INFO L168 Benchmark]: Toolchain (without parser) took 2868.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 951.0 MB in the beginning and 1.0 GB in the end (delta: -59.0 MB). Peak memory consumption was 62.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:55:38,947 INFO L168 Benchmark]: CDTParser took 1.17 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:55:38,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 866.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -150.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:55:38,949 INFO L168 Benchmark]: Boogie Preprocessor took 101.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:55:38,950 INFO L168 Benchmark]: RCFGBuilder took 1480.56 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: 66.0 MB). Peak memory consumption was 66.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:55:38,951 INFO L168 Benchmark]: TraceAbstraction took 414.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:55:38,955 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.17 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 866.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -150.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 101.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1480.56 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: 66.0 MB). Peak memory consumption was 66.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 414.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 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...