./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_45856237-9449-4991-a601-0f7b16f143b7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_45856237-9449-4991-a601-0f7b16f143b7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_45856237-9449-4991-a601-0f7b16f143b7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_45856237-9449-4991-a601-0f7b16f143b7/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_45856237-9449-4991-a601-0f7b16f143b7/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_45856237-9449-4991-a601-0f7b16f143b7/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 1f270b702de634d3ad2ee5a400388c6410a4cf10 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:28:00,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:28:00,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:28:00,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:28:00,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:28:00,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:28:00,824 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:28:00,826 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:28:00,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:28:00,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:28:00,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:28:00,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:28:00,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:28:00,831 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:28:00,832 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:28:00,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:28:00,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:28:00,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:28:00,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:28:00,838 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:28:00,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:28:00,841 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:28:00,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:28:00,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:28:00,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:28:00,845 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:28:00,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:28:00,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:28:00,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:28:00,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:28:00,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:28:00,848 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:28:00,849 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:28:00,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:28:00,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:28:00,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:28:00,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:28:00,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:28:00,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:28:00,852 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:28:00,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:28:00,853 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_45856237-9449-4991-a601-0f7b16f143b7/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 20:28:00,866 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:28:00,866 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:28:00,867 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:28:00,868 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:28:00,868 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:28:00,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:28:00,868 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:28:00,869 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:28:00,869 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:28:00,869 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:28:00,869 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:28:00,869 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 20:28:00,870 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 20:28:00,870 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 20:28:00,870 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:28:00,870 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:28:00,870 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:28:00,871 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:28:00,871 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:28:00,871 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:28:00,871 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:28:00,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:28:00,872 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:28:00,872 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:28:00,872 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:28:00,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:28:00,873 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_45856237-9449-4991-a601-0f7b16f143b7/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 -> 1f270b702de634d3ad2ee5a400388c6410a4cf10 [2019-11-15 20:28:00,898 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:28:00,908 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:28:00,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:28:00,912 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:28:00,912 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:28:00,913 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_45856237-9449-4991-a601-0f7b16f143b7/bin/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2019-11-15 20:28:00,964 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_45856237-9449-4991-a601-0f7b16f143b7/bin/uautomizer/data/c253eda19/c7a2339b3c7446779c0808e7fff4183a/FLAGac020bc71 [2019-11-15 20:28:01,451 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:28:01,452 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_45856237-9449-4991-a601-0f7b16f143b7/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2019-11-15 20:28:01,463 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_45856237-9449-4991-a601-0f7b16f143b7/bin/uautomizer/data/c253eda19/c7a2339b3c7446779c0808e7fff4183a/FLAGac020bc71 [2019-11-15 20:28:01,762 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_45856237-9449-4991-a601-0f7b16f143b7/bin/uautomizer/data/c253eda19/c7a2339b3c7446779c0808e7fff4183a [2019-11-15 20:28:01,764 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:28:01,765 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 20:28:01,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:28:01,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:28:01,768 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:28:01,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:28:01" (1/1) ... [2019-11-15 20:28:01,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15242ddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:01, skipping insertion in model container [2019-11-15 20:28:01,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:28:01" (1/1) ... [2019-11-15 20:28:01,784 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:28:01,838 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:28:02,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:28:02,235 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:28:02,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:28:02,335 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:28:02,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:02 WrapperNode [2019-11-15 20:28:02,336 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:28:02,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:28:02,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:28:02,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:28:02,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:02" (1/1) ... [2019-11-15 20:28:02,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:02" (1/1) ... [2019-11-15 20:28:02,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:02" (1/1) ... [2019-11-15 20:28:02,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:02" (1/1) ... [2019-11-15 20:28:02,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:02" (1/1) ... [2019-11-15 20:28:02,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:02" (1/1) ... [2019-11-15 20:28:02,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:02" (1/1) ... [2019-11-15 20:28:02,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:28:02,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:28:02,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:28:02,395 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:28:02,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45856237-9449-4991-a601-0f7b16f143b7/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 20:28:02,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 20:28:02,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:28:02,458 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 20:28:02,458 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 20:28:02,458 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 20:28:02,458 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 20:28:02,459 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 20:28:02,460 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 20:28:02,460 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 20:28:02,460 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 20:28:02,460 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 20:28:02,461 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 20:28:02,461 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 20:28:02,462 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 20:28:02,462 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 20:28:02,462 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 20:28:02,462 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 20:28:02,462 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 20:28:02,464 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 20:28:02,464 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 20:28:02,465 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 20:28:02,465 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 20:28:02,465 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 20:28:02,465 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 20:28:02,465 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 20:28:02,466 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 20:28:02,466 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 20:28:02,466 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 20:28:02,466 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 20:28:02,466 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 20:28:02,466 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 20:28:02,466 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 20:28:02,466 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 20:28:02,467 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 20:28:02,467 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 20:28:02,467 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 20:28:02,467 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 20:28:02,467 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 20:28:02,467 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 20:28:02,467 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 20:28:02,467 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 20:28:02,467 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 20:28:02,468 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 20:28:02,468 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 20:28:02,468 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 20:28:02,468 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 20:28:02,470 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 20:28:02,470 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 20:28:02,470 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 20:28:02,471 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 20:28:02,471 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 20:28:02,471 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 20:28:02,471 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 20:28:02,471 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 20:28:02,471 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 20:28:02,471 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 20:28:02,472 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 20:28:02,472 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 20:28:02,472 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 20:28:02,472 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 20:28:02,472 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 20:28:02,472 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 20:28:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 20:28:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 20:28:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 20:28:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 20:28:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 20:28:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 20:28:02,473 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 20:28:02,474 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 20:28:02,474 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 20:28:02,475 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 20:28:02,475 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 20:28:02,475 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 20:28:02,476 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 20:28:02,476 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 20:28:02,476 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 20:28:02,476 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 20:28:02,477 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 20:28:02,477 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 20:28:02,477 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 20:28:02,478 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 20:28:02,478 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 20:28:02,478 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 20:28:02,478 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 20:28:02,478 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 20:28:02,478 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 20:28:02,478 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 20:28:02,479 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 20:28:02,479 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 20:28:02,479 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 20:28:02,479 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 20:28:02,479 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 20:28:02,479 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 20:28:02,480 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 20:28:02,480 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 20:28:02,480 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 20:28:02,480 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 20:28:02,481 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 20:28:02,481 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 20:28:02,481 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 20:28:02,481 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 20:28:02,481 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 20:28:02,481 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 20:28:02,482 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 20:28:02,482 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 20:28:02,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 20:28:02,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 20:28:02,482 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 20:28:02,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 20:28:02,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 20:28:02,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:28:02,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 20:28:02,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:28:02,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:28:02,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 20:28:02,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:28:03,270 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:28:03,270 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 20:28:03,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:28:03 BoogieIcfgContainer [2019-11-15 20:28:03,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:28:03,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:28:03,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:28:03,275 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:28:03,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:28:01" (1/3) ... [2019-11-15 20:28:03,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@621134a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:28:03, skipping insertion in model container [2019-11-15 20:28:03,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:28:02" (2/3) ... [2019-11-15 20:28:03,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@621134a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:28:03, skipping insertion in model container [2019-11-15 20:28:03,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:28:03" (3/3) ... [2019-11-15 20:28:03,279 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2019-11-15 20:28:03,287 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:28:03,297 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 62 error locations. [2019-11-15 20:28:03,306 INFO L249 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2019-11-15 20:28:03,325 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:28:03,328 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 20:28:03,328 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:28:03,329 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:28:03,329 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:28:03,329 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:28:03,330 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:28:03,330 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:28:03,356 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2019-11-15 20:28:03,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 20:28:03,364 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:03,365 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:03,366 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION]=== [2019-11-15 20:28:03,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:03,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1952743709, now seen corresponding path program 1 times [2019-11-15 20:28:03,377 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:03,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587020135] [2019-11-15 20:28:03,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:03,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:03,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:03,554 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 20:28:03,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587020135] [2019-11-15 20:28:03,556 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:28:03,556 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:28:03,556 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220803246] [2019-11-15 20:28:03,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:28:03,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:03,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:28:03,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:28:03,576 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 4 states. [2019-11-15 20:28:03,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:03,983 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2019-11-15 20:28:03,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:28:03,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 20:28:03,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:03,994 INFO L225 Difference]: With dead ends: 135 [2019-11-15 20:28:03,995 INFO L226 Difference]: Without dead ends: 131 [2019-11-15 20:28:03,996 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 20:28:04,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-15 20:28:04,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2019-11-15 20:28:04,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-15 20:28:04,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 134 transitions. [2019-11-15 20:28:04,039 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 134 transitions. Word has length 7 [2019-11-15 20:28:04,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:04,039 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 134 transitions. [2019-11-15 20:28:04,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:28:04,040 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 134 transitions. [2019-11-15 20:28:04,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 20:28:04,040 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:04,040 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:04,041 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION]=== [2019-11-15 20:28:04,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:04,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1952743710, now seen corresponding path program 1 times [2019-11-15 20:28:04,042 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:04,042 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103387394] [2019-11-15 20:28:04,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:04,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:04,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:04,117 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 20:28:04,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103387394] [2019-11-15 20:28:04,118 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:28:04,118 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:28:04,118 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756542967] [2019-11-15 20:28:04,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:28:04,119 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:04,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:28:04,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:28:04,120 INFO L87 Difference]: Start difference. First operand 127 states and 134 transitions. Second operand 4 states. [2019-11-15 20:28:04,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:04,504 INFO L93 Difference]: Finished difference Result 144 states and 150 transitions. [2019-11-15 20:28:04,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:28:04,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 20:28:04,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:04,506 INFO L225 Difference]: With dead ends: 144 [2019-11-15 20:28:04,506 INFO L226 Difference]: Without dead ends: 144 [2019-11-15 20:28:04,507 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 20:28:04,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-15 20:28:04,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 131. [2019-11-15 20:28:04,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-15 20:28:04,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2019-11-15 20:28:04,534 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 7 [2019-11-15 20:28:04,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:04,535 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2019-11-15 20:28:04,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:28:04,535 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2019-11-15 20:28:04,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 20:28:04,536 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:04,536 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:04,537 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION]=== [2019-11-15 20:28:04,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:04,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1898961510, now seen corresponding path program 1 times [2019-11-15 20:28:04,540 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:04,540 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401459358] [2019-11-15 20:28:04,540 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:04,540 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:04,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:04,642 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 20:28:04,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401459358] [2019-11-15 20:28:04,643 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:28:04,643 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:28:04,643 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391220142] [2019-11-15 20:28:04,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:28:04,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:04,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:28:04,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:28:04,645 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 5 states. [2019-11-15 20:28:05,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:05,013 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2019-11-15 20:28:05,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:28:05,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-15 20:28:05,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:05,015 INFO L225 Difference]: With dead ends: 136 [2019-11-15 20:28:05,015 INFO L226 Difference]: Without dead ends: 136 [2019-11-15 20:28:05,015 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 20:28:05,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-15 20:28:05,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 121. [2019-11-15 20:28:05,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 20:28:05,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2019-11-15 20:28:05,024 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 13 [2019-11-15 20:28:05,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:05,025 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2019-11-15 20:28:05,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:28:05,025 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2019-11-15 20:28:05,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 20:28:05,026 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:05,026 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:05,026 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION]=== [2019-11-15 20:28:05,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:05,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1898961511, now seen corresponding path program 1 times [2019-11-15 20:28:05,027 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:05,027 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169236576] [2019-11-15 20:28:05,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:05,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:05,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:05,174 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 20:28:05,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169236576] [2019-11-15 20:28:05,175 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:28:05,175 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:28:05,175 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191313643] [2019-11-15 20:28:05,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:28:05,176 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:05,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:28:05,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:28:05,179 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand 8 states. [2019-11-15 20:28:05,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:05,572 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2019-11-15 20:28:05,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:28:05,573 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-11-15 20:28:05,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:05,574 INFO L225 Difference]: With dead ends: 158 [2019-11-15 20:28:05,574 INFO L226 Difference]: Without dead ends: 158 [2019-11-15 20:28:05,575 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:28:05,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-15 20:28:05,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 133. [2019-11-15 20:28:05,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-15 20:28:05,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2019-11-15 20:28:05,584 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 13 [2019-11-15 20:28:05,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:05,584 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2019-11-15 20:28:05,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:28:05,584 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2019-11-15 20:28:05,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 20:28:05,585 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:05,585 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:05,586 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION]=== [2019-11-15 20:28:05,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:05,586 INFO L82 PathProgramCache]: Analyzing trace with hash -459089815, now seen corresponding path program 1 times [2019-11-15 20:28:05,586 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:05,586 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682704862] [2019-11-15 20:28:05,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:05,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:05,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:05,675 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 20:28:05,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682704862] [2019-11-15 20:28:05,675 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:28:05,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:28:05,676 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915052196] [2019-11-15 20:28:05,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:28:05,676 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:05,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:28:05,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:28:05,677 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand 6 states. [2019-11-15 20:28:06,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:06,002 INFO L93 Difference]: Finished difference Result 185 states and 203 transitions. [2019-11-15 20:28:06,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:28:06,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-15 20:28:06,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:06,004 INFO L225 Difference]: With dead ends: 185 [2019-11-15 20:28:06,004 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 20:28:06,004 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 20:28:06,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 20:28:06,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 132. [2019-11-15 20:28:06,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-15 20:28:06,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2019-11-15 20:28:06,012 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 15 [2019-11-15 20:28:06,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:06,012 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2019-11-15 20:28:06,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:28:06,012 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2019-11-15 20:28:06,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 20:28:06,013 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:06,013 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:06,014 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION]=== [2019-11-15 20:28:06,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:06,014 INFO L82 PathProgramCache]: Analyzing trace with hash -459089814, now seen corresponding path program 1 times [2019-11-15 20:28:06,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:06,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511265536] [2019-11-15 20:28:06,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:06,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:06,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:06,099 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 20:28:06,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511265536] [2019-11-15 20:28:06,100 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:28:06,100 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:28:06,100 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076741420] [2019-11-15 20:28:06,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:28:06,101 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:06,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:28:06,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:28:06,101 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand 6 states. [2019-11-15 20:28:06,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:06,486 INFO L93 Difference]: Finished difference Result 208 states and 227 transitions. [2019-11-15 20:28:06,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:28:06,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-15 20:28:06,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:06,487 INFO L225 Difference]: With dead ends: 208 [2019-11-15 20:28:06,487 INFO L226 Difference]: Without dead ends: 208 [2019-11-15 20:28:06,487 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:28:06,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-11-15 20:28:06,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 131. [2019-11-15 20:28:06,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-15 20:28:06,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2019-11-15 20:28:06,493 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 15 [2019-11-15 20:28:06,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:06,494 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2019-11-15 20:28:06,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:28:06,494 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2019-11-15 20:28:06,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 20:28:06,495 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:06,495 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 20:28:06,495 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION]=== [2019-11-15 20:28:06,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:06,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1388351317, now seen corresponding path program 1 times [2019-11-15 20:28:06,496 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:06,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851815395] [2019-11-15 20:28:06,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:06,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:06,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:06,615 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 20:28:06,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851815395] [2019-11-15 20:28:06,616 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:28:06,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 20:28:06,616 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155834051] [2019-11-15 20:28:06,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:28:06,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:06,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:28:06,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:28:06,617 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand 10 states. [2019-11-15 20:28:07,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:07,197 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2019-11-15 20:28:07,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:28:07,198 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-15 20:28:07,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:07,199 INFO L225 Difference]: With dead ends: 144 [2019-11-15 20:28:07,199 INFO L226 Difference]: Without dead ends: 144 [2019-11-15 20:28:07,200 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-11-15 20:28:07,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-15 20:28:07,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 130. [2019-11-15 20:28:07,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-15 20:28:07,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2019-11-15 20:28:07,204 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 19 [2019-11-15 20:28:07,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:07,204 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2019-11-15 20:28:07,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:28:07,204 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2019-11-15 20:28:07,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 20:28:07,205 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:07,205 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 20:28:07,205 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION]=== [2019-11-15 20:28:07,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:07,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1388351316, now seen corresponding path program 1 times [2019-11-15 20:28:07,213 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:07,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753845428] [2019-11-15 20:28:07,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:07,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:07,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:07,415 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 20:28:07,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753845428] [2019-11-15 20:28:07,416 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:28:07,416 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 20:28:07,416 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453028835] [2019-11-15 20:28:07,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 20:28:07,417 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:07,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 20:28:07,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:28:07,417 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand 11 states. [2019-11-15 20:28:08,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:08,354 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2019-11-15 20:28:08,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 20:28:08,354 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-15 20:28:08,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:08,355 INFO L225 Difference]: With dead ends: 147 [2019-11-15 20:28:08,355 INFO L226 Difference]: Without dead ends: 147 [2019-11-15 20:28:08,356 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-11-15 20:28:08,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-15 20:28:08,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 124. [2019-11-15 20:28:08,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-15 20:28:08,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2019-11-15 20:28:08,360 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 19 [2019-11-15 20:28:08,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:08,360 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2019-11-15 20:28:08,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 20:28:08,360 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2019-11-15 20:28:08,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 20:28:08,361 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:08,361 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:08,362 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION]=== [2019-11-15 20:28:08,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:08,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1595284681, now seen corresponding path program 1 times [2019-11-15 20:28:08,362 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:08,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977720827] [2019-11-15 20:28:08,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:08,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:08,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:08,422 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 20:28:08,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977720827] [2019-11-15 20:28:08,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:28:08,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:28:08,423 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189516245] [2019-11-15 20:28:08,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:28:08,423 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:08,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:28:08,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:28:08,424 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 6 states. [2019-11-15 20:28:08,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:08,662 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2019-11-15 20:28:08,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:28:08,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-15 20:28:08,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:08,663 INFO L225 Difference]: With dead ends: 149 [2019-11-15 20:28:08,663 INFO L226 Difference]: Without dead ends: 149 [2019-11-15 20:28:08,664 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:28:08,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-15 20:28:08,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 124. [2019-11-15 20:28:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-15 20:28:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2019-11-15 20:28:08,667 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 22 [2019-11-15 20:28:08,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:08,667 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2019-11-15 20:28:08,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:28:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2019-11-15 20:28:08,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 20:28:08,668 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:08,668 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 20:28:08,668 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION]=== [2019-11-15 20:28:08,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:08,669 INFO L82 PathProgramCache]: Analyzing trace with hash 245926791, now seen corresponding path program 1 times [2019-11-15 20:28:08,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:08,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856449789] [2019-11-15 20:28:08,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:08,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:08,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:08,758 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 20:28:08,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856449789] [2019-11-15 20:28:08,759 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:28:08,759 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:28:08,759 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123787823] [2019-11-15 20:28:08,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:28:08,760 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:08,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:28:08,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:28:08,760 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 6 states. [2019-11-15 20:28:09,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:09,028 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2019-11-15 20:28:09,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:28:09,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-15 20:28:09,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:09,030 INFO L225 Difference]: With dead ends: 130 [2019-11-15 20:28:09,030 INFO L226 Difference]: Without dead ends: 130 [2019-11-15 20:28:09,030 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:28:09,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-15 20:28:09,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 123. [2019-11-15 20:28:09,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-15 20:28:09,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2019-11-15 20:28:09,034 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 24 [2019-11-15 20:28:09,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:09,034 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2019-11-15 20:28:09,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:28:09,035 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2019-11-15 20:28:09,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 20:28:09,036 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:09,036 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:09,036 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION]=== [2019-11-15 20:28:09,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:09,036 INFO L82 PathProgramCache]: Analyzing trace with hash -709415676, now seen corresponding path program 1 times [2019-11-15 20:28:09,037 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:09,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117259385] [2019-11-15 20:28:09,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:09,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:09,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:09,103 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 20:28:09,103 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117259385] [2019-11-15 20:28:09,103 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:28:09,103 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:28:09,103 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43589157] [2019-11-15 20:28:09,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:28:09,104 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:09,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:28:09,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:28:09,104 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand 6 states. [2019-11-15 20:28:09,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:09,529 INFO L93 Difference]: Finished difference Result 188 states and 203 transitions. [2019-11-15 20:28:09,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:28:09,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-15 20:28:09,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:09,531 INFO L225 Difference]: With dead ends: 188 [2019-11-15 20:28:09,531 INFO L226 Difference]: Without dead ends: 188 [2019-11-15 20:28:09,532 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 20:28:09,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-15 20:28:09,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 122. [2019-11-15 20:28:09,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-15 20:28:09,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2019-11-15 20:28:09,536 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 26 [2019-11-15 20:28:09,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:09,536 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2019-11-15 20:28:09,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:28:09,536 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2019-11-15 20:28:09,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 20:28:09,537 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:09,537 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:09,538 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION]=== [2019-11-15 20:28:09,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:09,538 INFO L82 PathProgramCache]: Analyzing trace with hash -709415675, now seen corresponding path program 1 times [2019-11-15 20:28:09,538 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:09,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401004842] [2019-11-15 20:28:09,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:09,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:09,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:09,599 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 20:28:09,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401004842] [2019-11-15 20:28:09,600 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:28:09,600 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:28:09,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889783414] [2019-11-15 20:28:09,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:28:09,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:09,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:28:09,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:28:09,601 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand 6 states. [2019-11-15 20:28:09,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:09,973 INFO L93 Difference]: Finished difference Result 211 states and 228 transitions. [2019-11-15 20:28:09,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:28:09,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-15 20:28:09,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:09,975 INFO L225 Difference]: With dead ends: 211 [2019-11-15 20:28:09,976 INFO L226 Difference]: Without dead ends: 211 [2019-11-15 20:28:09,976 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:28:09,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-15 20:28:09,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 121. [2019-11-15 20:28:09,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 20:28:09,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2019-11-15 20:28:09,980 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 26 [2019-11-15 20:28:09,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:09,981 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2019-11-15 20:28:09,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:28:09,981 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2019-11-15 20:28:09,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 20:28:09,982 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:09,982 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] [2019-11-15 20:28:09,983 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION]=== [2019-11-15 20:28:09,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:09,983 INFO L82 PathProgramCache]: Analyzing trace with hash 95234481, now seen corresponding path program 1 times [2019-11-15 20:28:09,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:09,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516400872] [2019-11-15 20:28:09,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:09,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:09,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:10,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:28:10,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516400872] [2019-11-15 20:28:10,059 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:28:10,059 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:28:10,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141402317] [2019-11-15 20:28:10,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:28:10,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:10,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:28:10,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:28:10,060 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand 6 states. [2019-11-15 20:28:10,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:10,294 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2019-11-15 20:28:10,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:28:10,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-15 20:28:10,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:10,296 INFO L225 Difference]: With dead ends: 135 [2019-11-15 20:28:10,296 INFO L226 Difference]: Without dead ends: 124 [2019-11-15 20:28:10,296 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 20:28:10,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-15 20:28:10,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2019-11-15 20:28:10,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-15 20:28:10,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2019-11-15 20:28:10,299 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 28 [2019-11-15 20:28:10,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:10,300 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2019-11-15 20:28:10,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:28:10,300 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2019-11-15 20:28:10,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 20:28:10,301 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:10,301 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 20:28:10,301 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION]=== [2019-11-15 20:28:10,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:10,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1667229882, now seen corresponding path program 1 times [2019-11-15 20:28:10,302 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:10,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957597034] [2019-11-15 20:28:10,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:10,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:10,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:10,425 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 20:28:10,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957597034] [2019-11-15 20:28:10,425 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:28:10,426 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 20:28:10,426 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430732106] [2019-11-15 20:28:10,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 20:28:10,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:10,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:28:10,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:28:10,427 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand 9 states. [2019-11-15 20:28:10,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:10,781 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2019-11-15 20:28:10,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:28:10,782 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-11-15 20:28:10,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:10,783 INFO L225 Difference]: With dead ends: 124 [2019-11-15 20:28:10,783 INFO L226 Difference]: Without dead ends: 124 [2019-11-15 20:28:10,783 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:28:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-15 20:28:10,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-11-15 20:28:10,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-15 20:28:10,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2019-11-15 20:28:10,787 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 30 [2019-11-15 20:28:10,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:10,787 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2019-11-15 20:28:10,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 20:28:10,787 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2019-11-15 20:28:10,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 20:28:10,788 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:10,788 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 20:28:10,788 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION]=== [2019-11-15 20:28:10,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:10,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1667229881, now seen corresponding path program 1 times [2019-11-15 20:28:10,789 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:10,789 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582210984] [2019-11-15 20:28:10,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:10,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:10,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:10,924 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 20:28:10,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582210984] [2019-11-15 20:28:10,925 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:28:10,925 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 20:28:10,925 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477970813] [2019-11-15 20:28:10,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 20:28:10,925 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:10,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 20:28:10,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:28:10,926 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand 10 states. [2019-11-15 20:28:11,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:11,628 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2019-11-15 20:28:11,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:28:11,629 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2019-11-15 20:28:11,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:11,630 INFO L225 Difference]: With dead ends: 121 [2019-11-15 20:28:11,630 INFO L226 Difference]: Without dead ends: 121 [2019-11-15 20:28:11,630 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-11-15 20:28:11,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-15 20:28:11,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 110. [2019-11-15 20:28:11,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-15 20:28:11,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2019-11-15 20:28:11,633 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 30 [2019-11-15 20:28:11,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:11,634 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2019-11-15 20:28:11,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 20:28:11,634 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2019-11-15 20:28:11,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 20:28:11,635 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:11,635 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:11,635 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION]=== [2019-11-15 20:28:11,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:11,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1435921091, now seen corresponding path program 1 times [2019-11-15 20:28:11,636 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:11,636 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63272221] [2019-11-15 20:28:11,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:11,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:11,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:11,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:28:11,879 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63272221] [2019-11-15 20:28:11,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676111848] [2019-11-15 20:28:11,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45856237-9449-4991-a601-0f7b16f143b7/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 20:28:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:12,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-15 20:28:12,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:28:12,105 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:12,106 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 20:28:12,107 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:12,124 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-15 20:28:12,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:28:12,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-15 20:28:12,180 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 20:28:12,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:12,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:12,193 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 20:28:12,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-11-15 20:28:12,301 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:12,302 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 20:28:12,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:12,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:12,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:12,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 20:28:12,356 INFO L567 ElimStorePlain]: treesize reduction 136, result has 24.0 percent of original size [2019-11-15 20:28:12,357 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 20:28:12,357 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2019-11-15 20:28:12,540 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:12,540 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 49 treesize of output 110 [2019-11-15 20:28:12,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:12,587 INFO L567 ElimStorePlain]: treesize reduction 54, result has 44.9 percent of original size [2019-11-15 20:28:12,588 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 20:28:12,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:29 [2019-11-15 20:28:12,679 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-15 20:28:12,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 79 [2019-11-15 20:28:12,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:12,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:12,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:12,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:12,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 20:28:12,707 INFO L567 ElimStorePlain]: treesize reduction 82, result has 29.9 percent of original size [2019-11-15 20:28:12,708 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 20:28:12,708 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2019-11-15 20:28:12,795 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:12,795 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 20:28:12,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:12,806 INFO L567 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2019-11-15 20:28:12,807 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 20:28:12,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2019-11-15 20:28:12,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:28:12,874 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:28:12,874 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2019-11-15 20:28:12,874 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946485714] [2019-11-15 20:28:12,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-15 20:28:12,875 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:12,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 20:28:12,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2019-11-15 20:28:12,876 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 25 states. [2019-11-15 20:28:14,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:14,228 INFO L93 Difference]: Finished difference Result 214 states and 227 transitions. [2019-11-15 20:28:14,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 20:28:14,228 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 40 [2019-11-15 20:28:14,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:14,230 INFO L225 Difference]: With dead ends: 214 [2019-11-15 20:28:14,230 INFO L226 Difference]: Without dead ends: 214 [2019-11-15 20:28:14,231 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=315, Invalid=1165, Unknown=2, NotChecked=0, Total=1482 [2019-11-15 20:28:14,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-15 20:28:14,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 138. [2019-11-15 20:28:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-15 20:28:14,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2019-11-15 20:28:14,235 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 40 [2019-11-15 20:28:14,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:14,236 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2019-11-15 20:28:14,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-15 20:28:14,236 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2019-11-15 20:28:14,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 20:28:14,237 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:14,237 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:14,438 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:28:14,438 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION]=== [2019-11-15 20:28:14,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:14,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1435921092, now seen corresponding path program 1 times [2019-11-15 20:28:14,438 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:14,439 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340842611] [2019-11-15 20:28:14,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:14,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:14,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:14,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:28:14,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340842611] [2019-11-15 20:28:14,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386698695] [2019-11-15 20:28:14,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45856237-9449-4991-a601-0f7b16f143b7/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 20:28:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:14,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-15 20:28:14,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:28:14,830 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_61|], 1=[|v_#valid_77|]} [2019-11-15 20:28:14,838 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 20:28:14,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:14,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:14,857 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:14,857 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 20:28:14,857 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:14,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:14,867 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:28:14,867 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-15 20:28:14,878 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 20:28:14,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:14,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:14,896 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 20:28:14,897 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:14,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:14,913 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 20:28:14,913 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-11-15 20:28:14,970 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 20:28:14,970 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:14,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:15,001 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:15,001 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 52 treesize of output 66 [2019-11-15 20:28:15,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:15,002 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:15,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:15,014 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 20:28:15,014 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2019-11-15 20:28:15,137 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:15,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 60 [2019-11-15 20:28:15,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:15,175 INFO L567 ElimStorePlain]: treesize reduction 20, result has 80.4 percent of original size [2019-11-15 20:28:15,240 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:15,240 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 125 [2019-11-15 20:28:15,242 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:15,294 INFO L567 ElimStorePlain]: treesize reduction 54, result has 55.7 percent of original size [2019-11-15 20:28:15,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:15,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:15,296 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 20:28:15,296 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:38 [2019-11-15 20:28:15,362 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-15 20:28:15,363 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 105 [2019-11-15 20:28:15,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:15,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:15,388 INFO L567 ElimStorePlain]: treesize reduction 32, result has 70.9 percent of original size [2019-11-15 20:28:15,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:15,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 25 [2019-11-15 20:28:15,393 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:15,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:15,401 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 20:28:15,401 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:109, output treesize:47 [2019-11-15 20:28:15,503 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:15,503 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 20:28:15,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:15,521 INFO L567 ElimStorePlain]: treesize reduction 12, result has 72.1 percent of original size [2019-11-15 20:28:15,523 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 20:28:15,523 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:15,528 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:15,528 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 20:28:15,529 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2019-11-15 20:28:15,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:28:15,542 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:28:15,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 20 [2019-11-15 20:28:15,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449688834] [2019-11-15 20:28:15,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-15 20:28:15,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:15,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-15 20:28:15,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-11-15 20:28:15,545 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand 21 states. [2019-11-15 20:28:16,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:16,928 INFO L93 Difference]: Finished difference Result 211 states and 227 transitions. [2019-11-15 20:28:16,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 20:28:16,928 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-11-15 20:28:16,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:16,929 INFO L225 Difference]: With dead ends: 211 [2019-11-15 20:28:16,929 INFO L226 Difference]: Without dead ends: 211 [2019-11-15 20:28:16,930 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=193, Invalid=996, Unknown=1, NotChecked=0, Total=1190 [2019-11-15 20:28:16,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-15 20:28:16,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 140. [2019-11-15 20:28:16,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-15 20:28:16,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 152 transitions. [2019-11-15 20:28:16,933 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 152 transitions. Word has length 40 [2019-11-15 20:28:16,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:16,933 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 152 transitions. [2019-11-15 20:28:16,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-15 20:28:16,934 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 152 transitions. [2019-11-15 20:28:16,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 20:28:16,934 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:16,935 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:17,135 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:28:17,135 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION]=== [2019-11-15 20:28:17,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:17,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1235657845, now seen corresponding path program 1 times [2019-11-15 20:28:17,136 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:17,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735675908] [2019-11-15 20:28:17,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:17,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:17,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:17,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 20:28:17,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735675908] [2019-11-15 20:28:17,216 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:28:17,216 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:28:17,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889227684] [2019-11-15 20:28:17,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:28:17,217 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:17,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:28:17,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:28:17,218 INFO L87 Difference]: Start difference. First operand 140 states and 152 transitions. Second operand 7 states. [2019-11-15 20:28:17,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:17,425 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2019-11-15 20:28:17,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:28:17,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-11-15 20:28:17,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:17,426 INFO L225 Difference]: With dead ends: 104 [2019-11-15 20:28:17,427 INFO L226 Difference]: Without dead ends: 104 [2019-11-15 20:28:17,427 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-15 20:28:17,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-15 20:28:17,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2019-11-15 20:28:17,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-15 20:28:17,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2019-11-15 20:28:17,430 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 42 [2019-11-15 20:28:17,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:17,430 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2019-11-15 20:28:17,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:28:17,430 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2019-11-15 20:28:17,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 20:28:17,431 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:17,431 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:17,431 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION]=== [2019-11-15 20:28:17,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:17,431 INFO L82 PathProgramCache]: Analyzing trace with hash 2067395909, now seen corresponding path program 1 times [2019-11-15 20:28:17,431 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:17,432 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699936283] [2019-11-15 20:28:17,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:17,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:17,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:17,909 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:28:17,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699936283] [2019-11-15 20:28:17,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648077458] [2019-11-15 20:28:17,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45856237-9449-4991-a601-0f7b16f143b7/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 20:28:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:18,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-15 20:28:18,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:28:18,097 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_62|], 1=[|v_#valid_78|]} [2019-11-15 20:28:18,100 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 20:28:18,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:18,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:18,114 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:18,115 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 20:28:18,115 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:18,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:18,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:28:18,122 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-15 20:28:18,162 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 20:28:18,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:18,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:18,179 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 20:28:18,179 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:18,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:18,192 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 20:28:18,192 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-11-15 20:28:18,274 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:18,274 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 20:28:18,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:18,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 20:28:18,306 INFO L567 ElimStorePlain]: treesize reduction 52, result has 55.9 percent of original size [2019-11-15 20:28:18,309 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 20:28:18,309 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:18,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:18,320 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 20:28:18,321 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2019-11-15 20:28:18,492 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:18,492 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 62 treesize of output 119 [2019-11-15 20:28:18,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:18,553 INFO L567 ElimStorePlain]: treesize reduction 54, result has 56.1 percent of original size [2019-11-15 20:28:18,567 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:18,567 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 28 treesize of output 52 [2019-11-15 20:28:18,568 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:18,608 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.6 percent of original size [2019-11-15 20:28:18,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:18,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:18,609 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 20:28:18,609 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:83, output treesize:41 [2019-11-15 20:28:18,689 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-15 20:28:18,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:18,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:18,736 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_30|], 6=[|v_#memory_$Pointer$.base_49|, |v_#memory_$Pointer$.offset_45|]} [2019-11-15 20:28:18,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-15 20:28:18,745 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:18,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:18,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:18,790 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:18,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 121 [2019-11-15 20:28:18,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:18,793 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:18,825 INFO L567 ElimStorePlain]: treesize reduction 52, result has 62.9 percent of original size [2019-11-15 20:28:18,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:18,829 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 25 [2019-11-15 20:28:18,829 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:18,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:18,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:28:18,842 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:144, output treesize:57 [2019-11-15 20:28:18,956 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:18,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 42 [2019-11-15 20:28:18,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:18,981 INFO L567 ElimStorePlain]: treesize reduction 12, result has 77.4 percent of original size [2019-11-15 20:28:18,983 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 20:28:18,984 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:18,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:18,992 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:28:18,992 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:71, output treesize:19 [2019-11-15 20:28:19,085 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:19,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2019-11-15 20:28:19,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 20:28:19,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:19,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:19,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:28:19,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:16 [2019-11-15 20:28:19,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:28:19,252 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:28:19,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 37 [2019-11-15 20:28:19,253 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509418058] [2019-11-15 20:28:19,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-15 20:28:19,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:19,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-15 20:28:19,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1232, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 20:28:19,254 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 37 states. [2019-11-15 20:28:21,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:21,601 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2019-11-15 20:28:21,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 20:28:21,602 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 44 [2019-11-15 20:28:21,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:21,603 INFO L225 Difference]: With dead ends: 139 [2019-11-15 20:28:21,603 INFO L226 Difference]: Without dead ends: 138 [2019-11-15 20:28:21,604 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=376, Invalid=2812, Unknown=4, NotChecked=0, Total=3192 [2019-11-15 20:28:21,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-15 20:28:21,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 94. [2019-11-15 20:28:21,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-15 20:28:21,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2019-11-15 20:28:21,607 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 44 [2019-11-15 20:28:21,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:21,607 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2019-11-15 20:28:21,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-15 20:28:21,607 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2019-11-15 20:28:21,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 20:28:21,608 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:21,608 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:21,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:28:21,810 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION]=== [2019-11-15 20:28:21,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:21,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1814592401, now seen corresponding path program 2 times [2019-11-15 20:28:21,811 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:21,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019484998] [2019-11-15 20:28:21,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:21,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:21,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:22,324 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:28:22,324 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019484998] [2019-11-15 20:28:22,324 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263474575] [2019-11-15 20:28:22,324 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45856237-9449-4991-a601-0f7b16f143b7/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 20:28:22,473 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:28:22,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:28:22,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 62 conjunts are in the unsatisfiable core [2019-11-15 20:28:22,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:28:22,493 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:22,494 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 20:28:22,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:22,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:22,508 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:28:22,509 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-15 20:28:22,551 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 20:28:22,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:22,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:22,575 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 20:28:22,575 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:22,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:22,587 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 20:28:22,587 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2019-11-15 20:28:22,672 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 20:28:22,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:22,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:22,709 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:22,709 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 43 treesize of output 61 [2019-11-15 20:28:22,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:22,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:22,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:22,712 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 20:28:22,763 INFO L567 ElimStorePlain]: treesize reduction 152, result has 25.5 percent of original size [2019-11-15 20:28:22,764 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 20:28:22,764 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2019-11-15 20:28:22,901 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:22,901 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 39 treesize of output 63 [2019-11-15 20:28:22,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:22,938 INFO L567 ElimStorePlain]: treesize reduction 29, result has 72.6 percent of original size [2019-11-15 20:28:22,941 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:22,968 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:22,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 106 [2019-11-15 20:28:22,969 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:23,008 INFO L567 ElimStorePlain]: treesize reduction 46, result has 59.3 percent of original size [2019-11-15 20:28:23,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:23,009 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 20:28:23,009 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:67 [2019-11-15 20:28:23,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:23,073 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:23,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, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 126 [2019-11-15 20:28:23,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:23,098 INFO L567 ElimStorePlain]: treesize reduction 58, result has 60.3 percent of original size [2019-11-15 20:28:23,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:23,104 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:23,105 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 71 [2019-11-15 20:28:23,105 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:23,122 INFO L567 ElimStorePlain]: treesize reduction 16, result has 75.4 percent of original size [2019-11-15 20:28:23,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:28:23,122 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:127, output treesize:49 [2019-11-15 20:28:23,362 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:23,366 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:23,383 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:23,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 69 treesize of output 63 [2019-11-15 20:28:23,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:23,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:23,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:23,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:23,386 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 20:28:23,418 INFO L567 ElimStorePlain]: treesize reduction 16, result has 72.9 percent of original size [2019-11-15 20:28:23,421 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:28:23,426 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:23,426 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2019-11-15 20:28:23,426 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:23,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:23,435 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 20:28:23,436 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:7 [2019-11-15 20:28:23,500 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:28:23,500 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:28:23,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 34 [2019-11-15 20:28:23,500 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983928998] [2019-11-15 20:28:23,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-15 20:28:23,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:23,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-15 20:28:23,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 20:28:23,501 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand 34 states. [2019-11-15 20:28:24,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:24,870 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2019-11-15 20:28:24,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 20:28:24,871 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 48 [2019-11-15 20:28:24,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:24,871 INFO L225 Difference]: With dead ends: 114 [2019-11-15 20:28:24,871 INFO L226 Difference]: Without dead ends: 95 [2019-11-15 20:28:24,872 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=316, Invalid=2036, Unknown=0, NotChecked=0, Total=2352 [2019-11-15 20:28:24,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-15 20:28:24,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 80. [2019-11-15 20:28:24,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-15 20:28:24,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2019-11-15 20:28:24,875 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 48 [2019-11-15 20:28:24,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:24,875 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2019-11-15 20:28:24,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-15 20:28:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2019-11-15 20:28:24,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 20:28:24,876 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:24,876 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:25,076 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:28:25,077 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION]=== [2019-11-15 20:28:25,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:25,077 INFO L82 PathProgramCache]: Analyzing trace with hash -92549819, now seen corresponding path program 1 times [2019-11-15 20:28:25,077 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:25,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116619479] [2019-11-15 20:28:25,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:25,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:25,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:25,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:28:25,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116619479] [2019-11-15 20:28:25,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397565182] [2019-11-15 20:28:25,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45856237-9449-4991-a601-0f7b16f143b7/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 20:28:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:25,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-15 20:28:25,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:28:25,641 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:25,641 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 20:28:25,642 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:25,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:25,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:28:25,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-15 20:28:25,686 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 20:28:25,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:25,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:25,705 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 20:28:25,705 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:25,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:25,719 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 20:28:25,719 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30 [2019-11-15 20:28:25,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2019-11-15 20:28:25,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:25,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:25,831 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:25,832 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 43 treesize of output 61 [2019-11-15 20:28:25,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:25,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:25,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:25,834 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 20:28:25,884 INFO L567 ElimStorePlain]: treesize reduction 152, result has 27.3 percent of original size [2019-11-15 20:28:25,885 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 20:28:25,885 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:56 [2019-11-15 20:28:25,946 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 20:28:25,946 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:25,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:25,958 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 20:28:25,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:40 [2019-11-15 20:28:26,069 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:26,069 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 40 treesize of output 97 [2019-11-15 20:28:26,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:26,106 INFO L567 ElimStorePlain]: treesize reduction 46, result has 52.1 percent of original size [2019-11-15 20:28:26,107 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 20:28:26,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:35 [2019-11-15 20:28:26,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:26,155 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 20:28:26,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:26,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:26,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:28:26,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:35 [2019-11-15 20:28:26,190 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:26,190 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 20:28:26,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:26,241 INFO L567 ElimStorePlain]: treesize reduction 28, result has 63.2 percent of original size [2019-11-15 20:28:26,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:28:26,241 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:48 [2019-11-15 20:28:26,296 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 20:28:26,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:26,324 INFO L567 ElimStorePlain]: treesize reduction 4, result has 91.7 percent of original size [2019-11-15 20:28:26,325 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 20:28:26,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:49 [2019-11-15 20:28:26,460 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:26,460 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 107 [2019-11-15 20:28:26,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:26,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:26,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:26,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:26,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:26,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:26,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:26,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 20:28:26,503 INFO L567 ElimStorePlain]: treesize reduction 105, result has 37.5 percent of original size [2019-11-15 20:28:26,504 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 20:28:26,504 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:62 [2019-11-15 20:28:26,802 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-15 20:28:26,802 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:26,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 175 [2019-11-15 20:28:26,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:26,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:26,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:26,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:26,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:26,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:26,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:26,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:26,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:26,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:26,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:26,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:26,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:26,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:26,812 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 20:28:26,884 INFO L567 ElimStorePlain]: treesize reduction 86, result has 42.3 percent of original size [2019-11-15 20:28:26,884 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 20:28:26,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-11-15 20:28:27,078 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-11-15 20:28:27,078 INFO L341 Elim1Store]: treesize reduction 50, result has 66.2 percent of original size [2019-11-15 20:28:27,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 109 treesize of output 140 [2019-11-15 20:28:27,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:27,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:27,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:27,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:27,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:27,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:27,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:27,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:27,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:27,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:27,085 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 20:28:27,139 INFO L567 ElimStorePlain]: treesize reduction 666, result has 10.2 percent of original size [2019-11-15 20:28:27,139 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 20:28:27,140 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:117, output treesize:74 [2019-11-15 20:28:27,275 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:27,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 63 [2019-11-15 20:28:27,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:27,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:27,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:27,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:27,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:27,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:27,279 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 20:28:27,312 INFO L567 ElimStorePlain]: treesize reduction 28, result has 50.0 percent of original size [2019-11-15 20:28:27,312 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 20:28:27,312 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:78, output treesize:28 [2019-11-15 20:28:27,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:28:27,420 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:28:27,420 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 41 [2019-11-15 20:28:27,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898337487] [2019-11-15 20:28:27,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-11-15 20:28:27,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:27,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-11-15 20:28:27,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1486, Unknown=3, NotChecked=0, Total=1722 [2019-11-15 20:28:27,422 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 42 states. [2019-11-15 20:28:28,549 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-11-15 20:28:29,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:29,475 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2019-11-15 20:28:29,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-15 20:28:29,476 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 49 [2019-11-15 20:28:29,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:29,477 INFO L225 Difference]: With dead ends: 146 [2019-11-15 20:28:29,477 INFO L226 Difference]: Without dead ends: 146 [2019-11-15 20:28:29,478 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=611, Invalid=3292, Unknown=3, NotChecked=0, Total=3906 [2019-11-15 20:28:29,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-15 20:28:29,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 108. [2019-11-15 20:28:29,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-15 20:28:29,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2019-11-15 20:28:29,481 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 49 [2019-11-15 20:28:29,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:29,482 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2019-11-15 20:28:29,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-11-15 20:28:29,482 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2019-11-15 20:28:29,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 20:28:29,483 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:29,483 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:29,685 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:28:29,686 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION]=== [2019-11-15 20:28:29,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:29,686 INFO L82 PathProgramCache]: Analyzing trace with hash -92549818, now seen corresponding path program 1 times [2019-11-15 20:28:29,686 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:29,686 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340808597] [2019-11-15 20:28:29,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:29,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:29,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:30,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:28:30,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340808597] [2019-11-15 20:28:30,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455738888] [2019-11-15 20:28:30,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45856237-9449-4991-a601-0f7b16f143b7/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 20:28:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:30,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 70 conjunts are in the unsatisfiable core [2019-11-15 20:28:30,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:28:30,419 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_63|], 3=[|v_#valid_82|]} [2019-11-15 20:28:30,422 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 20:28:30,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:30,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:30,462 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:30,463 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 20:28:30,463 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:30,495 INFO L567 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2019-11-15 20:28:30,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:28:30,496 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2019-11-15 20:28:30,560 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 20:28:30,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:30,606 INFO L567 ElimStorePlain]: treesize reduction 5, result has 90.4 percent of original size [2019-11-15 20:28:30,611 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 20:28:30,612 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:30,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:30,633 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 20:28:30,633 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:48 [2019-11-15 20:28:30,780 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:30,780 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 69 treesize of output 75 [2019-11-15 20:28:30,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:30,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:30,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:30,783 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 20:28:30,869 INFO L567 ElimStorePlain]: treesize reduction 232, result has 26.3 percent of original size [2019-11-15 20:28:30,878 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 68 treesize of output 63 [2019-11-15 20:28:30,878 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:30,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:30,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:28:30,905 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:90, output treesize:74 [2019-11-15 20:28:31,171 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:31,172 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 39 treesize of output 63 [2019-11-15 20:28:31,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:31,245 INFO L567 ElimStorePlain]: treesize reduction 29, result has 76.8 percent of original size [2019-11-15 20:28:31,281 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:31,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 116 [2019-11-15 20:28:31,283 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:31,336 INFO L567 ElimStorePlain]: treesize reduction 46, result has 62.9 percent of original size [2019-11-15 20:28:31,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:31,337 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 20:28:31,337 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:107, output treesize:78 [2019-11-15 20:28:31,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:31,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:31,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 20:28:31,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:31,490 INFO L567 ElimStorePlain]: treesize reduction 7, result has 91.3 percent of original size [2019-11-15 20:28:31,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:31,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 20:28:31,494 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:31,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:31,509 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:28:31,509 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:54 [2019-11-15 20:28:31,511 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_64|], 3=[|v_#valid_83|]} [2019-11-15 20:28:31,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:31,515 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 20:28:31,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:31,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:31,545 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:31,546 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 20:28:31,546 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:31,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:31,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:28:31,574 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:57 [2019-11-15 20:28:31,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 20:28:31,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:31,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:31,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 20:28:31,688 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:31,744 INFO L567 ElimStorePlain]: treesize reduction 4, result has 93.0 percent of original size [2019-11-15 20:28:31,745 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 20:28:31,745 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:51 [2019-11-15 20:28:31,858 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_57|], 6=[|v_#memory_$Pointer$.base_67|]} [2019-11-15 20:28:31,864 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2019-11-15 20:28:31,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:31,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:31,915 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:31,915 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 67 treesize of output 116 [2019-11-15 20:28:31,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:31,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:31,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:31,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:31,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:31,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:31,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:31,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:31,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:31,921 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:32,007 INFO L567 ElimStorePlain]: treesize reduction 310, result has 20.1 percent of original size [2019-11-15 20:28:32,008 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 20:28:32,008 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:77 [2019-11-15 20:28:32,234 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_58|], 12=[|v_#memory_$Pointer$.base_68|]} [2019-11-15 20:28:32,261 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:32,261 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 68 [2019-11-15 20:28:32,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:32,335 INFO L567 ElimStorePlain]: treesize reduction 30, result has 81.0 percent of original size [2019-11-15 20:28:32,421 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:32,421 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 184 [2019-11-15 20:28:32,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:32,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:32,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:32,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:32,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:32,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:32,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:32,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:32,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:32,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:32,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:32,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:32,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:32,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:32,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:32,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:32,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:32,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:32,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:32,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:32,433 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:28:32,550 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2019-11-15 20:28:32,550 INFO L567 ElimStorePlain]: treesize reduction 86, result has 48.5 percent of original size [2019-11-15 20:28:32,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:32,551 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 20:28:32,551 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:132, output treesize:90 [2019-11-15 20:28:32,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:32,690 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_59|], 12=[|v_#memory_$Pointer$.base_69|]} [2019-11-15 20:28:32,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:32,700 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 29 [2019-11-15 20:28:32,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:32,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:32,837 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-11-15 20:28:32,838 INFO L341 Elim1Store]: treesize reduction 50, result has 66.2 percent of original size [2019-11-15 20:28:32,838 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 124 treesize of output 147 [2019-11-15 20:28:32,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:32,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:32,840 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:32,888 INFO L567 ElimStorePlain]: treesize reduction 112, result has 44.8 percent of original size [2019-11-15 20:28:32,889 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 20:28:32,889 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:177, output treesize:91 [2019-11-15 20:28:33,093 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 5=[|#memory_$Pointer$.base|]} [2019-11-15 20:28:33,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2019-11-15 20:28:33,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:33,118 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:33,142 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:33,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 63 [2019-11-15 20:28:33,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:33,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:33,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:33,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:33,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:33,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:33,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:33,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:33,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:33,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:33,147 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:28:33,175 INFO L567 ElimStorePlain]: treesize reduction 28, result has 48.1 percent of original size [2019-11-15 20:28:33,175 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 20:28:33,176 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:102, output treesize:18 [2019-11-15 20:28:33,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:28:33,351 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:28:33,351 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 41 [2019-11-15 20:28:33,352 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200009493] [2019-11-15 20:28:33,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-11-15 20:28:33,353 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:28:33,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-11-15 20:28:33,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1509, Unknown=2, NotChecked=0, Total=1722 [2019-11-15 20:28:33,354 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 42 states. [2019-11-15 20:28:34,163 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-11-15 20:28:36,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:28:36,130 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2019-11-15 20:28:36,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-15 20:28:36,130 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 49 [2019-11-15 20:28:36,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:28:36,131 INFO L225 Difference]: With dead ends: 148 [2019-11-15 20:28:36,131 INFO L226 Difference]: Without dead ends: 148 [2019-11-15 20:28:36,133 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1042 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=555, Invalid=3473, Unknown=4, NotChecked=0, Total=4032 [2019-11-15 20:28:36,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-15 20:28:36,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 110. [2019-11-15 20:28:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-15 20:28:36,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2019-11-15 20:28:36,136 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 49 [2019-11-15 20:28:36,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:28:36,136 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2019-11-15 20:28:36,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-11-15 20:28:36,136 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2019-11-15 20:28:36,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 20:28:36,137 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:28:36,137 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:28:36,337 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:28:36,338 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION]=== [2019-11-15 20:28:36,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:28:36,338 INFO L82 PathProgramCache]: Analyzing trace with hash 433889493, now seen corresponding path program 3 times [2019-11-15 20:28:36,338 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:28:36,338 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7017864] [2019-11-15 20:28:36,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:36,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:28:36,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:28:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:28:36,777 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:28:36,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7017864] [2019-11-15 20:28:36,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928986142] [2019-11-15 20:28:36,777 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45856237-9449-4991-a601-0f7b16f143b7/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 20:28:37,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 20:28:37,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:28:37,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-15 20:28:37,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:28:37,207 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:37,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 42 [2019-11-15 20:28:37,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:37,240 INFO L567 ElimStorePlain]: treesize reduction 16, result has 66.0 percent of original size [2019-11-15 20:28:37,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:28:37,240 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:31 [2019-11-15 20:28:37,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:37,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:37,315 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 41 treesize of output 25 [2019-11-15 20:28:37,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:37,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:37,363 INFO L341 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-11-15 20:28:37,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 51 [2019-11-15 20:28:37,364 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:37,432 INFO L567 ElimStorePlain]: treesize reduction 12, result has 82.4 percent of original size [2019-11-15 20:28:37,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 20:28:37,432 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:84, output treesize:56 [2019-11-15 20:28:37,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:37,531 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:37,531 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 34 treesize of output 56 [2019-11-15 20:28:37,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:37,566 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:37,567 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 35 treesize of output 57 [2019-11-15 20:28:37,567 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:37,597 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:37,598 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 33 treesize of output 55 [2019-11-15 20:28:37,598 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:37,722 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-11-15 20:28:37,722 INFO L567 ElimStorePlain]: treesize reduction 42, result has 69.8 percent of original size [2019-11-15 20:28:37,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-11-15 20:28:37,723 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:103, output treesize:97 [2019-11-15 20:28:37,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:37,872 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:37,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 82 [2019-11-15 20:28:37,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:37,878 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-15 20:28:37,878 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:37,884 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 50 treesize of output 42 [2019-11-15 20:28:37,884 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:37,966 INFO L567 ElimStorePlain]: treesize reduction 41, result has 64.7 percent of original size [2019-11-15 20:28:37,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 20:28:37,966 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:154, output treesize:77 [2019-11-15 20:28:38,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:38,120 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:38,120 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 74 [2019-11-15 20:28:38,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:38,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:38,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:38,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:38,167 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:38,167 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 123 [2019-11-15 20:28:38,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:38,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:38,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:38,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:38,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:38,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:38,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:38,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:38,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:38,171 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:38,339 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 37 [2019-11-15 20:28:38,339 INFO L567 ElimStorePlain]: treesize reduction 550, result has 16.2 percent of original size [2019-11-15 20:28:38,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-15 20:28:38,340 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:119, output treesize:103 [2019-11-15 20:28:38,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:38,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:38,736 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:38,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 121 [2019-11-15 20:28:38,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:38,866 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-15 20:28:38,866 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:38,867 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 186 [2019-11-15 20:28:38,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:38,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:38,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:38,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:38,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:38,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:38,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:38,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:38,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:38,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:38,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:38,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:38,873 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:28:39,016 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 51 [2019-11-15 20:28:39,016 INFO L567 ElimStorePlain]: treesize reduction 136, result has 47.1 percent of original size [2019-11-15 20:28:39,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,017 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 2 xjuncts. [2019-11-15 20:28:39,017 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:150, output treesize:96 [2019-11-15 20:28:39,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:39,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:39,215 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:39,216 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 68 [2019-11-15 20:28:39,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:39,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:39,252 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:39,252 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 71 treesize of output 102 [2019-11-15 20:28:39,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:39,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,256 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:39,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:28:39,351 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:28:39,352 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 104 treesize of output 175 [2019-11-15 20:28:39,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:39,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:39,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:39,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:28:39,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,412 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:28:39,699 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 42 [2019-11-15 20:28:39,699 INFO L567 ElimStorePlain]: treesize reduction 3432, result has 4.7 percent of original size [2019-11-15 20:28:39,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:39,700 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-15 20:28:39,700 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:247, output treesize:169 [2019-11-15 20:28:39,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:28:55,920 WARN L191 SmtUtils]: Spent 16.11 s on a formula simplification that was a NOOP. DAG size: 52 [2019-11-15 20:28:55,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:00,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:00,406 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:29:00,406 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 42 [2019-11-15 20:29:00,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:29:00,433 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:29:00,433 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 77 [2019-11-15 20:29:00,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:00,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:00,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:00,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:00,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:00,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:29:00,437 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:29:00,494 INFO L567 ElimStorePlain]: treesize reduction 44, result has 55.6 percent of original size [2019-11-15 20:29:00,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-15 20:29:00,494 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:119, output treesize:36 [2019-11-15 20:29:00,619 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:29:00,619 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:29:00,619 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2019-11-15 20:29:00,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508442352] [2019-11-15 20:29:00,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-15 20:29:00,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:29:00,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-15 20:29:00,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1390, Unknown=1, NotChecked=0, Total=1560 [2019-11-15 20:29:00,620 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand 40 states. [2019-11-15 20:29:27,581 WARN L191 SmtUtils]: Spent 26.32 s on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-11-15 20:29:47,109 WARN L191 SmtUtils]: Spent 19.37 s on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-11-15 20:29:47,812 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-11-15 20:30:18,267 WARN L191 SmtUtils]: Spent 30.22 s on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-11-15 20:30:40,290 WARN L191 SmtUtils]: Spent 21.85 s on a formula simplification. DAG size of input: 89 DAG size of output: 56 [2019-11-15 20:31:09,079 WARN L191 SmtUtils]: Spent 28.22 s on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-11-15 20:31:45,691 WARN L191 SmtUtils]: Spent 36.33 s on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-11-15 20:31:45,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:31:45,832 INFO L93 Difference]: Finished difference Result 183 states and 192 transitions. [2019-11-15 20:31:45,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-15 20:31:45,833 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 52 [2019-11-15 20:31:45,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:31:45,834 INFO L225 Difference]: With dead ends: 183 [2019-11-15 20:31:45,834 INFO L226 Difference]: Without dead ends: 183 [2019-11-15 20:31:45,835 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 185.7s TimeCoverageRelationStatistics Valid=652, Invalid=3637, Unknown=1, NotChecked=0, Total=4290 [2019-11-15 20:31:45,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-15 20:31:45,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 138. [2019-11-15 20:31:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-15 20:31:45,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2019-11-15 20:31:45,838 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 52 [2019-11-15 20:31:45,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:31:45,838 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2019-11-15 20:31:45,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-15 20:31:45,839 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2019-11-15 20:31:45,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 20:31:45,839 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:31:45,840 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:31:46,050 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:31:46,050 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION]=== [2019-11-15 20:31:46,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:46,050 INFO L82 PathProgramCache]: Analyzing trace with hash 433889494, now seen corresponding path program 2 times [2019-11-15 20:31:46,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:31:46,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848644279] [2019-11-15 20:31:46,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:46,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:46,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:31:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:46,944 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-11-15 20:31:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:47,397 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:31:47,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848644279] [2019-11-15 20:31:47,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924653746] [2019-11-15 20:31:47,398 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45856237-9449-4991-a601-0f7b16f143b7/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 20:31:47,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:31:47,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:31:47,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 62 conjunts are in the unsatisfiable core [2019-11-15 20:31:47,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:47,577 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 20:31:47,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:47,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:47,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:31:47,579 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-15 20:31:47,657 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:47,657 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 20:31:47,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:47,687 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-15 20:31:47,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:31:47,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-15 20:31:47,726 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 20:31:47,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:47,758 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-11-15 20:31:47,761 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 20:31:47,761 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:47,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:47,773 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 20:31:47,773 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:36 [2019-11-15 20:31:47,840 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 20:31:47,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:47,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:47,870 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:47,870 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 52 treesize of output 66 [2019-11-15 20:31:47,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:31:47,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:47,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:47,872 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 20:31:47,924 INFO L567 ElimStorePlain]: treesize reduction 180, result has 25.9 percent of original size [2019-11-15 20:31:47,924 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 20:31:47,924 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:62 [2019-11-15 20:31:48,094 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:48,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, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 119 [2019-11-15 20:31:48,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:48,157 INFO L567 ElimStorePlain]: treesize reduction 54, result has 57.8 percent of original size [2019-11-15 20:31:48,171 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:48,171 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 28 treesize of output 52 [2019-11-15 20:31:48,171 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:48,216 INFO L567 ElimStorePlain]: treesize reduction 16, result has 82.6 percent of original size [2019-11-15 20:31:48,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:48,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:48,217 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 20:31:48,217 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:88, output treesize:46 [2019-11-15 20:31:48,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:48,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 20:31:48,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:48,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:48,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:48,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 20:31:48,283 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:48,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:48,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:31:48,297 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-15 20:31:48,339 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_65|], 3=[|v_#valid_87|]} [2019-11-15 20:31:48,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:48,343 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-15 20:31:48,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:48,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:48,374 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:48,374 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 20:31:48,375 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:48,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:48,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:31:48,391 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:56 [2019-11-15 20:31:48,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 20:31:48,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:48,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:48,498 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 20:31:48,498 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:48,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:48,517 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 20:31:48,517 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:78, output treesize:54 [2019-11-15 20:31:48,610 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_65|], 6=[|v_#memory_$Pointer$.base_81|]} [2019-11-15 20:31:48,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 20:31:48,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:48,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:48,689 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:48,690 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 67 treesize of output 108 [2019-11-15 20:31:48,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:31:48,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:48,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:31:48,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:48,692 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 20:31:48,771 INFO L567 ElimStorePlain]: treesize reduction 488, result has 14.4 percent of original size [2019-11-15 20:31:48,772 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 20:31:48,772 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:80 [2019-11-15 20:31:49,039 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_66|], 12=[|v_#memory_$Pointer$.base_82|]} [2019-11-15 20:31:49,058 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:49,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 68 [2019-11-15 20:31:49,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:49,139 INFO L567 ElimStorePlain]: treesize reduction 24, result has 85.7 percent of original size [2019-11-15 20:31:49,239 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:49,240 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 200 [2019-11-15 20:31:49,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:49,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:49,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:49,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:49,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:31:49,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:49,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:49,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:49,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:49,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:49,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:49,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:31:49,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:49,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:49,249 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:31:49,367 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2019-11-15 20:31:49,367 INFO L567 ElimStorePlain]: treesize reduction 90, result has 50.8 percent of original size [2019-11-15 20:31:49,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:49,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:49,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 20:31:49,370 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:142, output treesize:106 [2019-11-15 20:31:49,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:49,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:49,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:49,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:49,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:49,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:49,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:49,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:49,604 INFO L392 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_67|], 20=[|v_#memory_$Pointer$.base_83|]} [2019-11-15 20:31:49,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:49,657 INFO L341 Elim1Store]: treesize reduction 40, result has 47.4 percent of original size [2019-11-15 20:31:49,658 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 2 case distinctions, treesize of input 225 treesize of output 209 [2019-11-15 20:31:49,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:49,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:49,667 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 187 treesize of output 150 [2019-11-15 20:31:49,667 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:49,730 INFO L567 ElimStorePlain]: treesize reduction 213, result has 40.3 percent of original size [2019-11-15 20:31:49,822 INFO L341 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-11-15 20:31:49,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 157 [2019-11-15 20:31:49,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:49,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:31:49,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:31:49,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:49,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:49,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:31:49,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:49,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:49,828 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 7 xjuncts. [2019-11-15 20:31:49,919 INFO L567 ElimStorePlain]: treesize reduction 1145, result has 8.2 percent of original size [2019-11-15 20:31:49,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 20:31:49,920 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:413, output treesize:101 [2019-11-15 20:31:50,042 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2019-11-15 20:31:50,050 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2019-11-15 20:31:50,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:50,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:50,107 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:50,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 73 [2019-11-15 20:31:50,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:50,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:50,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:50,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:50,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:50,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:50,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:50,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:50,111 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:31:50,145 INFO L567 ElimStorePlain]: treesize reduction 36, result has 46.3 percent of original size [2019-11-15 20:31:50,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:31:50,146 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:115, output treesize:18 [2019-11-15 20:31:50,252 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:31:50,252 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:31:50,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 44 [2019-11-15 20:31:50,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546862827] [2019-11-15 20:31:50,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-11-15 20:31:50,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:31:50,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-11-15 20:31:50,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1787, Unknown=0, NotChecked=0, Total=1980 [2019-11-15 20:31:50,254 INFO L87 Difference]: Start difference. First operand 138 states and 148 transitions. Second operand 45 states. [2019-11-15 20:31:52,548 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-11-15 20:31:55,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:31:55,042 INFO L93 Difference]: Finished difference Result 206 states and 220 transitions. [2019-11-15 20:31:55,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-11-15 20:31:55,042 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 52 [2019-11-15 20:31:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:31:55,043 INFO L225 Difference]: With dead ends: 206 [2019-11-15 20:31:55,043 INFO L226 Difference]: Without dead ends: 206 [2019-11-15 20:31:55,045 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1918 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=910, Invalid=5410, Unknown=0, NotChecked=0, Total=6320 [2019-11-15 20:31:55,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-11-15 20:31:55,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 120. [2019-11-15 20:31:55,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-15 20:31:55,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2019-11-15 20:31:55,048 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 52 [2019-11-15 20:31:55,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:31:55,048 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2019-11-15 20:31:55,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-11-15 20:31:55,048 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2019-11-15 20:31:55,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 20:31:55,049 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:31:55,049 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:31:55,252 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:31:55,257 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION]=== [2019-11-15 20:31:55,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:31:55,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1849276729, now seen corresponding path program 1 times [2019-11-15 20:31:55,261 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:31:55,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940069055] [2019-11-15 20:31:55,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:55,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:31:55,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:31:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:55,810 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:31:55,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940069055] [2019-11-15 20:31:55,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492989713] [2019-11-15 20:31:55,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45856237-9449-4991-a601-0f7b16f143b7/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 20:31:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:31:55,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 80 conjunts are in the unsatisfiable core [2019-11-15 20:31:55,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:31:55,965 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 20:31:55,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:55,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:55,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:31:55,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 20:31:56,051 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_67|], 3=[|v_#valid_88|]} [2019-11-15 20:31:56,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:56,054 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 12 treesize of output 14 [2019-11-15 20:31:56,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:56,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:56,083 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:56,083 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 20:31:56,084 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:56,113 INFO L567 ElimStorePlain]: treesize reduction 14, result has 72.5 percent of original size [2019-11-15 20:31:56,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:31:56,113 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:37 [2019-11-15 20:31:56,161 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 20:31:56,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:56,193 INFO L567 ElimStorePlain]: treesize reduction 5, result has 91.2 percent of original size [2019-11-15 20:31:56,196 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 20:31:56,196 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:56,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:56,212 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 20:31:56,212 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:53 [2019-11-15 20:31:56,309 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 20:31:56,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:56,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:56,347 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:56,347 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 20:31:56,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:31:56,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:56,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:56,349 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 20:31:56,411 INFO L567 ElimStorePlain]: treesize reduction 208, result has 27.8 percent of original size [2019-11-15 20:31:56,412 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 20:31:56,412 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:79 [2019-11-15 20:31:56,618 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:56,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 39 treesize of output 63 [2019-11-15 20:31:56,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:56,679 INFO L567 ElimStorePlain]: treesize reduction 26, result has 79.5 percent of original size [2019-11-15 20:31:56,711 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:56,711 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 116 [2019-11-15 20:31:56,711 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:56,768 INFO L567 ElimStorePlain]: treesize reduction 46, result has 64.3 percent of original size [2019-11-15 20:31:56,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:56,769 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 20:31:56,770 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:109, output treesize:83 [2019-11-15 20:31:56,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:56,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:56,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 20:31:56,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:56,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:56,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:56,885 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 20:31:56,885 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:56,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:56,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:31:56,903 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:97, output treesize:59 [2019-11-15 20:31:56,904 INFO L392 ElimStorePlain]: Different costs {3=[|v_#length_68|], 6=[|v_#valid_89|]} [2019-11-15 20:31:56,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:56,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:56,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, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-11-15 20:31:56,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:56,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:56,962 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:56,962 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 20:31:56,963 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:57,022 INFO L567 ElimStorePlain]: treesize reduction 28, result has 73.3 percent of original size [2019-11-15 20:31:57,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:31:57,023 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:77 [2019-11-15 20:31:57,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, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 20:31:57,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:57,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:57,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 20:31:57,136 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:57,183 INFO L567 ElimStorePlain]: treesize reduction 4, result has 94.8 percent of original size [2019-11-15 20:31:57,183 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 20:31:57,183 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:99, output treesize:75 [2019-11-15 20:31:57,313 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_73|], 6=[|v_#memory_$Pointer$.base_89|]} [2019-11-15 20:31:57,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2019-11-15 20:31:57,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:57,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:57,380 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:57,380 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 76 treesize of output 121 [2019-11-15 20:31:57,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:31:57,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:57,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:31:57,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:57,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:57,383 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 20:31:57,462 INFO L567 ElimStorePlain]: treesize reduction 474, result has 17.7 percent of original size [2019-11-15 20:31:57,463 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 20:31:57,463 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:117, output treesize:101 [2019-11-15 20:31:57,700 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_74|], 12=[|v_#memory_$Pointer$.base_90|]} [2019-11-15 20:31:57,714 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:57,715 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 68 [2019-11-15 20:31:57,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:57,791 INFO L567 ElimStorePlain]: treesize reduction 30, result has 84.5 percent of original size [2019-11-15 20:31:57,861 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:57,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 133 treesize of output 194 [2019-11-15 20:31:57,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:31:57,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:57,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:57,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:57,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:57,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:57,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:57,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:57,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:57,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:57,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:57,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:31:57,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:57,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:57,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:57,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:57,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:57,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:57,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:57,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:57,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:57,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:57,869 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:31:57,956 INFO L567 ElimStorePlain]: treesize reduction 86, result has 54.7 percent of original size [2019-11-15 20:31:57,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:57,957 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 20:31:57,957 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:167, output treesize:117 [2019-11-15 20:31:57,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:58,067 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_75|], 12=[|v_#memory_$Pointer$.base_91|]} [2019-11-15 20:31:58,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:58,072 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 29 [2019-11-15 20:31:58,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:58,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:58,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:58,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:31:58,124 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:58,124 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 120 [2019-11-15 20:31:58,125 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:58,185 INFO L567 ElimStorePlain]: treesize reduction 104, result has 57.6 percent of original size [2019-11-15 20:31:58,186 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 20:31:58,186 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:227, output treesize:141 [2019-11-15 20:31:58,367 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2019-11-15 20:31:58,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:58,417 INFO L567 ElimStorePlain]: treesize reduction 3, result has 97.7 percent of original size [2019-11-15 20:31:58,417 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 20:31:58,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:158, output treesize:129 [2019-11-15 20:31:58,792 INFO L341 Elim1Store]: treesize reduction 12, result has 75.5 percent of original size [2019-11-15 20:31:58,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 56 [2019-11-15 20:31:58,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:31:58,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:31:58,807 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 20:31:58,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:110, output treesize:67 [2019-11-15 20:31:58,883 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:31:58,883 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 20:31:58,909 INFO L341 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2019-11-15 20:31:58,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 54 [2019-11-15 20:31:58,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:58,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:58,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:58,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:58,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:58,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:31:58,912 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 20:31:58,951 INFO L567 ElimStorePlain]: treesize reduction 12, result has 78.6 percent of original size [2019-11-15 20:31:58,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 20:31:58,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:74, output treesize:32 [2019-11-15 20:31:59,101 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:31:59,101 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:31:59,101 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 47 [2019-11-15 20:31:59,101 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687510990] [2019-11-15 20:31:59,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-11-15 20:31:59,102 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:31:59,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-11-15 20:31:59,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=2004, Unknown=2, NotChecked=0, Total=2256 [2019-11-15 20:31:59,103 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 48 states. [2019-11-15 20:32:01,769 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 81 [2019-11-15 20:32:02,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:32:02,632 INFO L93 Difference]: Finished difference Result 182 states and 192 transitions. [2019-11-15 20:32:02,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-15 20:32:02,632 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 53 [2019-11-15 20:32:02,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:32:02,633 INFO L225 Difference]: With dead ends: 182 [2019-11-15 20:32:02,633 INFO L226 Difference]: Without dead ends: 182 [2019-11-15 20:32:02,635 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1283 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=681, Invalid=4573, Unknown=2, NotChecked=0, Total=5256 [2019-11-15 20:32:02,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-15 20:32:02,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 142. [2019-11-15 20:32:02,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-15 20:32:02,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2019-11-15 20:32:02,638 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 53 [2019-11-15 20:32:02,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:32:02,638 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2019-11-15 20:32:02,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-11-15 20:32:02,639 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2019-11-15 20:32:02,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 20:32:02,639 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:32:02,639 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:32:02,843 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:32:02,843 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION]=== [2019-11-15 20:32:02,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:02,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1849276728, now seen corresponding path program 1 times [2019-11-15 20:32:02,844 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:02,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37723506] [2019-11-15 20:32:02,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:02,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:02,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:32:03,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37723506] [2019-11-15 20:32:03,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847112607] [2019-11-15 20:32:03,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_45856237-9449-4991-a601-0f7b16f143b7/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 20:32:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:32:03,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 71 conjunts are in the unsatisfiable core [2019-11-15 20:32:03,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:32:03,838 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:03,839 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 20:32:03,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:03,865 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-15 20:32:03,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:32:03,866 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-15 20:32:03,918 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 20:32:03,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:03,948 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-11-15 20:32:03,951 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 20:32:03,951 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:03,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:03,965 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 20:32:03,965 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:29 [2019-11-15 20:32:04,073 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_77|], 2=[|v_#memory_$Pointer$.base_93|]} [2019-11-15 20:32:04,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-15 20:32:04,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:04,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:04,117 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:04,117 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 52 treesize of output 66 [2019-11-15 20:32:04,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:04,118 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 20:32:04,145 INFO L567 ElimStorePlain]: treesize reduction 48, result has 53.8 percent of original size [2019-11-15 20:32:04,146 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 20:32:04,146 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:55 [2019-11-15 20:32:04,330 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:04,330 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 62 treesize of output 119 [2019-11-15 20:32:04,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:04,379 INFO L567 ElimStorePlain]: treesize reduction 54, result has 56.8 percent of original size [2019-11-15 20:32:04,391 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:04,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 52 [2019-11-15 20:32:04,392 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:04,433 INFO L567 ElimStorePlain]: treesize reduction 16, result has 82.0 percent of original size [2019-11-15 20:32:04,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:04,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:04,434 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 20:32:04,434 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:43 [2019-11-15 20:32:04,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:32:04,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 20:32:04,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:04,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:04,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:32:04,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 20:32:04,505 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:04,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:04,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:32:04,516 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:43 [2019-11-15 20:32:04,517 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_69|], 3=[|v_#valid_91|]} [2019-11-15 20:32:04,520 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 20:32:04,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:04,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:04,548 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:04,549 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 20:32:04,549 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:04,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:04,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:32:04,563 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:49 [2019-11-15 20:32:04,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 20:32:04,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:04,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:04,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 20:32:04,630 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:04,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:04,643 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 20:32:04,643 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:51 [2019-11-15 20:32:04,737 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 34 [2019-11-15 20:32:04,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:04,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:04,783 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:04,783 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 67 treesize of output 108 [2019-11-15 20:32:04,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:32:04,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:04,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:04,785 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 20:32:04,826 INFO L567 ElimStorePlain]: treesize reduction 110, result has 41.5 percent of original size [2019-11-15 20:32:04,827 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 20:32:04,827 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:77 [2019-11-15 20:32:05,103 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:05,103 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 145 treesize of output 250 [2019-11-15 20:32:05,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:32:05,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:32:05,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:32:05,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:32:05,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:32:05,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:32:05,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:32:05,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:32:05,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:32:05,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:32:05,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:32:05,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:32:05,121 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 20:32:05,231 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 49 [2019-11-15 20:32:05,231 INFO L567 ElimStorePlain]: treesize reduction 134, result has 51.3 percent of original size [2019-11-15 20:32:05,314 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:05,314 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 200 [2019-11-15 20:32:05,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:32:05,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:32:05,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,322 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:32:05,396 INFO L567 ElimStorePlain]: treesize reduction 90, result has 50.0 percent of original size [2019-11-15 20:32:05,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:32:05,397 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:164, output treesize:70 [2019-11-15 20:32:05,523 INFO L341 Elim1Store]: treesize reduction 62, result has 66.3 percent of original size [2019-11-15 20:32:05,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 217 treesize of output 264 [2019-11-15 20:32:05,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:32:05,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:32:05,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:32:05,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:32:05,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 9 xjuncts. [2019-11-15 20:32:05,602 INFO L567 ElimStorePlain]: treesize reduction 1519, result has 10.1 percent of original size [2019-11-15 20:32:05,687 INFO L341 Elim1Store]: treesize reduction 54, result has 69.3 percent of original size [2019-11-15 20:32:05,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 170 treesize of output 181 [2019-11-15 20:32:05,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:32:05,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:05,690 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 20:32:05,738 INFO L567 ElimStorePlain]: treesize reduction 502, result has 18.6 percent of original size [2019-11-15 20:32:05,738 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 20:32:05,738 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:225, output treesize:115 [2019-11-15 20:32:06,047 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:06,047 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 103 [2019-11-15 20:32:06,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:06,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:06,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:06,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:06,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:06,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:06,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:06,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:32:06,051 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 20:32:06,083 INFO L567 ElimStorePlain]: treesize reduction 44, result has 51.6 percent of original size [2019-11-15 20:32:06,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2019-11-15 20:32:06,085 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:32:06,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:32:06,093 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 20:32:06,093 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:145, output treesize:9 [2019-11-15 20:32:06,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:32:06,115 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:32:06,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 40 [2019-11-15 20:32:06,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330070722] [2019-11-15 20:32:06,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-15 20:32:06,115 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:32:06,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-15 20:32:06,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1521, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 20:32:06,116 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 41 states. [2019-11-15 20:32:09,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:32:09,453 INFO L93 Difference]: Finished difference Result 177 states and 189 transitions. [2019-11-15 20:32:09,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-15 20:32:09,453 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 53 [2019-11-15 20:32:09,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:32:09,454 INFO L225 Difference]: With dead ends: 177 [2019-11-15 20:32:09,454 INFO L226 Difference]: Without dead ends: 177 [2019-11-15 20:32:09,455 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=354, Invalid=3678, Unknown=0, NotChecked=0, Total=4032 [2019-11-15 20:32:09,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-15 20:32:09,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 142. [2019-11-15 20:32:09,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-15 20:32:09,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2019-11-15 20:32:09,457 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 152 transitions. Word has length 53 [2019-11-15 20:32:09,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:32:09,457 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 152 transitions. [2019-11-15 20:32:09,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-15 20:32:09,457 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2019-11-15 20:32:09,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 20:32:09,458 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:32:09,458 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:32:09,658 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:32:09,659 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION]=== [2019-11-15 20:32:09,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:32:09,659 INFO L82 PathProgramCache]: Analyzing trace with hash 961527277, now seen corresponding path program 1 times [2019-11-15 20:32:09,659 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:32:09,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175720797] [2019-11-15 20:32:09,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:09,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:32:09,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:32:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:32:09,742 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:32:09,742 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 20:32:09,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:32:09 BoogieIcfgContainer [2019-11-15 20:32:09,811 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:32:09,811 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:32:09,812 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:32:09,812 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:32:09,812 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:28:03" (3/4) ... [2019-11-15 20:32:09,814 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 20:32:09,885 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_45856237-9449-4991-a601-0f7b16f143b7/bin/uautomizer/witness.graphml [2019-11-15 20:32:09,885 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:32:09,887 INFO L168 Benchmark]: Toolchain (without parser) took 248121.61 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 359.7 MB). Free memory was 944.8 MB in the beginning and 1.0 GB in the end (delta: -80.9 MB). Peak memory consumption was 278.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:32:09,887 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:32:09,887 INFO L168 Benchmark]: CACSL2BoogieTranslator took 570.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:32:09,888 INFO L168 Benchmark]: Boogie Preprocessor took 58.22 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 20:32:09,888 INFO L168 Benchmark]: RCFGBuilder took 876.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.7 MB). Peak memory consumption was 66.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:32:09,888 INFO L168 Benchmark]: TraceAbstraction took 246538.37 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 224.9 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.9 MB). Peak memory consumption was 231.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:32:09,888 INFO L168 Benchmark]: Witness Printer took 74.36 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:32:09,890 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 570.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.22 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 876.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.7 MB). Peak memory consumption was 66.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 246538.37 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 224.9 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.9 MB). Peak memory consumption was 231.8 MB. Max. memory is 11.5 GB. * Witness Printer took 74.36 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1040]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L994] SLL* list = malloc(sizeof(SLL)); VAL [list={5:0}, malloc(sizeof(SLL))={5:0}] [L995] list->next = ((void*)0) VAL [list={5:0}, malloc(sizeof(SLL))={5:0}] [L996] list->prev = ((void*)0) VAL [list={5:0}, malloc(sizeof(SLL))={5:0}] [L997] list->colour = BLACK VAL [list={5:0}, malloc(sizeof(SLL))={5:0}] [L999] SLL* end = list; VAL [end={5:0}, list={5:0}, malloc(sizeof(SLL))={5:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] end->next = malloc(sizeof(SLL)) VAL [end={5:0}, list={5:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1006] EXPR end->next VAL [end={5:0}, end->next={3:0}, list={5:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1006] end->next->prev = end VAL [end={5:0}, end->next={3:0}, list={5:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1007] EXPR end->next VAL [end={5:0}, end->next={3:0}, list={5:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1007] end = end->next [L1008] end->next = ((void*)0) VAL [end={3:0}, list={5:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1016] end->colour = RED VAL [end={3:0}, list={5:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1017] end->next = malloc(sizeof(SLL)) VAL [end={3:0}, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1018] EXPR end->next VAL [end={3:0}, end->next={2:0}, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1018] end->next->prev = end VAL [end={3:0}, end->next={2:0}, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1019] EXPR end->next VAL [end={3:0}, end->next={2:0}, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1019] end = end->next [L1020] end->next = ((void*)0) VAL [end={2:0}, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1021] end->colour = BLACK VAL [end={2:0}, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1025] end = ((void*)0) [L1026] end = list VAL [end={5:0}, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1029] COND FALSE !(!(((void*)0) != end)) VAL [end={5:0}, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1030] EXPR end->colour VAL [end={5:0}, end->colour=1, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1030] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE ((void*)0) != end VAL [end={5:0}, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1034] EXPR end->colour VAL [end={5:0}, end->colour=1, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1034] COND FALSE !(RED == end->colour) [L1040] EXPR end->next VAL [end={5:0}, end->next={3:0}, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1040] COND FALSE !(!(end->next)) [L1041] EXPR end->next VAL [end={5:0}, end->next={3:0}, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1041] end = end->next [L1032] COND TRUE ((void*)0) != end VAL [end={3:0}, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1034] EXPR end->colour VAL [end={3:0}, end->colour=0, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1034] COND TRUE RED == end->colour [L1036] EXPR end->next VAL [end={3:0}, end->next={2:0}, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1036] end = end->next [L1037] EXPR end->next VAL [end={2:0}, end->next={0:0}, list={5:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={5:0}, malloc(sizeof(SLL))={3:0}] [L1037] end = end->next [L1040] end->next - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 135 locations, 62 error locations. Result: UNSAFE, OverallTime: 246.4s, OverallIterations: 27, TraceHistogramMax: 3, AutomataDifference: 194.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1615 SDtfs, 5889 SDslu, 7794 SDs, 0 SdLazy, 19928 SolverSat, 1394 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 15.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1087 GetRequests, 371 SyntacticMatches, 21 SemanticMatches, 695 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8866 ImplicationChecksByTransitivity, 211.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 920 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 46.8s InterpolantComputationTime, 1351 NumberOfCodeBlocks, 1351 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1260 ConstructedInterpolants, 239 QuantifiedInterpolants, 1734868 SizeOfPredicates, 198 NumberOfNonLiveVariables, 2268 ConjunctsInSsa, 562 ConjunctsInUnsatCore, 36 InterpolantComputations, 16 PerfectInterpolantSequences, 19/167 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...