./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-optional-1.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_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-optional-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/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 497bfe83d1a123e7e085e38ee3eed2e663cc023e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-optional-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/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 497bfe83d1a123e7e085e38ee3eed2e663cc023e ..................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:53:56,881 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:53:56,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:53:56,897 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:53:56,898 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:53:56,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:53:56,901 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:53:56,911 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:53:56,916 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:53:56,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:53:56,922 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:53:56,924 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:53:56,925 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:53:56,927 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:53:56,928 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:53:56,929 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:53:56,930 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:53:56,933 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:53:56,936 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:53:56,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:53:56,944 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:53:56,946 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:53:56,949 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:53:56,950 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:53:56,954 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:53:56,954 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:53:56,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:53:56,957 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:53:56,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:53:56,958 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:53:56,958 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:53:56,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:53:56,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:53:56,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:53:56,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:53:56,962 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:53:56,963 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:53:56,963 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:53:56,963 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:53:56,964 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:53:56,965 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:53:56,966 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 21:53:56,995 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:53:57,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:53:57,008 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:53:57,008 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:53:57,008 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:53:57,009 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:53:57,009 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:53:57,009 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:53:57,009 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:53:57,010 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:53:57,010 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:53:57,010 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 21:53:57,010 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 21:53:57,011 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 21:53:57,011 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:53:57,011 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:53:57,011 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:53:57,012 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:53:57,012 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:53:57,012 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:53:57,012 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:53:57,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:53:57,013 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:53:57,013 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:53:57,013 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:53:57,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:53:57,014 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_bb7fdb38-92cd-49f2-863d-6e60742e32d1/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 -> 497bfe83d1a123e7e085e38ee3eed2e663cc023e [2019-11-15 21:53:57,040 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:53:57,053 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:53:57,059 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:53:57,061 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:53:57,062 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:53:57,062 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/../../sv-benchmarks/c/forester-heap/dll-optional-1.i [2019-11-15 21:53:57,133 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/data/c73b9e56b/c6007c85380d4332a26037a967b8ef35/FLAGb0d0e3296 [2019-11-15 21:53:57,639 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:53:57,639 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/sv-benchmarks/c/forester-heap/dll-optional-1.i [2019-11-15 21:53:57,656 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/data/c73b9e56b/c6007c85380d4332a26037a967b8ef35/FLAGb0d0e3296 [2019-11-15 21:53:57,893 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/data/c73b9e56b/c6007c85380d4332a26037a967b8ef35 [2019-11-15 21:53:57,895 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:53:57,897 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 21:53:57,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:53:57,898 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:53:57,901 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:53:57,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:53:57" (1/1) ... [2019-11-15 21:53:57,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6333d557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:57, skipping insertion in model container [2019-11-15 21:53:57,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:53:57" (1/1) ... [2019-11-15 21:53:57,913 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:53:57,967 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:53:58,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:53:58,351 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:53:58,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:53:58,463 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:53:58,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:58 WrapperNode [2019-11-15 21:53:58,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:53:58,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:53:58,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:53:58,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:53:58,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:58" (1/1) ... [2019-11-15 21:53:58,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:58" (1/1) ... [2019-11-15 21:53:58,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:58" (1/1) ... [2019-11-15 21:53:58,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:58" (1/1) ... [2019-11-15 21:53:58,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:58" (1/1) ... [2019-11-15 21:53:58,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:58" (1/1) ... [2019-11-15 21:53:58,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:58" (1/1) ... [2019-11-15 21:53:58,531 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:53:58,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:53:58,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:53:58,532 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:53:58,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:53:58,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 21:53:58,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:53:58,610 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 21:53:58,610 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 21:53:58,610 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 21:53:58,611 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 21:53:58,612 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 21:53:58,612 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 21:53:58,612 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 21:53:58,613 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 21:53:58,613 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 21:53:58,613 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 21:53:58,614 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 21:53:58,614 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 21:53:58,614 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 21:53:58,615 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 21:53:58,615 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 21:53:58,615 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 21:53:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 21:53:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 21:53:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 21:53:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 21:53:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 21:53:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 21:53:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 21:53:58,618 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 21:53:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 21:53:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 21:53:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 21:53:58,619 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 21:53:58,620 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 21:53:58,620 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 21:53:58,620 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 21:53:58,620 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 21:53:58,620 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 21:53:58,620 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 21:53:58,620 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 21:53:58,621 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 21:53:58,621 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 21:53:58,621 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 21:53:58,621 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 21:53:58,621 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 21:53:58,621 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 21:53:58,621 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 21:53:58,622 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 21:53:58,622 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 21:53:58,622 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 21:53:58,622 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 21:53:58,622 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 21:53:58,622 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 21:53:58,622 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 21:53:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 21:53:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 21:53:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 21:53:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 21:53:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 21:53:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 21:53:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 21:53:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 21:53:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 21:53:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 21:53:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 21:53:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 21:53:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 21:53:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 21:53:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 21:53:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 21:53:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 21:53:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 21:53:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 21:53:58,626 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 21:53:58,627 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 21:53:58,627 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 21:53:58,627 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 21:53:58,628 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 21:53:58,628 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 21:53:58,629 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 21:53:58,629 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 21:53:58,630 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 21:53:58,630 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 21:53:58,630 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 21:53:58,630 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 21:53:58,631 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 21:53:58,631 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 21:53:58,631 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 21:53:58,632 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 21:53:58,632 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 21:53:58,632 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 21:53:58,632 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 21:53:58,632 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 21:53:58,632 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 21:53:58,632 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 21:53:58,633 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 21:53:58,633 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 21:53:58,633 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 21:53:58,633 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 21:53:58,633 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 21:53:58,633 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 21:53:58,633 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 21:53:58,634 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 21:53:58,634 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 21:53:58,634 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 21:53:58,634 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 21:53:58,634 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 21:53:58,634 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 21:53:58,634 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 21:53:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 21:53:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 21:53:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 21:53:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:53:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:53:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:53:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:53:58,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:53:58,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:53:58,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 21:53:58,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:53:59,648 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:53:59,648 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 21:53:59,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:53:59 BoogieIcfgContainer [2019-11-15 21:53:59,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:53:59,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:53:59,651 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:53:59,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:53:59,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:53:57" (1/3) ... [2019-11-15 21:53:59,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55bea826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:53:59, skipping insertion in model container [2019-11-15 21:53:59,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:58" (2/3) ... [2019-11-15 21:53:59,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55bea826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:53:59, skipping insertion in model container [2019-11-15 21:53:59,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:53:59" (3/3) ... [2019-11-15 21:53:59,668 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2019-11-15 21:53:59,679 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:53:59,693 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-15 21:53:59,707 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-15 21:53:59,745 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:53:59,749 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 21:53:59,749 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:53:59,750 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:53:59,750 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:53:59,750 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:53:59,751 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:53:59,751 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:53:59,785 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2019-11-15 21:53:59,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 21:53:59,798 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:53:59,799 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:53:59,803 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 21:53:59,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:59,819 INFO L82 PathProgramCache]: Analyzing trace with hash -139040114, now seen corresponding path program 1 times [2019-11-15 21:53:59,828 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:59,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549863643] [2019-11-15 21:53:59,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:59,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:59,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:00,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:00,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549863643] [2019-11-15 21:54:00,019 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:00,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:54:00,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845245521] [2019-11-15 21:54:00,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:54:00,024 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:00,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:54:00,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:54:00,040 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 4 states. [2019-11-15 21:54:00,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:00,598 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2019-11-15 21:54:00,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:54:00,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 21:54:00,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:00,619 INFO L225 Difference]: With dead ends: 153 [2019-11-15 21:54:00,619 INFO L226 Difference]: Without dead ends: 149 [2019-11-15 21:54:00,624 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:54:00,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-15 21:54:00,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 143. [2019-11-15 21:54:00,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-15 21:54:00,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 155 transitions. [2019-11-15 21:54:00,703 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 155 transitions. Word has length 7 [2019-11-15 21:54:00,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:00,704 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 155 transitions. [2019-11-15 21:54:00,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:54:00,704 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 155 transitions. [2019-11-15 21:54:00,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 21:54:00,704 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:00,705 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:54:00,705 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 21:54:00,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:00,705 INFO L82 PathProgramCache]: Analyzing trace with hash -139040113, now seen corresponding path program 1 times [2019-11-15 21:54:00,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:00,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904370952] [2019-11-15 21:54:00,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:00,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:00,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:00,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:00,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904370952] [2019-11-15 21:54:00,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:00,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:54:00,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914020949] [2019-11-15 21:54:00,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:54:00,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:00,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:54:00,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:54:00,803 INFO L87 Difference]: Start difference. First operand 143 states and 155 transitions. Second operand 4 states. [2019-11-15 21:54:01,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:01,229 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2019-11-15 21:54:01,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:54:01,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 21:54:01,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:01,231 INFO L225 Difference]: With dead ends: 138 [2019-11-15 21:54:01,231 INFO L226 Difference]: Without dead ends: 138 [2019-11-15 21:54:01,232 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:54:01,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-15 21:54:01,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 134. [2019-11-15 21:54:01,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-15 21:54:01,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2019-11-15 21:54:01,254 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 7 [2019-11-15 21:54:01,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:01,254 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2019-11-15 21:54:01,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:54:01,255 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2019-11-15 21:54:01,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 21:54:01,255 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:01,255 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:54:01,256 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 21:54:01,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:01,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1106612566, now seen corresponding path program 1 times [2019-11-15 21:54:01,257 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:01,257 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59900724] [2019-11-15 21:54:01,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:01,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:01,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:01,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:01,364 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59900724] [2019-11-15 21:54:01,365 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:01,365 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:54:01,365 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117940533] [2019-11-15 21:54:01,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:54:01,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:01,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:54:01,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:54:01,367 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand 6 states. [2019-11-15 21:54:02,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:02,245 INFO L93 Difference]: Finished difference Result 282 states and 307 transitions. [2019-11-15 21:54:02,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:54:02,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-15 21:54:02,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:02,249 INFO L225 Difference]: With dead ends: 282 [2019-11-15 21:54:02,249 INFO L226 Difference]: Without dead ends: 282 [2019-11-15 21:54:02,249 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 21:54:02,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-15 21:54:02,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 133. [2019-11-15 21:54:02,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-15 21:54:02,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2019-11-15 21:54:02,261 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 15 [2019-11-15 21:54:02,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:02,262 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2019-11-15 21:54:02,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:54:02,262 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2019-11-15 21:54:02,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 21:54:02,263 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:02,263 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:54:02,264 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 21:54:02,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:02,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1106612567, now seen corresponding path program 1 times [2019-11-15 21:54:02,264 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:02,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708823231] [2019-11-15 21:54:02,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:02,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:02,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:02,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:02,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708823231] [2019-11-15 21:54:02,415 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:02,415 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:54:02,415 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480472267] [2019-11-15 21:54:02,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:54:02,416 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:02,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:54:02,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:54:02,416 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand 6 states. [2019-11-15 21:54:03,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:03,068 INFO L93 Difference]: Finished difference Result 243 states and 265 transitions. [2019-11-15 21:54:03,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:54:03,068 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-15 21:54:03,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:03,071 INFO L225 Difference]: With dead ends: 243 [2019-11-15 21:54:03,071 INFO L226 Difference]: Without dead ends: 243 [2019-11-15 21:54:03,071 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:54:03,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-15 21:54:03,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 132. [2019-11-15 21:54:03,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-15 21:54:03,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2019-11-15 21:54:03,081 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 15 [2019-11-15 21:54:03,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:03,081 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2019-11-15 21:54:03,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:54:03,082 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2019-11-15 21:54:03,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 21:54:03,083 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:03,083 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:54:03,084 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 21:54:03,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:03,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1564815707, now seen corresponding path program 1 times [2019-11-15 21:54:03,084 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:03,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33064844] [2019-11-15 21:54:03,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:03,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:03,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:03,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:03,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33064844] [2019-11-15 21:54:03,184 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:03,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:54:03,184 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885105800] [2019-11-15 21:54:03,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:54:03,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:03,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:54:03,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:54:03,185 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand 5 states. [2019-11-15 21:54:03,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:03,452 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2019-11-15 21:54:03,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:54:03,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-15 21:54:03,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:03,454 INFO L225 Difference]: With dead ends: 133 [2019-11-15 21:54:03,454 INFO L226 Difference]: Without dead ends: 133 [2019-11-15 21:54:03,454 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:54:03,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-15 21:54:03,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 124. [2019-11-15 21:54:03,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-15 21:54:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 141 transitions. [2019-11-15 21:54:03,461 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 141 transitions. Word has length 17 [2019-11-15 21:54:03,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:03,461 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 141 transitions. [2019-11-15 21:54:03,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:54:03,461 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 141 transitions. [2019-11-15 21:54:03,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 21:54:03,462 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:03,462 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:54:03,463 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 21:54:03,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:03,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1564815706, now seen corresponding path program 1 times [2019-11-15 21:54:03,463 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:03,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173731043] [2019-11-15 21:54:03,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:03,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:03,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:03,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:03,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173731043] [2019-11-15 21:54:03,563 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:03,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:54:03,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544602998] [2019-11-15 21:54:03,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:54:03,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:03,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:54:03,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:54:03,565 INFO L87 Difference]: Start difference. First operand 124 states and 141 transitions. Second operand 5 states. [2019-11-15 21:54:03,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:03,935 INFO L93 Difference]: Finished difference Result 178 states and 197 transitions. [2019-11-15 21:54:03,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:54:03,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-15 21:54:03,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:03,937 INFO L225 Difference]: With dead ends: 178 [2019-11-15 21:54:03,937 INFO L226 Difference]: Without dead ends: 178 [2019-11-15 21:54:03,937 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:54:03,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-15 21:54:03,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 154. [2019-11-15 21:54:03,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-15 21:54:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 180 transitions. [2019-11-15 21:54:03,943 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 180 transitions. Word has length 17 [2019-11-15 21:54:03,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:03,944 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 180 transitions. [2019-11-15 21:54:03,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:54:03,944 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 180 transitions. [2019-11-15 21:54:03,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 21:54:03,945 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:03,945 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 21:54:03,945 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 21:54:03,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:03,946 INFO L82 PathProgramCache]: Analyzing trace with hash -549339832, now seen corresponding path program 1 times [2019-11-15 21:54:03,946 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:03,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269107394] [2019-11-15 21:54:03,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:03,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:03,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:04,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:04,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269107394] [2019-11-15 21:54:04,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:04,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:54:04,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127354947] [2019-11-15 21:54:04,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:54:04,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:04,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:54:04,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:54:04,037 INFO L87 Difference]: Start difference. First operand 154 states and 180 transitions. Second operand 6 states. [2019-11-15 21:54:04,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:04,600 INFO L93 Difference]: Finished difference Result 219 states and 255 transitions. [2019-11-15 21:54:04,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:54:04,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-15 21:54:04,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:04,603 INFO L225 Difference]: With dead ends: 219 [2019-11-15 21:54:04,603 INFO L226 Difference]: Without dead ends: 219 [2019-11-15 21:54:04,603 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 21:54:04,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-11-15 21:54:04,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 153. [2019-11-15 21:54:04,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-15 21:54:04,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 178 transitions. [2019-11-15 21:54:04,614 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 178 transitions. Word has length 19 [2019-11-15 21:54:04,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:04,615 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 178 transitions. [2019-11-15 21:54:04,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:54:04,615 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 178 transitions. [2019-11-15 21:54:04,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 21:54:04,617 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:04,617 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 21:54:04,618 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 21:54:04,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:04,619 INFO L82 PathProgramCache]: Analyzing trace with hash -549339831, now seen corresponding path program 1 times [2019-11-15 21:54:04,619 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:04,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800338541] [2019-11-15 21:54:04,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:04,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:04,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:04,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800338541] [2019-11-15 21:54:04,760 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:04,761 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:54:04,761 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381747983] [2019-11-15 21:54:04,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:54:04,761 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:04,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:54:04,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:54:04,762 INFO L87 Difference]: Start difference. First operand 153 states and 178 transitions. Second operand 6 states. [2019-11-15 21:54:05,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:05,390 INFO L93 Difference]: Finished difference Result 239 states and 281 transitions. [2019-11-15 21:54:05,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:54:05,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-15 21:54:05,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:05,392 INFO L225 Difference]: With dead ends: 239 [2019-11-15 21:54:05,393 INFO L226 Difference]: Without dead ends: 239 [2019-11-15 21:54:05,393 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:54:05,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-11-15 21:54:05,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 152. [2019-11-15 21:54:05,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-15 21:54:05,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 176 transitions. [2019-11-15 21:54:05,400 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 176 transitions. Word has length 19 [2019-11-15 21:54:05,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:05,400 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 176 transitions. [2019-11-15 21:54:05,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:54:05,401 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 176 transitions. [2019-11-15 21:54:05,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 21:54:05,404 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:05,404 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 21:54:05,405 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 21:54:05,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:05,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1610936636, now seen corresponding path program 1 times [2019-11-15 21:54:05,406 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:05,406 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017628993] [2019-11-15 21:54:05,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:05,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:05,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:05,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:05,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017628993] [2019-11-15 21:54:05,477 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:05,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:54:05,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512406572] [2019-11-15 21:54:05,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:54:05,478 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:05,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:54:05,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:54:05,478 INFO L87 Difference]: Start difference. First operand 152 states and 176 transitions. Second operand 5 states. [2019-11-15 21:54:05,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:05,745 INFO L93 Difference]: Finished difference Result 169 states and 188 transitions. [2019-11-15 21:54:05,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:54:05,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-15 21:54:05,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:05,747 INFO L225 Difference]: With dead ends: 169 [2019-11-15 21:54:05,747 INFO L226 Difference]: Without dead ends: 169 [2019-11-15 21:54:05,748 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:54:05,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-15 21:54:05,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2019-11-15 21:54:05,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-15 21:54:05,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 174 transitions. [2019-11-15 21:54:05,753 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 174 transitions. Word has length 22 [2019-11-15 21:54:05,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:05,753 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 174 transitions. [2019-11-15 21:54:05,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:54:05,754 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 174 transitions. [2019-11-15 21:54:05,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 21:54:05,754 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:05,755 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:54:05,755 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 21:54:05,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:05,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1037877558, now seen corresponding path program 1 times [2019-11-15 21:54:05,755 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:05,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546416541] [2019-11-15 21:54:05,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:05,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:05,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:05,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:05,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546416541] [2019-11-15 21:54:05,909 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:05,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 21:54:05,911 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616430883] [2019-11-15 21:54:05,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 21:54:05,911 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:05,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 21:54:05,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:54:05,912 INFO L87 Difference]: Start difference. First operand 152 states and 174 transitions. Second operand 10 states. [2019-11-15 21:54:06,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:06,669 INFO L93 Difference]: Finished difference Result 153 states and 173 transitions. [2019-11-15 21:54:06,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:54:06,669 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-15 21:54:06,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:06,671 INFO L225 Difference]: With dead ends: 153 [2019-11-15 21:54:06,671 INFO L226 Difference]: Without dead ends: 153 [2019-11-15 21:54:06,671 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:54:06,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-15 21:54:06,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2019-11-15 21:54:06,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-15 21:54:06,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 173 transitions. [2019-11-15 21:54:06,676 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 173 transitions. Word has length 23 [2019-11-15 21:54:06,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:06,677 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 173 transitions. [2019-11-15 21:54:06,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 21:54:06,677 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 173 transitions. [2019-11-15 21:54:06,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 21:54:06,678 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:06,678 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:54:06,678 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 21:54:06,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:06,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1037877557, now seen corresponding path program 1 times [2019-11-15 21:54:06,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:06,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635404270] [2019-11-15 21:54:06,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:06,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:06,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:06,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:06,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635404270] [2019-11-15 21:54:06,867 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:06,867 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 21:54:06,868 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509820849] [2019-11-15 21:54:06,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 21:54:06,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:06,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 21:54:06,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:54:06,869 INFO L87 Difference]: Start difference. First operand 151 states and 173 transitions. Second operand 11 states. [2019-11-15 21:54:07,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:07,723 INFO L93 Difference]: Finished difference Result 144 states and 164 transitions. [2019-11-15 21:54:07,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 21:54:07,723 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-11-15 21:54:07,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:07,724 INFO L225 Difference]: With dead ends: 144 [2019-11-15 21:54:07,724 INFO L226 Difference]: Without dead ends: 144 [2019-11-15 21:54:07,725 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 21:54:07,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-15 21:54:07,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 133. [2019-11-15 21:54:07,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-15 21:54:07,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-11-15 21:54:07,730 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 23 [2019-11-15 21:54:07,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:07,730 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-11-15 21:54:07,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 21:54:07,730 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-11-15 21:54:07,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 21:54:07,731 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:07,731 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:54:07,731 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 21:54:07,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:07,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1326370516, now seen corresponding path program 1 times [2019-11-15 21:54:07,732 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:07,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112660515] [2019-11-15 21:54:07,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:07,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:07,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:07,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:07,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112660515] [2019-11-15 21:54:07,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:07,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:54:07,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041133605] [2019-11-15 21:54:07,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:54:07,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:07,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:54:07,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:54:07,793 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 5 states. [2019-11-15 21:54:07,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:07,988 INFO L93 Difference]: Finished difference Result 159 states and 184 transitions. [2019-11-15 21:54:07,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:54:07,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-15 21:54:07,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:07,990 INFO L225 Difference]: With dead ends: 159 [2019-11-15 21:54:07,990 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 21:54:07,990 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:54:07,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 21:54:07,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 137. [2019-11-15 21:54:07,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-15 21:54:07,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2019-11-15 21:54:07,994 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 25 [2019-11-15 21:54:07,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:07,994 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2019-11-15 21:54:07,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:54:07,994 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2019-11-15 21:54:07,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 21:54:07,995 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:07,996 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:54:07,996 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 21:54:07,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:07,997 INFO L82 PathProgramCache]: Analyzing trace with hash 2094703505, now seen corresponding path program 1 times [2019-11-15 21:54:07,997 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:07,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994560762] [2019-11-15 21:54:07,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:07,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:07,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:08,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:08,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994560762] [2019-11-15 21:54:08,217 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:08,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 21:54:08,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429738836] [2019-11-15 21:54:08,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:54:08,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:08,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:54:08,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:54:08,218 INFO L87 Difference]: Start difference. First operand 137 states and 158 transitions. Second operand 9 states. [2019-11-15 21:54:08,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:08,811 INFO L93 Difference]: Finished difference Result 224 states and 255 transitions. [2019-11-15 21:54:08,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:54:08,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-11-15 21:54:08,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:08,813 INFO L225 Difference]: With dead ends: 224 [2019-11-15 21:54:08,813 INFO L226 Difference]: Without dead ends: 224 [2019-11-15 21:54:08,814 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-11-15 21:54:08,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-11-15 21:54:08,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 147. [2019-11-15 21:54:08,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-15 21:54:08,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 170 transitions. [2019-11-15 21:54:08,819 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 170 transitions. Word has length 27 [2019-11-15 21:54:08,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:08,819 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 170 transitions. [2019-11-15 21:54:08,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:54:08,820 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 170 transitions. [2019-11-15 21:54:08,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 21:54:08,820 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:08,821 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 21:54:08,821 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 21:54:08,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:08,821 INFO L82 PathProgramCache]: Analyzing trace with hash 113786584, now seen corresponding path program 1 times [2019-11-15 21:54:08,821 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:08,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903557282] [2019-11-15 21:54:08,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:08,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:08,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:08,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:08,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903557282] [2019-11-15 21:54:08,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:08,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 21:54:08,955 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992116933] [2019-11-15 21:54:08,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 21:54:08,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:08,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 21:54:08,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:54:08,957 INFO L87 Difference]: Start difference. First operand 147 states and 170 transitions. Second operand 10 states. [2019-11-15 21:54:09,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:09,854 INFO L93 Difference]: Finished difference Result 396 states and 452 transitions. [2019-11-15 21:54:09,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 21:54:09,854 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2019-11-15 21:54:09,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:09,857 INFO L225 Difference]: With dead ends: 396 [2019-11-15 21:54:09,857 INFO L226 Difference]: Without dead ends: 396 [2019-11-15 21:54:09,858 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2019-11-15 21:54:09,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2019-11-15 21:54:09,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 160. [2019-11-15 21:54:09,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-15 21:54:09,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 187 transitions. [2019-11-15 21:54:09,865 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 187 transitions. Word has length 30 [2019-11-15 21:54:09,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:09,865 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 187 transitions. [2019-11-15 21:54:09,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 21:54:09,865 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 187 transitions. [2019-11-15 21:54:09,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 21:54:09,867 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:09,867 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 21:54:09,867 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 21:54:09,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:09,867 INFO L82 PathProgramCache]: Analyzing trace with hash 113786585, now seen corresponding path program 1 times [2019-11-15 21:54:09,868 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:09,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021038395] [2019-11-15 21:54:09,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:09,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:09,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:10,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:10,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021038395] [2019-11-15 21:54:10,124 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:10,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 21:54:10,125 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107631211] [2019-11-15 21:54:10,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 21:54:10,126 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:10,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 21:54:10,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:54:10,126 INFO L87 Difference]: Start difference. First operand 160 states and 187 transitions. Second operand 11 states. [2019-11-15 21:54:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:11,412 INFO L93 Difference]: Finished difference Result 310 states and 355 transitions. [2019-11-15 21:54:11,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 21:54:11,413 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2019-11-15 21:54:11,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:11,415 INFO L225 Difference]: With dead ends: 310 [2019-11-15 21:54:11,415 INFO L226 Difference]: Without dead ends: 310 [2019-11-15 21:54:11,416 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-11-15 21:54:11,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-11-15 21:54:11,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 160. [2019-11-15 21:54:11,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-15 21:54:11,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 186 transitions. [2019-11-15 21:54:11,431 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 186 transitions. Word has length 30 [2019-11-15 21:54:11,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:11,432 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 186 transitions. [2019-11-15 21:54:11,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 21:54:11,432 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 186 transitions. [2019-11-15 21:54:11,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 21:54:11,433 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:11,434 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 21:54:11,435 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 21:54:11,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:11,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1110729512, now seen corresponding path program 1 times [2019-11-15 21:54:11,436 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:11,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682937846] [2019-11-15 21:54:11,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:11,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:11,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:11,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:11,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682937846] [2019-11-15 21:54:11,517 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:11,517 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:54:11,518 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031971782] [2019-11-15 21:54:11,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:54:11,518 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:11,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:54:11,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:54:11,519 INFO L87 Difference]: Start difference. First operand 160 states and 186 transitions. Second operand 6 states. [2019-11-15 21:54:12,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:12,221 INFO L93 Difference]: Finished difference Result 259 states and 299 transitions. [2019-11-15 21:54:12,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:54:12,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-15 21:54:12,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:12,224 INFO L225 Difference]: With dead ends: 259 [2019-11-15 21:54:12,224 INFO L226 Difference]: Without dead ends: 259 [2019-11-15 21:54:12,225 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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 21:54:12,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-15 21:54:12,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 159. [2019-11-15 21:54:12,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-15 21:54:12,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 185 transitions. [2019-11-15 21:54:12,233 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 185 transitions. Word has length 30 [2019-11-15 21:54:12,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:12,233 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 185 transitions. [2019-11-15 21:54:12,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:54:12,234 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 185 transitions. [2019-11-15 21:54:12,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 21:54:12,235 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:12,235 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 21:54:12,236 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 21:54:12,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:12,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1110729513, now seen corresponding path program 1 times [2019-11-15 21:54:12,237 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:12,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285786449] [2019-11-15 21:54:12,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:12,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:12,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:12,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:12,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285786449] [2019-11-15 21:54:12,339 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:12,339 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:54:12,339 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027872199] [2019-11-15 21:54:12,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:54:12,340 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:12,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:54:12,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:54:12,340 INFO L87 Difference]: Start difference. First operand 159 states and 185 transitions. Second operand 6 states. [2019-11-15 21:54:13,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:13,077 INFO L93 Difference]: Finished difference Result 267 states and 312 transitions. [2019-11-15 21:54:13,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:54:13,077 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-15 21:54:13,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:13,079 INFO L225 Difference]: With dead ends: 267 [2019-11-15 21:54:13,080 INFO L226 Difference]: Without dead ends: 267 [2019-11-15 21:54:13,080 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:54:13,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-11-15 21:54:13,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 158. [2019-11-15 21:54:13,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-15 21:54:13,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 184 transitions. [2019-11-15 21:54:13,088 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 184 transitions. Word has length 30 [2019-11-15 21:54:13,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:13,089 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 184 transitions. [2019-11-15 21:54:13,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:54:13,089 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 184 transitions. [2019-11-15 21:54:13,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 21:54:13,095 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:13,095 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] [2019-11-15 21:54:13,096 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 21:54:13,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:13,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1346905624, now seen corresponding path program 1 times [2019-11-15 21:54:13,098 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:13,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029431786] [2019-11-15 21:54:13,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:13,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:13,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:13,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:13,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029431786] [2019-11-15 21:54:13,153 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:13,153 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:54:13,154 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972770045] [2019-11-15 21:54:13,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:54:13,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:13,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:54:13,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:54:13,155 INFO L87 Difference]: Start difference. First operand 158 states and 184 transitions. Second operand 5 states. [2019-11-15 21:54:13,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:13,375 INFO L93 Difference]: Finished difference Result 169 states and 195 transitions. [2019-11-15 21:54:13,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:54:13,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-15 21:54:13,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:13,377 INFO L225 Difference]: With dead ends: 169 [2019-11-15 21:54:13,377 INFO L226 Difference]: Without dead ends: 169 [2019-11-15 21:54:13,377 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:54:13,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-15 21:54:13,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 162. [2019-11-15 21:54:13,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-15 21:54:13,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 188 transitions. [2019-11-15 21:54:13,383 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 188 transitions. Word has length 31 [2019-11-15 21:54:13,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:13,384 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 188 transitions. [2019-11-15 21:54:13,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:54:13,384 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 188 transitions. [2019-11-15 21:54:13,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 21:54:13,385 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:13,385 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] [2019-11-15 21:54:13,386 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 21:54:13,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:13,386 INFO L82 PathProgramCache]: Analyzing trace with hash 35057421, now seen corresponding path program 1 times [2019-11-15 21:54:13,387 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:13,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273140852] [2019-11-15 21:54:13,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:13,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:13,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:13,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:13,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273140852] [2019-11-15 21:54:13,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203067312] [2019-11-15 21:54:13,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:54:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:13,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-15 21:54:13,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:54:13,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:54:13,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:13,804 INFO L567 ElimStorePlain]: treesize reduction 3, result has 88.0 percent of original size [2019-11-15 21:54:13,808 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:54:13,808 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:13,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:13,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:13,816 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2019-11-15 21:54:13,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:13,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-15 21:54:13,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:13,905 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.9 percent of original size [2019-11-15 21:54:13,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:13,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-15 21:54:13,912 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:13,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:13,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:13,930 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:36 [2019-11-15 21:54:13,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:13,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:13,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:13,984 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-11-15 21:54:13,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:14,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:14,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:14,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:14,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:14,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-11-15 21:54:14,019 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:14,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:14,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:14,030 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:36 [2019-11-15 21:54:14,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:14,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:14,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:14,060 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-11-15 21:54:14,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:14,112 INFO L567 ElimStorePlain]: treesize reduction 5, result has 92.1 percent of original size [2019-11-15 21:54:14,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:14,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:14,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:14,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-11-15 21:54:14,131 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:14,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:14,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:14,157 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:54 [2019-11-15 21:54:14,252 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 21:54:14,253 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:14,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:14,275 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:14,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 21:54:14,276 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:14,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:14,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:14,282 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-11-15 21:54:14,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:14,293 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:54:14,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2019-11-15 21:54:14,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190866261] [2019-11-15 21:54:14,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 21:54:14,296 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:14,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 21:54:14,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:54:14,297 INFO L87 Difference]: Start difference. First operand 162 states and 188 transitions. Second operand 12 states. [2019-11-15 21:54:15,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:15,423 INFO L93 Difference]: Finished difference Result 239 states and 270 transitions. [2019-11-15 21:54:15,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 21:54:15,424 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-15 21:54:15,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:15,425 INFO L225 Difference]: With dead ends: 239 [2019-11-15 21:54:15,426 INFO L226 Difference]: Without dead ends: 239 [2019-11-15 21:54:15,426 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2019-11-15 21:54:15,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-11-15 21:54:15,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 176. [2019-11-15 21:54:15,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-11-15 21:54:15,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 203 transitions. [2019-11-15 21:54:15,440 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 203 transitions. Word has length 33 [2019-11-15 21:54:15,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:15,440 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 203 transitions. [2019-11-15 21:54:15,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 21:54:15,441 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 203 transitions. [2019-11-15 21:54:15,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 21:54:15,441 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:15,442 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:54:15,646 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:54:15,647 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 21:54:15,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:15,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1955365360, now seen corresponding path program 1 times [2019-11-15 21:54:15,648 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:15,648 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690150653] [2019-11-15 21:54:15,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:15,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:15,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:15,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:54:15,739 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690150653] [2019-11-15 21:54:15,739 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:15,739 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:54:15,741 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095092805] [2019-11-15 21:54:15,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:54:15,742 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:15,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:54:15,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:54:15,743 INFO L87 Difference]: Start difference. First operand 176 states and 203 transitions. Second operand 5 states. [2019-11-15 21:54:16,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:16,120 INFO L93 Difference]: Finished difference Result 190 states and 212 transitions. [2019-11-15 21:54:16,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:54:16,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-11-15 21:54:16,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:16,122 INFO L225 Difference]: With dead ends: 190 [2019-11-15 21:54:16,122 INFO L226 Difference]: Without dead ends: 190 [2019-11-15 21:54:16,123 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:54:16,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-15 21:54:16,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 178. [2019-11-15 21:54:16,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-11-15 21:54:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 205 transitions. [2019-11-15 21:54:16,128 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 205 transitions. Word has length 40 [2019-11-15 21:54:16,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:16,129 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 205 transitions. [2019-11-15 21:54:16,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:54:16,129 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 205 transitions. [2019-11-15 21:54:16,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 21:54:16,132 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:16,132 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:54:16,133 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 21:54:16,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:16,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1955376345, now seen corresponding path program 1 times [2019-11-15 21:54:16,133 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:16,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219927607] [2019-11-15 21:54:16,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:16,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:16,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:16,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:54:16,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219927607] [2019-11-15 21:54:16,302 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:54:16,302 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:54:16,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046708263] [2019-11-15 21:54:16,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:54:16,303 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:16,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:54:16,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:54:16,303 INFO L87 Difference]: Start difference. First operand 178 states and 205 transitions. Second operand 8 states. [2019-11-15 21:54:16,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:16,837 INFO L93 Difference]: Finished difference Result 225 states and 255 transitions. [2019-11-15 21:54:16,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:54:16,837 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-11-15 21:54:16,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:16,839 INFO L225 Difference]: With dead ends: 225 [2019-11-15 21:54:16,839 INFO L226 Difference]: Without dead ends: 225 [2019-11-15 21:54:16,840 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:54:16,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-11-15 21:54:16,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 197. [2019-11-15 21:54:16,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-15 21:54:16,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 225 transitions. [2019-11-15 21:54:16,846 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 225 transitions. Word has length 40 [2019-11-15 21:54:16,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:16,846 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 225 transitions. [2019-11-15 21:54:16,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:54:16,847 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 225 transitions. [2019-11-15 21:54:16,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 21:54:16,848 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:16,848 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:54:16,848 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 21:54:16,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:16,849 INFO L82 PathProgramCache]: Analyzing trace with hash -487124307, now seen corresponding path program 1 times [2019-11-15 21:54:16,849 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:16,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640793463] [2019-11-15 21:54:16,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:16,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:16,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:17,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:17,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640793463] [2019-11-15 21:54:17,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641246192] [2019-11-15 21:54:17,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:54:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:17,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-15 21:54:17,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:54:17,348 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:54:17,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:17,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:17,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:17,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-15 21:54:17,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:17,381 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 13 [2019-11-15 21:54:17,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:17,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:17,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:17,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:13 [2019-11-15 21:54:17,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 21:54:17,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:17,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:17,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:17,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:54:17,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:17,515 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:54:17,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2019-11-15 21:54:17,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229685048] [2019-11-15 21:54:17,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 21:54:17,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:17,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 21:54:17,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-11-15 21:54:17,516 INFO L87 Difference]: Start difference. First operand 197 states and 225 transitions. Second operand 16 states. [2019-11-15 21:54:18,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:18,235 INFO L93 Difference]: Finished difference Result 308 states and 336 transitions. [2019-11-15 21:54:18,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 21:54:18,238 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2019-11-15 21:54:18,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:18,240 INFO L225 Difference]: With dead ends: 308 [2019-11-15 21:54:18,240 INFO L226 Difference]: Without dead ends: 308 [2019-11-15 21:54:18,241 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-11-15 21:54:18,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-11-15 21:54:18,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 223. [2019-11-15 21:54:18,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-15 21:54:18,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 262 transitions. [2019-11-15 21:54:18,248 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 262 transitions. Word has length 41 [2019-11-15 21:54:18,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:18,248 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 262 transitions. [2019-11-15 21:54:18,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 21:54:18,248 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 262 transitions. [2019-11-15 21:54:18,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 21:54:18,250 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:18,250 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] [2019-11-15 21:54:18,453 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:54:18,454 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 21:54:18,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:18,454 INFO L82 PathProgramCache]: Analyzing trace with hash -2097544678, now seen corresponding path program 1 times [2019-11-15 21:54:18,454 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:18,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486835706] [2019-11-15 21:54:18,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:18,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:18,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:19,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:19,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486835706] [2019-11-15 21:54:19,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820690368] [2019-11-15 21:54:19,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:54:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:19,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-15 21:54:19,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:54:19,322 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:54:19,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:19,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:19,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:19,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-11-15 21:54:19,404 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:19,404 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:54:19,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:19,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:19,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:19,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-11-15 21:54:19,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:19,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-15 21:54:19,460 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:19,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:19,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:19,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:32 [2019-11-15 21:54:19,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:19,590 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:19,590 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 39 treesize of output 98 [2019-11-15 21:54:19,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:19,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 21:54:19,641 INFO L567 ElimStorePlain]: treesize reduction 119, result has 27.9 percent of original size [2019-11-15 21:54:19,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:19,643 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2019-11-15 21:54:19,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:19,968 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:19,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 163 [2019-11-15 21:54:19,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:20,044 INFO L567 ElimStorePlain]: treesize reduction 84, result has 37.8 percent of original size [2019-11-15 21:54:20,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:20,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:36 [2019-11-15 21:54:20,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:20,110 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-15 21:54:20,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 33 [2019-11-15 21:54:20,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:20,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:20,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:20,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36 [2019-11-15 21:54:20,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:20,192 INFO L341 Elim1Store]: treesize reduction 74, result has 43.9 percent of original size [2019-11-15 21:54:20,192 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 80 [2019-11-15 21:54:20,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:20,223 INFO L567 ElimStorePlain]: treesize reduction 46, result has 54.0 percent of original size [2019-11-15 21:54:20,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:20,224 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2019-11-15 21:54:20,456 INFO L341 Elim1Store]: treesize reduction 10, result has 84.1 percent of original size [2019-11-15 21:54:20,457 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 5 case distinctions, treesize of input 51 treesize of output 72 [2019-11-15 21:54:20,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:20,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:20,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:20,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:20,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:20,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:20,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:20,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:20,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:20,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:20,471 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:20,494 INFO L567 ElimStorePlain]: treesize reduction 38, result has 25.5 percent of original size [2019-11-15 21:54:20,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:20,495 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:5 [2019-11-15 21:54:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:20,511 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:54:20,511 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 26 [2019-11-15 21:54:20,511 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537417072] [2019-11-15 21:54:20,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-15 21:54:20,512 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:20,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-15 21:54:20,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=556, Unknown=2, NotChecked=0, Total=702 [2019-11-15 21:54:20,514 INFO L87 Difference]: Start difference. First operand 223 states and 262 transitions. Second operand 27 states. [2019-11-15 21:54:22,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:22,676 INFO L93 Difference]: Finished difference Result 412 states and 474 transitions. [2019-11-15 21:54:22,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 21:54:22,676 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 41 [2019-11-15 21:54:22,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:22,679 INFO L225 Difference]: With dead ends: 412 [2019-11-15 21:54:22,679 INFO L226 Difference]: Without dead ends: 412 [2019-11-15 21:54:22,680 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=351, Invalid=1366, Unknown=5, NotChecked=0, Total=1722 [2019-11-15 21:54:22,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-11-15 21:54:22,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 250. [2019-11-15 21:54:22,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 21:54:22,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 295 transitions. [2019-11-15 21:54:22,688 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 295 transitions. Word has length 41 [2019-11-15 21:54:22,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:22,689 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 295 transitions. [2019-11-15 21:54:22,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-15 21:54:22,689 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 295 transitions. [2019-11-15 21:54:22,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 21:54:22,690 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:22,690 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] [2019-11-15 21:54:22,893 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:54:22,894 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 21:54:22,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:22,894 INFO L82 PathProgramCache]: Analyzing trace with hash -2097544677, now seen corresponding path program 1 times [2019-11-15 21:54:22,894 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:22,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012612437] [2019-11-15 21:54:22,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:22,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:22,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:23,632 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 22 [2019-11-15 21:54:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:23,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:23,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012612437] [2019-11-15 21:54:23,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653975406] [2019-11-15 21:54:23,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:54:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:23,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-15 21:54:23,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:54:24,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:54:24,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:24,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:24,062 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:54:24,062 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:24,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:24,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:24,074 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-11-15 21:54:24,130 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:24,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:54:24,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:24,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:24,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:24,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2019-11-15 21:54:24,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:24,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-15 21:54:24,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:24,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:24,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:24,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-15 21:54:24,229 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:24,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:24,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:24,248 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:36 [2019-11-15 21:54:24,359 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_58|], 6=[|v_#memory_$Pointer$.base_64|]} [2019-11-15 21:54:24,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-11-15 21:54:24,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:24,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:24,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:24,466 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:24,467 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 107 [2019-11-15 21:54:24,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:24,470 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 21:54:24,530 INFO L567 ElimStorePlain]: treesize reduction 128, result has 33.0 percent of original size [2019-11-15 21:54:24,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:24,531 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:62 [2019-11-15 21:54:24,697 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_59|], 12=[|v_#memory_$Pointer$.base_65|]} [2019-11-15 21:54:24,714 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:24,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 62 [2019-11-15 21:54:24,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:24,759 INFO L567 ElimStorePlain]: treesize reduction 26, result has 75.7 percent of original size [2019-11-15 21:54:24,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:24,833 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:24,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 172 [2019-11-15 21:54:24,834 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:24,892 INFO L567 ElimStorePlain]: treesize reduction 84, result has 45.8 percent of original size [2019-11-15 21:54:24,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:24,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:24,893 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:71 [2019-11-15 21:54:24,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:24,971 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_60|], 12=[|v_#memory_$Pointer$.base_66|]} [2019-11-15 21:54:24,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:24,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-11-15 21:54:24,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:25,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:25,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:25,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:25,015 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2019-11-15 21:54:25,016 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:25,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:25,032 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:25,032 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:47 [2019-11-15 21:54:25,036 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_61|], 12=[|v_#memory_$Pointer$.base_67|]} [2019-11-15 21:54:25,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:25,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2019-11-15 21:54:25,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:25,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:25,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:25,126 INFO L341 Elim1Store]: treesize reduction 74, result has 43.9 percent of original size [2019-11-15 21:54:25,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 78 treesize of output 96 [2019-11-15 21:54:25,128 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:25,162 INFO L567 ElimStorePlain]: treesize reduction 46, result has 64.1 percent of original size [2019-11-15 21:54:25,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:25,163 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:98, output treesize:82 [2019-11-15 21:54:25,326 INFO L392 ElimStorePlain]: Different costs {12=[|#memory_$Pointer$.offset|], 18=[|#memory_$Pointer$.base|]} [2019-11-15 21:54:25,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:25,338 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:54:25,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 13 [2019-11-15 21:54:25,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:25,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:25,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:25,374 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:54:25,548 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-11-15 21:54:25,548 INFO L341 Elim1Store]: treesize reduction 10, result has 89.6 percent of original size [2019-11-15 21:54:25,549 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 105 [2019-11-15 21:54:25,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:25,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:25,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:25,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:25,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:25,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:25,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:25,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:25,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:25,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:25,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:25,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:25,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:25,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:25,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:25,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:25,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:25,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:25,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:25,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:25,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:25,569 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:25,596 INFO L567 ElimStorePlain]: treesize reduction 68, result has 17.1 percent of original size [2019-11-15 21:54:25,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:25,597 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:10 [2019-11-15 21:54:25,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:25,665 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:54:25,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 30 [2019-11-15 21:54:25,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140895150] [2019-11-15 21:54:25,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-15 21:54:25,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:25,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-15 21:54:25,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=741, Unknown=3, NotChecked=0, Total=870 [2019-11-15 21:54:25,669 INFO L87 Difference]: Start difference. First operand 250 states and 295 transitions. Second operand 30 states. [2019-11-15 21:54:30,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:30,531 INFO L93 Difference]: Finished difference Result 451 states and 511 transitions. [2019-11-15 21:54:30,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-11-15 21:54:30,532 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 41 [2019-11-15 21:54:30,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:30,534 INFO L225 Difference]: With dead ends: 451 [2019-11-15 21:54:30,534 INFO L226 Difference]: Without dead ends: 451 [2019-11-15 21:54:30,536 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1093 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=784, Invalid=3625, Unknown=13, NotChecked=0, Total=4422 [2019-11-15 21:54:30,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-15 21:54:30,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 248. [2019-11-15 21:54:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-11-15 21:54:30,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 291 transitions. [2019-11-15 21:54:30,544 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 291 transitions. Word has length 41 [2019-11-15 21:54:30,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:30,545 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 291 transitions. [2019-11-15 21:54:30,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-15 21:54:30,545 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 291 transitions. [2019-11-15 21:54:30,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 21:54:30,546 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:30,546 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:54:30,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:54:30,750 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 21:54:30,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:30,750 INFO L82 PathProgramCache]: Analyzing trace with hash 352248210, now seen corresponding path program 1 times [2019-11-15 21:54:30,751 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:30,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640960770] [2019-11-15 21:54:30,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:30,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:30,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:30,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:30,907 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640960770] [2019-11-15 21:54:30,907 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751194022] [2019-11-15 21:54:30,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:54:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:31,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-15 21:54:31,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:54:31,098 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:54:31,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:31,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:31,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:54:31,112 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:31,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:31,120 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:31,121 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-11-15 21:54:31,447 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:31,448 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 26 [2019-11-15 21:54:31,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:31,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:31,493 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:31,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 26 [2019-11-15 21:54:31,494 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:31,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:31,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:31,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:31,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:31,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:31,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:31,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:31,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:31,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:31,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:31,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:31,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:31,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:31,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:31,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:31,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-11-15 21:54:31,543 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:152 [2019-11-15 21:54:31,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:31,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:31,730 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:54:31,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 20 [2019-11-15 21:54:31,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767961196] [2019-11-15 21:54:31,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-15 21:54:31,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:31,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-15 21:54:31,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-11-15 21:54:31,732 INFO L87 Difference]: Start difference. First operand 248 states and 291 transitions. Second operand 20 states. [2019-11-15 21:54:33,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:33,279 INFO L93 Difference]: Finished difference Result 369 states and 422 transitions. [2019-11-15 21:54:33,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 21:54:33,280 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2019-11-15 21:54:33,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:33,282 INFO L225 Difference]: With dead ends: 369 [2019-11-15 21:54:33,282 INFO L226 Difference]: Without dead ends: 369 [2019-11-15 21:54:33,282 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 21:54:33,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-15 21:54:33,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 275. [2019-11-15 21:54:33,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-15 21:54:33,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 325 transitions. [2019-11-15 21:54:33,289 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 325 transitions. Word has length 43 [2019-11-15 21:54:33,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:33,290 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 325 transitions. [2019-11-15 21:54:33,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-15 21:54:33,290 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 325 transitions. [2019-11-15 21:54:33,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 21:54:33,290 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:33,291 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:54:33,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:54:33,495 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 21:54:33,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:33,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1867961633, now seen corresponding path program 1 times [2019-11-15 21:54:33,495 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:33,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888708250] [2019-11-15 21:54:33,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:33,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:33,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:34,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:34,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888708250] [2019-11-15 21:54:34,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143980586] [2019-11-15 21:54:34,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:54:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:34,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-15 21:54:34,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:54:34,314 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:34,315 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 21:54:34,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:34,349 INFO L567 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-11-15 21:54:34,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:34,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2019-11-15 21:54:34,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:54:34,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:34,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:34,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:34,419 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2019-11-15 21:54:34,465 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:34,466 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 45 treesize of output 59 [2019-11-15 21:54:34,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:34,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:34,485 INFO L567 ElimStorePlain]: treesize reduction 26, result has 62.3 percent of original size [2019-11-15 21:54:34,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:34,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2019-11-15 21:54:34,597 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:34,598 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 28 treesize of output 99 [2019-11-15 21:54:34,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:34,649 INFO L567 ElimStorePlain]: treesize reduction 46, result has 59.6 percent of original size [2019-11-15 21:54:34,650 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:34,650 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:68 [2019-11-15 21:54:34,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:34,736 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:34,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, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 81 [2019-11-15 21:54:34,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:34,796 INFO L567 ElimStorePlain]: treesize reduction 68, result has 52.4 percent of original size [2019-11-15 21:54:34,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:34,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:79, output treesize:80 [2019-11-15 21:54:34,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:35,032 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:35,032 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 87 treesize of output 180 [2019-11-15 21:54:35,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:35,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:35,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:35,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:35,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:35,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:35,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:35,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:35,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:35,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:35,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-11-15 21:54:35,305 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 42 [2019-11-15 21:54:35,306 INFO L567 ElimStorePlain]: treesize reduction 1906, result has 4.7 percent of original size [2019-11-15 21:54:35,306 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 21:54:35,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:93 [2019-11-15 21:54:35,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:35,621 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-15 21:54:35,621 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:35,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 97 treesize of output 255 [2019-11-15 21:54:35,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:35,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:35,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:35,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:35,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:35,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:35,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:35,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:35,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:35,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:35,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:35,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:35,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:35,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:35,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:35,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:35,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:35,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:35,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:35,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:35,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:35,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:35,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:35,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:35,660 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:35,754 INFO L567 ElimStorePlain]: treesize reduction 164, result has 31.7 percent of original size [2019-11-15 21:54:35,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:35,755 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:110, output treesize:76 [2019-11-15 21:54:35,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:35,913 INFO L341 Elim1Store]: treesize reduction 62, result has 45.1 percent of original size [2019-11-15 21:54:35,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 78 treesize of output 92 [2019-11-15 21:54:35,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:35,960 INFO L567 ElimStorePlain]: treesize reduction 60, result has 55.9 percent of original size [2019-11-15 21:54:35,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:35,961 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:95, output treesize:76 [2019-11-15 21:54:35,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:36,094 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2019-11-15 21:54:36,095 INFO L341 Elim1Store]: treesize reduction 86, result has 58.0 percent of original size [2019-11-15 21:54:36,095 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 102 treesize of output 162 [2019-11-15 21:54:36,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:36,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:36,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:36,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:36,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,115 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:36,171 INFO L567 ElimStorePlain]: treesize reduction 116, result has 42.9 percent of original size [2019-11-15 21:54:36,171 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 21:54:36,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:110, output treesize:102 [2019-11-15 21:54:36,554 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-11-15 21:54:36,554 INFO L341 Elim1Store]: treesize reduction 10, result has 91.2 percent of original size [2019-11-15 21:54:36,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 93 treesize of output 143 [2019-11-15 21:54:36,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:36,570 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:36,626 INFO L567 ElimStorePlain]: treesize reduction 76, result has 26.9 percent of original size [2019-11-15 21:54:36,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:36,627 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:98, output treesize:28 [2019-11-15 21:54:36,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:36,707 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:54:36,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2019-11-15 21:54:36,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846360284] [2019-11-15 21:54:36,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-15 21:54:36,709 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:54:36,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-15 21:54:36,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=861, Unknown=2, NotChecked=0, Total=1056 [2019-11-15 21:54:36,710 INFO L87 Difference]: Start difference. First operand 275 states and 325 transitions. Second operand 33 states. [2019-11-15 21:54:39,890 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 55 [2019-11-15 21:54:41,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:54:41,091 INFO L93 Difference]: Finished difference Result 772 states and 903 transitions. [2019-11-15 21:54:41,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-11-15 21:54:41,092 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 44 [2019-11-15 21:54:41,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:54:41,095 INFO L225 Difference]: With dead ends: 772 [2019-11-15 21:54:41,095 INFO L226 Difference]: Without dead ends: 772 [2019-11-15 21:54:41,097 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1629 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1040, Invalid=4352, Unknown=10, NotChecked=0, Total=5402 [2019-11-15 21:54:41,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-11-15 21:54:41,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 302. [2019-11-15 21:54:41,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-11-15 21:54:41,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 358 transitions. [2019-11-15 21:54:41,108 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 358 transitions. Word has length 44 [2019-11-15 21:54:41,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:54:41,108 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 358 transitions. [2019-11-15 21:54:41,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-15 21:54:41,108 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 358 transitions. [2019-11-15 21:54:41,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 21:54:41,109 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:41,109 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:54:41,312 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:54:41,321 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 21:54:41,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:41,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1867961634, now seen corresponding path program 1 times [2019-11-15 21:54:41,321 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:54:41,322 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455961084] [2019-11-15 21:54:41,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:41,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:54:41,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:54:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:42,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:54:42,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455961084] [2019-11-15 21:54:42,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393472614] [2019-11-15 21:54:42,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:54:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:54:42,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-15 21:54:42,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:54:42,305 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_75|], 1=[|v_#valid_91|]} [2019-11-15 21:54:42,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:54:42,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:42,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:42,328 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:42,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:54:42,329 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:42,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:42,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:42,339 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2019-11-15 21:54:42,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:54:42,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:42,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:42,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:54:42,394 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:42,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:42,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:54:42,416 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:39 [2019-11-15 21:54:42,514 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:42,514 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 68 treesize of output 70 [2019-11-15 21:54:42,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:42,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:42,544 INFO L567 ElimStorePlain]: treesize reduction 26, result has 74.3 percent of original size [2019-11-15 21:54:42,547 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 33 treesize of output 26 [2019-11-15 21:54:42,548 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:42,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:42,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:42,561 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:65 [2019-11-15 21:54:42,705 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:42,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:54:42,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:42,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:42,767 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:42,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 52 [2019-11-15 21:54:42,767 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:42,818 INFO L567 ElimStorePlain]: treesize reduction 32, result has 70.1 percent of original size [2019-11-15 21:54:42,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:42,819 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:75 [2019-11-15 21:54:42,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:42,919 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:42,919 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 2 case distinctions, treesize of input 59 treesize of output 84 [2019-11-15 21:54:42,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:43,015 INFO L567 ElimStorePlain]: treesize reduction 68, result has 57.8 percent of original size [2019-11-15 21:54:43,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:43,021 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 34 treesize of output 36 [2019-11-15 21:54:43,022 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:43,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:43,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:43,046 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:97, output treesize:83 [2019-11-15 21:54:43,202 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_66|], 12=[|v_#memory_$Pointer$.base_79|]} [2019-11-15 21:54:43,231 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:43,232 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 44 treesize of output 96 [2019-11-15 21:54:43,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:43,313 INFO L567 ElimStorePlain]: treesize reduction 34, result has 80.1 percent of original size [2019-11-15 21:54:43,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:54:43,399 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:43,424 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 119 treesize of output 202 [2019-11-15 21:54:43,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:43,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:43,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:43,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:43,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:43,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:43,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:43,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:43,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:43,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:43,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:54:43,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:43,677 INFO L496 ElimStorePlain]: Start of recursive call 3: 27 dim-0 vars, End of recursive call: 27 dim-0 vars, and 12 xjuncts. [2019-11-15 21:54:45,107 WARN L191 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 693 DAG size of output: 57 [2019-11-15 21:54:45,107 INFO L567 ElimStorePlain]: treesize reduction 21526, result has 0.8 percent of original size [2019-11-15 21:54:45,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:45,108 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:125, output treesize:172 [2019-11-15 21:54:45,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:45,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:45,530 INFO L392 ElimStorePlain]: Different costs {20=[|v_#memory_$Pointer$.offset_67|], 42=[|v_#memory_$Pointer$.base_80|]} [2019-11-15 21:54:45,618 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:45,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 2 case distinctions, treesize of input 122 treesize of output 176 [2019-11-15 21:54:45,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:45,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:45,620 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:45,704 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:45,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 232 [2019-11-15 21:54:45,705 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:54:45,916 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 76 [2019-11-15 21:54:45,916 INFO L567 ElimStorePlain]: treesize reduction 130, result has 67.3 percent of original size [2019-11-15 21:54:46,117 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:54:46,118 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-11-15 21:54:46,122 INFO L168 Benchmark]: Toolchain (without parser) took 48225.93 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 480.2 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -79.1 MB). Peak memory consumption was 401.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:54:46,122 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:54:46,123 INFO L168 Benchmark]: CACSL2BoogieTranslator took 566.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:54:46,123 INFO L168 Benchmark]: Boogie Preprocessor took 66.32 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 21:54:46,123 INFO L168 Benchmark]: RCFGBuilder took 1118.26 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 21:54:46,124 INFO L168 Benchmark]: TraceAbstraction took 46470.65 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 350.2 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 18.0 MB). Peak memory consumption was 368.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:54:46,125 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 566.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.32 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 1118.26 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 46470.65 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 350.2 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 18.0 MB). Peak memory consumption was 368.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 21:54:48,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:54:48,480 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:54:48,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:54:48,499 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:54:48,501 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:54:48,503 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:54:48,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:54:48,517 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:54:48,521 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:54:48,523 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:54:48,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:54:48,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:54:48,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:54:48,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:54:48,531 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:54:48,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:54:48,534 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:54:48,537 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:54:48,541 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:54:48,545 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:54:48,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:54:48,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:54:48,552 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:54:48,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:54:48,556 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:54:48,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:54:48,558 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:54:48,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:54:48,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:54:48,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:54:48,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:54:48,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:54:48,564 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:54:48,565 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:54:48,566 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:54:48,567 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:54:48,567 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:54:48,567 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:54:48,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:54:48,569 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:54:48,570 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-15 21:54:48,599 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:54:48,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:54:48,612 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:54:48,612 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:54:48,612 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:54:48,613 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:54:48,613 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:54:48,613 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:54:48,613 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:54:48,614 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:54:48,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:54:48,614 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 21:54:48,614 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 21:54:48,615 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 21:54:48,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:54:48,615 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 21:54:48,615 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 21:54:48,615 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:54:48,616 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:54:48,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:54:48,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:54:48,616 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:54:48,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:54:48,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:54:48,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:54:48,618 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:54:48,618 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 21:54:48,618 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 21:54:48,619 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 21:54:48,619 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/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 -> 497bfe83d1a123e7e085e38ee3eed2e663cc023e [2019-11-15 21:54:48,660 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:54:48,671 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:54:48,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:54:48,676 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:54:48,677 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:54:48,677 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/../../sv-benchmarks/c/forester-heap/dll-optional-1.i [2019-11-15 21:54:48,734 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/data/e7e82ae7d/0b5e6e0945e64d789eadbc7bc922202e/FLAG6ed5946f5 [2019-11-15 21:54:49,268 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:54:49,273 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/sv-benchmarks/c/forester-heap/dll-optional-1.i [2019-11-15 21:54:49,294 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/data/e7e82ae7d/0b5e6e0945e64d789eadbc7bc922202e/FLAG6ed5946f5 [2019-11-15 21:54:49,486 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/data/e7e82ae7d/0b5e6e0945e64d789eadbc7bc922202e [2019-11-15 21:54:49,490 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:54:49,491 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 21:54:49,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:54:49,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:54:49,497 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:54:49,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:54:49" (1/1) ... [2019-11-15 21:54:49,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26415cb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:49, skipping insertion in model container [2019-11-15 21:54:49,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:54:49" (1/1) ... [2019-11-15 21:54:49,511 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:54:49,557 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:54:50,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:54:50,086 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:54:50,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:54:50,205 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:54:50,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:50 WrapperNode [2019-11-15 21:54:50,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:54:50,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:54:50,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:54:50,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:54:50,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:50" (1/1) ... [2019-11-15 21:54:50,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:50" (1/1) ... [2019-11-15 21:54:50,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:50" (1/1) ... [2019-11-15 21:54:50,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:50" (1/1) ... [2019-11-15 21:54:50,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:50" (1/1) ... [2019-11-15 21:54:50,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:50" (1/1) ... [2019-11-15 21:54:50,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:50" (1/1) ... [2019-11-15 21:54:50,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:54:50,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:54:50,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:54:50,293 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:54:50,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:54:50,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 21:54:50,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:54:50,352 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 21:54:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 21:54:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 21:54:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 21:54:50,353 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 21:54:50,353 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 21:54:50,353 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 21:54:50,353 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 21:54:50,353 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 21:54:50,354 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 21:54:50,354 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 21:54:50,354 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 21:54:50,354 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 21:54:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 21:54:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 21:54:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 21:54:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 21:54:50,356 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 21:54:50,356 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 21:54:50,356 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 21:54:50,356 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 21:54:50,357 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 21:54:50,357 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 21:54:50,357 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 21:54:50,357 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 21:54:50,357 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 21:54:50,358 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 21:54:50,358 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 21:54:50,358 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 21:54:50,358 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 21:54:50,359 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 21:54:50,359 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 21:54:50,359 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 21:54:50,359 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 21:54:50,359 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 21:54:50,360 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 21:54:50,360 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 21:54:50,360 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 21:54:50,360 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 21:54:50,360 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 21:54:50,361 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 21:54:50,361 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 21:54:50,361 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 21:54:50,361 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 21:54:50,362 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 21:54:50,362 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 21:54:50,362 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 21:54:50,362 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 21:54:50,362 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 21:54:50,362 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 21:54:50,363 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 21:54:50,363 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 21:54:50,363 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 21:54:50,363 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 21:54:50,364 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 21:54:50,364 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 21:54:50,364 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 21:54:50,364 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 21:54:50,364 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 21:54:50,364 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 21:54:50,365 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 21:54:50,365 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 21:54:50,365 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 21:54:50,365 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 21:54:50,365 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 21:54:50,366 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 21:54:50,366 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 21:54:50,366 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 21:54:50,366 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 21:54:50,366 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 21:54:50,367 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 21:54:50,367 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 21:54:50,367 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 21:54:50,367 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 21:54:50,367 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 21:54:50,368 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 21:54:50,368 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 21:54:50,368 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 21:54:50,368 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 21:54:50,368 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 21:54:50,368 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 21:54:50,369 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 21:54:50,369 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 21:54:50,369 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 21:54:50,369 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 21:54:50,369 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 21:54:50,370 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 21:54:50,370 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 21:54:50,370 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 21:54:50,370 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 21:54:50,370 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 21:54:50,371 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 21:54:50,371 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 21:54:50,371 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 21:54:50,371 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 21:54:50,371 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 21:54:50,372 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 21:54:50,372 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 21:54:50,372 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 21:54:50,372 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 21:54:50,372 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 21:54:50,373 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 21:54:50,373 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 21:54:50,373 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 21:54:50,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 21:54:50,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 21:54:50,373 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 21:54:50,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:54:50,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:54:50,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 21:54:50,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:54:50,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 21:54:50,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:54:50,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 21:54:50,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:54:51,626 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:54:51,626 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 21:54:51,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:54:51 BoogieIcfgContainer [2019-11-15 21:54:51,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:54:51,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:54:51,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:54:51,633 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:54:51,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:54:49" (1/3) ... [2019-11-15 21:54:51,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e7a873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:54:51, skipping insertion in model container [2019-11-15 21:54:51,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:54:50" (2/3) ... [2019-11-15 21:54:51,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e7a873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:54:51, skipping insertion in model container [2019-11-15 21:54:51,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:54:51" (3/3) ... [2019-11-15 21:54:51,641 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2019-11-15 21:54:51,653 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:54:51,668 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-15 21:54:51,680 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-15 21:54:51,705 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:54:51,706 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 21:54:51,706 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:54:51,707 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:54:51,708 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:54:51,708 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:54:51,709 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:54:51,709 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:54:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2019-11-15 21:54:51,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 21:54:51,762 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:54:51,763 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:54:51,765 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr68ASSERT_VIOLATIONMEMORY_FREE, mainErr54REQUIRES_VIOLATION, mainErr70ENSURES_VIOLATIONMEMORY_LEAK, mainErr58REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr69ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr66ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr67ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION]=== [2019-11-15 21:54:51,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:54:51,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1493323883, now seen corresponding path program 1 times [2019-11-15 21:54:51,783 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:54:51,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [42491524] [2019-11-15 21:54:51,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bb7fdb38-92cd-49f2-863d-6e60742e32d1/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:54:52,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:54:52,024 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort C_DOUBLE not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 21:54:52,029 INFO L168 Benchmark]: Toolchain (without parser) took 2537.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 945.6 MB in the beginning and 1.0 GB in the end (delta: -102.2 MB). Peak memory consumption was 55.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:54:52,030 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:54:52,031 INFO L168 Benchmark]: CACSL2BoogieTranslator took 714.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:54:52,032 INFO L168 Benchmark]: Boogie Preprocessor took 85.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:54:52,037 INFO L168 Benchmark]: RCFGBuilder took 1335.18 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: 70.7 MB). Peak memory consumption was 70.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:54:52,038 INFO L168 Benchmark]: TraceAbstraction took 397.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:54:52,049 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 714.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1335.18 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: 70.7 MB). Peak memory consumption was 70.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 397.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Sort C_DOUBLE not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...