./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-circular-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-circular-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/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 550de44c598358d86c5215062b141ca9f9605e9c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-circular-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/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 550de44c598358d86c5215062b141ca9f9605e9c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 01:26:54,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:26:54,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:26:54,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:26:54,790 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:26:54,792 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:26:54,793 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:26:54,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:26:54,798 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:26:54,799 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:26:54,800 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:26:54,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:26:54,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:26:54,821 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:26:54,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:26:54,824 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:26:54,825 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:26:54,827 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:26:54,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:26:54,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:26:54,835 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:26:54,836 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:26:54,838 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:26:54,839 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:26:54,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:26:54,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:26:54,843 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:26:54,844 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:26:54,845 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:26:54,846 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:26:54,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:26:54,848 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:26:54,849 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:26:54,850 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:26:54,851 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:26:54,851 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:26:54,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:26:54,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:26:54,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:26:54,854 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:26:54,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:26:54,855 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-11-30 01:26:54,880 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:26:54,880 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:26:54,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:26:54,882 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:26:54,882 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 01:26:54,882 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:26:54,883 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:26:54,883 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 01:26:54,883 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:26:54,883 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:26:54,883 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:26:54,884 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-30 01:26:54,884 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-30 01:26:54,884 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-11-30 01:26:54,884 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:26:54,884 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 01:26:54,885 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:26:54,885 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:26:54,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:26:54,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:26:54,886 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:26:54,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:26:54,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:26:54,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:26:54,886 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:26:54,887 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 01:26:54,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 01:26:54,887 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:26:54,887 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_69410ff6-bc57-45e8-82b6-8e7f79531692/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 -> 550de44c598358d86c5215062b141ca9f9605e9c [2020-11-30 01:26:55,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:26:55,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:26:55,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:26:55,186 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:26:55,193 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:26:55,195 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-circular-1.i [2020-11-30 01:26:55,291 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/data/a92d9078d/f142601d9c194b64813e18a9e7602379/FLAGed6136bc5 [2020-11-30 01:26:55,867 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:26:55,868 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/sv-benchmarks/c/forester-heap/sll-circular-1.i [2020-11-30 01:26:55,882 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/data/a92d9078d/f142601d9c194b64813e18a9e7602379/FLAGed6136bc5 [2020-11-30 01:26:56,211 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/data/a92d9078d/f142601d9c194b64813e18a9e7602379 [2020-11-30 01:26:56,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:26:56,215 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-30 01:26:56,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:26:56,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:26:56,233 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:26:56,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:26:56" (1/1) ... [2020-11-30 01:26:56,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e2cb801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:56, skipping insertion in model container [2020-11-30 01:26:56,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:26:56" (1/1) ... [2020-11-30 01:26:56,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:26:56,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:26:56,722 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:26:56,735 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:26:56,808 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:26:56,871 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:26:56,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:56 WrapperNode [2020-11-30 01:26:56,872 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:26:56,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:26:56,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:26:56,873 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:26:56,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:56" (1/1) ... [2020-11-30 01:26:56,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:56" (1/1) ... [2020-11-30 01:26:56,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:56" (1/1) ... [2020-11-30 01:26:56,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:56" (1/1) ... [2020-11-30 01:26:56,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:56" (1/1) ... [2020-11-30 01:26:56,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:56" (1/1) ... [2020-11-30 01:26:56,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:56" (1/1) ... [2020-11-30 01:26:56,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:26:56,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:26:56,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:26:56,990 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:26:56,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/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 [2020-11-30 01:26:57,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-30 01:26:57,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:26:57,068 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-30 01:26:57,068 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-30 01:26:57,069 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-11-30 01:26:57,069 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-11-30 01:26:57,069 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-11-30 01:26:57,070 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-11-30 01:26:57,070 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-11-30 01:26:57,071 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-11-30 01:26:57,072 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-11-30 01:26:57,072 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-11-30 01:26:57,072 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-11-30 01:26:57,073 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-11-30 01:26:57,073 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-11-30 01:26:57,073 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-11-30 01:26:57,075 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-11-30 01:26:57,075 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-11-30 01:26:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-11-30 01:26:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-11-30 01:26:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-11-30 01:26:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-11-30 01:26:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-11-30 01:26:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-11-30 01:26:57,077 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-11-30 01:26:57,077 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-11-30 01:26:57,077 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-11-30 01:26:57,077 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-11-30 01:26:57,077 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-11-30 01:26:57,078 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-11-30 01:26:57,078 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-11-30 01:26:57,078 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-11-30 01:26:57,078 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-11-30 01:26:57,078 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-11-30 01:26:57,078 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-11-30 01:26:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-11-30 01:26:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-11-30 01:26:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-11-30 01:26:57,079 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-11-30 01:26:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-11-30 01:26:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-11-30 01:26:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-11-30 01:26:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-11-30 01:26:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-11-30 01:26:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-11-30 01:26:57,081 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-11-30 01:26:57,081 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-11-30 01:26:57,081 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-11-30 01:26:57,081 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-11-30 01:26:57,081 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-11-30 01:26:57,081 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-11-30 01:26:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-11-30 01:26:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-11-30 01:26:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-11-30 01:26:57,082 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-30 01:26:57,083 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-30 01:26:57,083 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-11-30 01:26:57,084 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-30 01:26:57,084 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-11-30 01:26:57,084 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-11-30 01:26:57,084 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-11-30 01:26:57,085 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-11-30 01:26:57,085 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-11-30 01:26:57,085 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-30 01:26:57,085 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-11-30 01:26:57,085 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-11-30 01:26:57,085 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-11-30 01:26:57,086 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-11-30 01:26:57,086 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-11-30 01:26:57,086 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-11-30 01:26:57,086 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-11-30 01:26:57,087 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-11-30 01:26:57,088 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-11-30 01:26:57,088 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-11-30 01:26:57,089 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-11-30 01:26:57,089 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-11-30 01:26:57,089 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-11-30 01:26:57,089 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-11-30 01:26:57,089 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-11-30 01:26:57,090 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-11-30 01:26:57,090 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-11-30 01:26:57,090 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-11-30 01:26:57,090 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-11-30 01:26:57,090 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-11-30 01:26:57,090 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-11-30 01:26:57,091 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-11-30 01:26:57,091 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-11-30 01:26:57,092 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-11-30 01:26:57,092 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-11-30 01:26:57,092 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-11-30 01:26:57,092 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-11-30 01:26:57,092 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-11-30 01:26:57,092 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-11-30 01:26:57,093 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-11-30 01:26:57,093 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-11-30 01:26:57,093 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-11-30 01:26:57,093 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-11-30 01:26:57,093 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-11-30 01:26:57,093 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-11-30 01:26:57,094 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-11-30 01:26:57,094 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-11-30 01:26:57,094 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-11-30 01:26:57,094 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-11-30 01:26:57,094 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-11-30 01:26:57,094 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-11-30 01:26:57,094 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-11-30 01:26:57,095 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-11-30 01:26:57,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-30 01:26:57,095 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-30 01:26:57,095 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-30 01:26:57,095 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-30 01:26:57,095 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-30 01:26:57,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:26:57,096 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-30 01:26:57,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-30 01:26:57,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-30 01:26:57,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 01:26:57,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-30 01:26:57,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-30 01:26:57,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 01:26:57,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-30 01:26:57,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 01:26:57,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:26:58,132 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:26:58,132 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-11-30 01:26:58,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:26:58 BoogieIcfgContainer [2020-11-30 01:26:58,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:26:58,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:26:58,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:26:58,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:26:58,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:26:56" (1/3) ... [2020-11-30 01:26:58,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459e6cd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:26:58, skipping insertion in model container [2020-11-30 01:26:58,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:56" (2/3) ... [2020-11-30 01:26:58,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459e6cd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:26:58, skipping insertion in model container [2020-11-30 01:26:58,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:26:58" (3/3) ... [2020-11-30 01:26:58,143 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2020-11-30 01:26:58,154 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:26:58,158 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 44 error locations. [2020-11-30 01:26:58,170 INFO L253 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2020-11-30 01:26:58,189 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:26:58,189 INFO L378 AbstractCegarLoop]: Hoare is false [2020-11-30 01:26:58,190 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:26:58,190 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:26:58,190 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:26:58,190 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:26:58,190 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:26:58,190 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:26:58,205 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2020-11-30 01:26:58,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-30 01:26:58,212 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:26:58,212 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:26:58,213 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:26:58,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:26:58,218 INFO L82 PathProgramCache]: Analyzing trace with hash 300944310, now seen corresponding path program 1 times [2020-11-30 01:26:58,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:26:58,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116757144] [2020-11-30 01:26:58,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:26:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:26:58,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:26:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:26:58,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:26:58,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116757144] [2020-11-30 01:26:58,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:26:58,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:26:58,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836065116] [2020-11-30 01:26:58,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:26:58,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:26:58,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:26:58,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:26:58,549 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 4 states. [2020-11-30 01:26:58,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:26:58,947 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2020-11-30 01:26:58,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:26:58,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-11-30 01:26:58,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:26:58,956 INFO L225 Difference]: With dead ends: 112 [2020-11-30 01:26:58,956 INFO L226 Difference]: Without dead ends: 109 [2020-11-30 01:26:58,957 INFO L677 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 [2020-11-30 01:26:58,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-11-30 01:26:59,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2020-11-30 01:26:59,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-11-30 01:26:59,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2020-11-30 01:26:59,008 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 7 [2020-11-30 01:26:59,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:26:59,009 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2020-11-30 01:26:59,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:26:59,009 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2020-11-30 01:26:59,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-30 01:26:59,009 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:26:59,010 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:26:59,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 01:26:59,011 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:26:59,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:26:59,012 INFO L82 PathProgramCache]: Analyzing trace with hash 300944311, now seen corresponding path program 1 times [2020-11-30 01:26:59,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:26:59,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773637241] [2020-11-30 01:26:59,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:26:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:26:59,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:26:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:26:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:26:59,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773637241] [2020-11-30 01:26:59,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:26:59,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 01:26:59,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880690840] [2020-11-30 01:26:59,182 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:26:59,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:26:59,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:26:59,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:26:59,185 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 4 states. [2020-11-30 01:26:59,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:26:59,486 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2020-11-30 01:26:59,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:26:59,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-11-30 01:26:59,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:26:59,488 INFO L225 Difference]: With dead ends: 107 [2020-11-30 01:26:59,489 INFO L226 Difference]: Without dead ends: 107 [2020-11-30 01:26:59,489 INFO L677 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 [2020-11-30 01:26:59,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-11-30 01:26:59,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2020-11-30 01:26:59,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-11-30 01:26:59,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2020-11-30 01:26:59,498 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 7 [2020-11-30 01:26:59,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:26:59,499 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2020-11-30 01:26:59,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:26:59,499 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2020-11-30 01:26:59,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-30 01:26:59,500 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:26:59,500 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:26:59,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 01:26:59,500 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:26:59,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:26:59,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1625823625, now seen corresponding path program 1 times [2020-11-30 01:26:59,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:26:59,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189192005] [2020-11-30 01:26:59,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:26:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:26:59,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:26:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:26:59,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:26:59,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189192005] [2020-11-30 01:26:59,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:26:59,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:26:59,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625576542] [2020-11-30 01:26:59,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:26:59,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:26:59,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:26:59,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:26:59,619 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 5 states. [2020-11-30 01:26:59,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:26:59,978 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2020-11-30 01:26:59,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:26:59,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-30 01:26:59,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:26:59,980 INFO L225 Difference]: With dead ends: 93 [2020-11-30 01:26:59,980 INFO L226 Difference]: Without dead ends: 93 [2020-11-30 01:26:59,980 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:26:59,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-11-30 01:26:59,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2020-11-30 01:26:59,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-30 01:26:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2020-11-30 01:26:59,987 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 12 [2020-11-30 01:26:59,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:26:59,987 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2020-11-30 01:26:59,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:26:59,987 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2020-11-30 01:26:59,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-30 01:26:59,988 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:26:59,988 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:26:59,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 01:26:59,989 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:26:59,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:26:59,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1625823624, now seen corresponding path program 1 times [2020-11-30 01:26:59,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:26:59,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490015012] [2020-11-30 01:26:59,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:00,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:00,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:00,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490015012] [2020-11-30 01:27:00,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:00,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:27:00,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574397735] [2020-11-30 01:27:00,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:27:00,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:00,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:27:00,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:27:00,114 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 5 states. [2020-11-30 01:27:00,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:00,460 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2020-11-30 01:27:00,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:27:00,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-30 01:27:00,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:00,462 INFO L225 Difference]: With dead ends: 103 [2020-11-30 01:27:00,462 INFO L226 Difference]: Without dead ends: 103 [2020-11-30 01:27:00,462 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:27:00,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-11-30 01:27:00,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2020-11-30 01:27:00,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-11-30 01:27:00,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2020-11-30 01:27:00,490 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 12 [2020-11-30 01:27:00,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:00,490 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2020-11-30 01:27:00,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:27:00,490 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2020-11-30 01:27:00,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-30 01:27:00,491 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:00,491 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:00,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 01:27:00,492 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:00,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:00,492 INFO L82 PathProgramCache]: Analyzing trace with hash -565115390, now seen corresponding path program 1 times [2020-11-30 01:27:00,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:00,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125706661] [2020-11-30 01:27:00,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:00,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:00,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:00,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125706661] [2020-11-30 01:27:00,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:00,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 01:27:00,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908890126] [2020-11-30 01:27:00,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 01:27:00,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:00,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 01:27:00,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-30 01:27:00,624 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 7 states. [2020-11-30 01:27:01,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:01,203 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2020-11-30 01:27:01,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 01:27:01,204 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-11-30 01:27:01,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:01,205 INFO L225 Difference]: With dead ends: 137 [2020-11-30 01:27:01,206 INFO L226 Difference]: Without dead ends: 137 [2020-11-30 01:27:01,206 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-11-30 01:27:01,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-11-30 01:27:01,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 88. [2020-11-30 01:27:01,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-11-30 01:27:01,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2020-11-30 01:27:01,217 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 15 [2020-11-30 01:27:01,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:01,217 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2020-11-30 01:27:01,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 01:27:01,217 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2020-11-30 01:27:01,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-30 01:27:01,218 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:01,218 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:01,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 01:27:01,219 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:01,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:01,219 INFO L82 PathProgramCache]: Analyzing trace with hash -565115389, now seen corresponding path program 1 times [2020-11-30 01:27:01,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:01,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421463061] [2020-11-30 01:27:01,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:01,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:01,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:01,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421463061] [2020-11-30 01:27:01,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:01,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 01:27:01,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985970373] [2020-11-30 01:27:01,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 01:27:01,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:01,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 01:27:01,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-30 01:27:01,342 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 7 states. [2020-11-30 01:27:01,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:01,915 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2020-11-30 01:27:01,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 01:27:01,916 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-11-30 01:27:01,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:01,917 INFO L225 Difference]: With dead ends: 135 [2020-11-30 01:27:01,917 INFO L226 Difference]: Without dead ends: 135 [2020-11-30 01:27:01,918 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-11-30 01:27:01,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-11-30 01:27:01,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 78. [2020-11-30 01:27:01,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-11-30 01:27:01,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2020-11-30 01:27:01,925 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 15 [2020-11-30 01:27:01,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:01,926 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2020-11-30 01:27:01,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 01:27:01,926 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2020-11-30 01:27:01,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-30 01:27:01,927 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:01,927 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:01,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 01:27:01,928 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:01,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:01,928 INFO L82 PathProgramCache]: Analyzing trace with hash -2146668879, now seen corresponding path program 1 times [2020-11-30 01:27:01,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:01,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202121990] [2020-11-30 01:27:01,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:02,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202121990] [2020-11-30 01:27:02,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:02,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-30 01:27:02,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688021157] [2020-11-30 01:27:02,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 01:27:02,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:02,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 01:27:02,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:27:02,096 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 9 states. [2020-11-30 01:27:02,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:02,596 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2020-11-30 01:27:02,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 01:27:02,597 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2020-11-30 01:27:02,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:02,598 INFO L225 Difference]: With dead ends: 127 [2020-11-30 01:27:02,598 INFO L226 Difference]: Without dead ends: 127 [2020-11-30 01:27:02,599 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:27:02,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-11-30 01:27:02,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 86. [2020-11-30 01:27:02,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-11-30 01:27:02,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2020-11-30 01:27:02,605 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 17 [2020-11-30 01:27:02,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:02,606 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2020-11-30 01:27:02,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 01:27:02,606 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2020-11-30 01:27:02,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-30 01:27:02,606 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:02,607 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:02,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 01:27:02,607 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:02,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:02,608 INFO L82 PathProgramCache]: Analyzing trace with hash -2146668878, now seen corresponding path program 1 times [2020-11-30 01:27:02,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:02,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998086201] [2020-11-30 01:27:02,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:02,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998086201] [2020-11-30 01:27:02,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:02,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-30 01:27:02,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590772314] [2020-11-30 01:27:02,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 01:27:02,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:02,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 01:27:02,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:27:02,902 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand 9 states. [2020-11-30 01:27:03,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:03,509 INFO L93 Difference]: Finished difference Result 159 states and 175 transitions. [2020-11-30 01:27:03,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 01:27:03,511 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2020-11-30 01:27:03,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:03,512 INFO L225 Difference]: With dead ends: 159 [2020-11-30 01:27:03,512 INFO L226 Difference]: Without dead ends: 159 [2020-11-30 01:27:03,513 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:27:03,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-11-30 01:27:03,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 98. [2020-11-30 01:27:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-11-30 01:27:03,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 115 transitions. [2020-11-30 01:27:03,519 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 115 transitions. Word has length 17 [2020-11-30 01:27:03,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:03,520 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 115 transitions. [2020-11-30 01:27:03,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 01:27:03,520 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2020-11-30 01:27:03,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 01:27:03,520 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:03,520 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:03,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 01:27:03,521 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:03,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:03,527 INFO L82 PathProgramCache]: Analyzing trace with hash -2122246388, now seen corresponding path program 1 times [2020-11-30 01:27:03,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:03,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745249614] [2020-11-30 01:27:03,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:03,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:03,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:03,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745249614] [2020-11-30 01:27:03,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:03,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-30 01:27:03,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353442037] [2020-11-30 01:27:03,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 01:27:03,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:03,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 01:27:03,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:27:03,730 INFO L87 Difference]: Start difference. First operand 98 states and 115 transitions. Second operand 9 states. [2020-11-30 01:27:04,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:04,195 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2020-11-30 01:27:04,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 01:27:04,198 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-11-30 01:27:04,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:04,199 INFO L225 Difference]: With dead ends: 158 [2020-11-30 01:27:04,199 INFO L226 Difference]: Without dead ends: 158 [2020-11-30 01:27:04,199 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:27:04,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-11-30 01:27:04,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 98. [2020-11-30 01:27:04,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-11-30 01:27:04,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 114 transitions. [2020-11-30 01:27:04,207 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 114 transitions. Word has length 18 [2020-11-30 01:27:04,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:04,207 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 114 transitions. [2020-11-30 01:27:04,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 01:27:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 114 transitions. [2020-11-30 01:27:04,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-30 01:27:04,208 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:04,209 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:04,209 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 01:27:04,209 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:04,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:04,209 INFO L82 PathProgramCache]: Analyzing trace with hash 650548680, now seen corresponding path program 1 times [2020-11-30 01:27:04,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:04,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244008152] [2020-11-30 01:27:04,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:04,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244008152] [2020-11-30 01:27:04,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:04,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-30 01:27:04,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982934041] [2020-11-30 01:27:04,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 01:27:04,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:04,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 01:27:04,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-30 01:27:04,456 INFO L87 Difference]: Start difference. First operand 98 states and 114 transitions. Second operand 10 states. [2020-11-30 01:27:05,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:05,128 INFO L93 Difference]: Finished difference Result 144 states and 159 transitions. [2020-11-30 01:27:05,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 01:27:05,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-11-30 01:27:05,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:05,130 INFO L225 Difference]: With dead ends: 144 [2020-11-30 01:27:05,130 INFO L226 Difference]: Without dead ends: 144 [2020-11-30 01:27:05,131 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2020-11-30 01:27:05,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-11-30 01:27:05,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 98. [2020-11-30 01:27:05,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-11-30 01:27:05,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 113 transitions. [2020-11-30 01:27:05,136 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 113 transitions. Word has length 20 [2020-11-30 01:27:05,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:05,136 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 113 transitions. [2020-11-30 01:27:05,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 01:27:05,137 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 113 transitions. [2020-11-30 01:27:05,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-30 01:27:05,144 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:05,144 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:05,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 01:27:05,145 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:05,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:05,146 INFO L82 PathProgramCache]: Analyzing trace with hash 650548681, now seen corresponding path program 1 times [2020-11-30 01:27:05,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:05,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380209983] [2020-11-30 01:27:05,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:05,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:05,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:05,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380209983] [2020-11-30 01:27:05,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:05,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-30 01:27:05,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433937848] [2020-11-30 01:27:05,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 01:27:05,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:05,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 01:27:05,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:27:05,391 INFO L87 Difference]: Start difference. First operand 98 states and 113 transitions. Second operand 9 states. [2020-11-30 01:27:05,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:05,988 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2020-11-30 01:27:05,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 01:27:05,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-11-30 01:27:05,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:05,990 INFO L225 Difference]: With dead ends: 154 [2020-11-30 01:27:05,991 INFO L226 Difference]: Without dead ends: 154 [2020-11-30 01:27:05,991 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:27:05,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-11-30 01:27:05,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 98. [2020-11-30 01:27:05,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-11-30 01:27:05,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2020-11-30 01:27:05,999 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 20 [2020-11-30 01:27:05,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:06,000 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2020-11-30 01:27:06,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 01:27:06,000 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2020-11-30 01:27:06,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 01:27:06,003 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:06,003 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:06,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 01:27:06,004 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:06,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:06,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1307842199, now seen corresponding path program 1 times [2020-11-30 01:27:06,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:06,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190870106] [2020-11-30 01:27:06,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:06,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:06,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:06,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190870106] [2020-11-30 01:27:06,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:06,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 01:27:06,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106730237] [2020-11-30 01:27:06,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 01:27:06,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:06,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 01:27:06,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-30 01:27:06,127 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 8 states. [2020-11-30 01:27:06,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:06,588 INFO L93 Difference]: Finished difference Result 134 states and 152 transitions. [2020-11-30 01:27:06,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 01:27:06,589 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-11-30 01:27:06,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:06,590 INFO L225 Difference]: With dead ends: 134 [2020-11-30 01:27:06,590 INFO L226 Difference]: Without dead ends: 134 [2020-11-30 01:27:06,591 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-11-30 01:27:06,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-11-30 01:27:06,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 99. [2020-11-30 01:27:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-11-30 01:27:06,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2020-11-30 01:27:06,595 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 21 [2020-11-30 01:27:06,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:06,595 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2020-11-30 01:27:06,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 01:27:06,596 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2020-11-30 01:27:06,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 01:27:06,596 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:06,597 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:06,599 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 01:27:06,599 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:06,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:06,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1307842198, now seen corresponding path program 1 times [2020-11-30 01:27:06,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:06,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194513745] [2020-11-30 01:27:06,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:06,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:06,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:06,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194513745] [2020-11-30 01:27:06,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:06,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-30 01:27:06,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818367149] [2020-11-30 01:27:06,856 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-30 01:27:06,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:06,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 01:27:06,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-11-30 01:27:06,857 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand 12 states. [2020-11-30 01:27:07,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:07,584 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2020-11-30 01:27:07,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 01:27:07,585 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-11-30 01:27:07,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:07,585 INFO L225 Difference]: With dead ends: 144 [2020-11-30 01:27:07,586 INFO L226 Difference]: Without dead ends: 144 [2020-11-30 01:27:07,586 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2020-11-30 01:27:07,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-11-30 01:27:07,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 118. [2020-11-30 01:27:07,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-11-30 01:27:07,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 147 transitions. [2020-11-30 01:27:07,591 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 147 transitions. Word has length 21 [2020-11-30 01:27:07,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:07,591 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 147 transitions. [2020-11-30 01:27:07,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-30 01:27:07,592 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 147 transitions. [2020-11-30 01:27:07,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:27:07,592 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:07,592 INFO L422 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] [2020-11-30 01:27:07,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-30 01:27:07,593 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:07,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:07,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1280392747, now seen corresponding path program 1 times [2020-11-30 01:27:07,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:07,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524732603] [2020-11-30 01:27:07,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:07,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:07,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:07,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524732603] [2020-11-30 01:27:07,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:07,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 01:27:07,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749863932] [2020-11-30 01:27:07,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 01:27:07,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:07,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 01:27:07,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-30 01:27:07,665 INFO L87 Difference]: Start difference. First operand 118 states and 147 transitions. Second operand 7 states. [2020-11-30 01:27:08,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:08,096 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2020-11-30 01:27:08,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 01:27:08,096 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-11-30 01:27:08,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:08,097 INFO L225 Difference]: With dead ends: 150 [2020-11-30 01:27:08,098 INFO L226 Difference]: Without dead ends: 150 [2020-11-30 01:27:08,098 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-11-30 01:27:08,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-11-30 01:27:08,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 117. [2020-11-30 01:27:08,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-11-30 01:27:08,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 145 transitions. [2020-11-30 01:27:08,103 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 145 transitions. Word has length 22 [2020-11-30 01:27:08,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:08,103 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 145 transitions. [2020-11-30 01:27:08,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 01:27:08,103 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions. [2020-11-30 01:27:08,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 01:27:08,104 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:08,104 INFO L422 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] [2020-11-30 01:27:08,105 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-30 01:27:08,105 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:08,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:08,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1589069240, now seen corresponding path program 1 times [2020-11-30 01:27:08,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:08,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362119580] [2020-11-30 01:27:08,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:08,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:08,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362119580] [2020-11-30 01:27:08,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:08,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-30 01:27:08,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415324310] [2020-11-30 01:27:08,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-30 01:27:08,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:08,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 01:27:08,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-11-30 01:27:08,445 INFO L87 Difference]: Start difference. First operand 117 states and 145 transitions. Second operand 12 states. [2020-11-30 01:27:08,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:08,977 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2020-11-30 01:27:08,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 01:27:08,978 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-11-30 01:27:08,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:08,980 INFO L225 Difference]: With dead ends: 153 [2020-11-30 01:27:08,980 INFO L226 Difference]: Without dead ends: 153 [2020-11-30 01:27:08,980 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2020-11-30 01:27:08,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-11-30 01:27:08,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 118. [2020-11-30 01:27:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-11-30 01:27:08,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 146 transitions. [2020-11-30 01:27:08,985 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 146 transitions. Word has length 23 [2020-11-30 01:27:08,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:08,985 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 146 transitions. [2020-11-30 01:27:08,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-30 01:27:08,985 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 146 transitions. [2020-11-30 01:27:08,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-30 01:27:08,986 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:08,986 INFO L422 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] [2020-11-30 01:27:08,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-30 01:27:08,987 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:08,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:08,987 INFO L82 PathProgramCache]: Analyzing trace with hash 2016506411, now seen corresponding path program 1 times [2020-11-30 01:27:08,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:08,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355490421] [2020-11-30 01:27:08,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:09,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:09,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355490421] [2020-11-30 01:27:09,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:09,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-30 01:27:09,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327837630] [2020-11-30 01:27:09,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 01:27:09,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:09,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 01:27:09,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:27:09,178 INFO L87 Difference]: Start difference. First operand 118 states and 146 transitions. Second operand 9 states. [2020-11-30 01:27:09,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:09,554 INFO L93 Difference]: Finished difference Result 146 states and 162 transitions. [2020-11-30 01:27:09,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 01:27:09,555 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-11-30 01:27:09,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:09,556 INFO L225 Difference]: With dead ends: 146 [2020-11-30 01:27:09,556 INFO L226 Difference]: Without dead ends: 146 [2020-11-30 01:27:09,556 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:27:09,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-11-30 01:27:09,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 119. [2020-11-30 01:27:09,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-11-30 01:27:09,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 147 transitions. [2020-11-30 01:27:09,560 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 147 transitions. Word has length 24 [2020-11-30 01:27:09,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:09,560 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 147 transitions. [2020-11-30 01:27:09,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 01:27:09,560 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 147 transitions. [2020-11-30 01:27:09,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-30 01:27:09,561 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:09,561 INFO L422 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] [2020-11-30 01:27:09,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-30 01:27:09,562 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:09,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:09,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1912764758, now seen corresponding path program 1 times [2020-11-30 01:27:09,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:09,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647951005] [2020-11-30 01:27:09,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:09,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:09,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:09,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647951005] [2020-11-30 01:27:09,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:09,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-30 01:27:09,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646264427] [2020-11-30 01:27:09,691 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 01:27:09,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:09,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 01:27:09,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:27:09,692 INFO L87 Difference]: Start difference. First operand 119 states and 147 transitions. Second operand 9 states. [2020-11-30 01:27:09,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:09,971 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2020-11-30 01:27:09,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 01:27:09,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-11-30 01:27:09,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:09,977 INFO L225 Difference]: With dead ends: 138 [2020-11-30 01:27:09,977 INFO L226 Difference]: Without dead ends: 138 [2020-11-30 01:27:09,977 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-11-30 01:27:09,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-11-30 01:27:09,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 121. [2020-11-30 01:27:09,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-11-30 01:27:09,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 149 transitions. [2020-11-30 01:27:09,982 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 149 transitions. Word has length 25 [2020-11-30 01:27:09,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:09,982 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 149 transitions. [2020-11-30 01:27:09,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 01:27:09,982 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 149 transitions. [2020-11-30 01:27:09,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-30 01:27:09,983 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:09,983 INFO L422 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] [2020-11-30 01:27:09,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-30 01:27:09,983 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:09,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:09,984 INFO L82 PathProgramCache]: Analyzing trace with hash 2015122859, now seen corresponding path program 1 times [2020-11-30 01:27:09,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:09,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225420212] [2020-11-30 01:27:09,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:10,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:10,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:10,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225420212] [2020-11-30 01:27:10,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:10,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:27:10,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390614881] [2020-11-30 01:27:10,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:27:10,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:10,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:27:10,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:27:10,069 INFO L87 Difference]: Start difference. First operand 121 states and 149 transitions. Second operand 4 states. [2020-11-30 01:27:10,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:10,230 INFO L93 Difference]: Finished difference Result 124 states and 152 transitions. [2020-11-30 01:27:10,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:27:10,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-11-30 01:27:10,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:10,231 INFO L225 Difference]: With dead ends: 124 [2020-11-30 01:27:10,231 INFO L226 Difference]: Without dead ends: 124 [2020-11-30 01:27:10,232 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:27:10,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-11-30 01:27:10,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2020-11-30 01:27:10,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-11-30 01:27:10,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 152 transitions. [2020-11-30 01:27:10,238 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 152 transitions. Word has length 26 [2020-11-30 01:27:10,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:10,239 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 152 transitions. [2020-11-30 01:27:10,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:27:10,240 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 152 transitions. [2020-11-30 01:27:10,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-30 01:27:10,240 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:10,241 INFO L422 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] [2020-11-30 01:27:10,241 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-30 01:27:10,241 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:10,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:10,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1043329764, now seen corresponding path program 1 times [2020-11-30 01:27:10,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:10,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755110137] [2020-11-30 01:27:10,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:10,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:10,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:10,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755110137] [2020-11-30 01:27:10,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:10,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 01:27:10,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587225571] [2020-11-30 01:27:10,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:27:10,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:10,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:27:10,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:27:10,304 INFO L87 Difference]: Start difference. First operand 124 states and 152 transitions. Second operand 6 states. [2020-11-30 01:27:10,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:10,502 INFO L93 Difference]: Finished difference Result 123 states and 149 transitions. [2020-11-30 01:27:10,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:27:10,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-30 01:27:10,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:10,503 INFO L225 Difference]: With dead ends: 123 [2020-11-30 01:27:10,503 INFO L226 Difference]: Without dead ends: 123 [2020-11-30 01:27:10,504 INFO L677 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 [2020-11-30 01:27:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-11-30 01:27:10,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-11-30 01:27:10,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-11-30 01:27:10,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2020-11-30 01:27:10,507 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 25 [2020-11-30 01:27:10,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:10,507 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2020-11-30 01:27:10,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:27:10,508 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2020-11-30 01:27:10,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-30 01:27:10,508 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:10,508 INFO L422 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] [2020-11-30 01:27:10,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-30 01:27:10,508 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:10,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:10,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1043329763, now seen corresponding path program 1 times [2020-11-30 01:27:10,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:10,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373081246] [2020-11-30 01:27:10,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:10,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:10,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:10,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373081246] [2020-11-30 01:27:10,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:10,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-30 01:27:10,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075848445] [2020-11-30 01:27:10,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-30 01:27:10,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:10,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 01:27:10,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-11-30 01:27:10,715 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand 11 states. [2020-11-30 01:27:11,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:11,368 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2020-11-30 01:27:11,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 01:27:11,368 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-11-30 01:27:11,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:11,369 INFO L225 Difference]: With dead ends: 141 [2020-11-30 01:27:11,369 INFO L226 Difference]: Without dead ends: 141 [2020-11-30 01:27:11,369 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-11-30 01:27:11,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-11-30 01:27:11,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 123. [2020-11-30 01:27:11,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-11-30 01:27:11,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 148 transitions. [2020-11-30 01:27:11,374 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 148 transitions. Word has length 25 [2020-11-30 01:27:11,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:11,374 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 148 transitions. [2020-11-30 01:27:11,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-30 01:27:11,374 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 148 transitions. [2020-11-30 01:27:11,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-30 01:27:11,375 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:11,375 INFO L422 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] [2020-11-30 01:27:11,375 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-30 01:27:11,375 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:11,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:11,376 INFO L82 PathProgramCache]: Analyzing trace with hash -928172417, now seen corresponding path program 1 times [2020-11-30 01:27:11,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:11,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488249541] [2020-11-30 01:27:11,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:11,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:11,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:11,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488249541] [2020-11-30 01:27:11,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:11,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 01:27:11,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144613206] [2020-11-30 01:27:11,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:27:11,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:11,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:27:11,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:27:11,477 INFO L87 Difference]: Start difference. First operand 123 states and 148 transitions. Second operand 4 states. [2020-11-30 01:27:11,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:11,627 INFO L93 Difference]: Finished difference Result 188 states and 220 transitions. [2020-11-30 01:27:11,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:27:11,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-11-30 01:27:11,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:11,629 INFO L225 Difference]: With dead ends: 188 [2020-11-30 01:27:11,629 INFO L226 Difference]: Without dead ends: 188 [2020-11-30 01:27:11,630 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:27:11,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-11-30 01:27:11,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 135. [2020-11-30 01:27:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-11-30 01:27:11,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 162 transitions. [2020-11-30 01:27:11,635 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 162 transitions. Word has length 25 [2020-11-30 01:27:11,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:11,635 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 162 transitions. [2020-11-30 01:27:11,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:27:11,636 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 162 transitions. [2020-11-30 01:27:11,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-30 01:27:11,636 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:11,636 INFO L422 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] [2020-11-30 01:27:11,636 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-30 01:27:11,637 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:11,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:11,637 INFO L82 PathProgramCache]: Analyzing trace with hash 832417806, now seen corresponding path program 1 times [2020-11-30 01:27:11,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:11,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791233580] [2020-11-30 01:27:11,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:11,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:11,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:11,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791233580] [2020-11-30 01:27:11,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:11,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-30 01:27:11,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730311330] [2020-11-30 01:27:11,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 01:27:11,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:11,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 01:27:11,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-30 01:27:11,802 INFO L87 Difference]: Start difference. First operand 135 states and 162 transitions. Second operand 10 states. [2020-11-30 01:27:12,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:12,159 INFO L93 Difference]: Finished difference Result 151 states and 167 transitions. [2020-11-30 01:27:12,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 01:27:12,162 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-11-30 01:27:12,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:12,163 INFO L225 Difference]: With dead ends: 151 [2020-11-30 01:27:12,163 INFO L226 Difference]: Without dead ends: 151 [2020-11-30 01:27:12,163 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2020-11-30 01:27:12,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-11-30 01:27:12,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 135. [2020-11-30 01:27:12,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-11-30 01:27:12,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 161 transitions. [2020-11-30 01:27:12,167 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 161 transitions. Word has length 26 [2020-11-30 01:27:12,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:12,168 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 161 transitions. [2020-11-30 01:27:12,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 01:27:12,168 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 161 transitions. [2020-11-30 01:27:12,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-30 01:27:12,168 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:12,168 INFO L422 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] [2020-11-30 01:27:12,168 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-30 01:27:12,168 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:12,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:12,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1953522083, now seen corresponding path program 1 times [2020-11-30 01:27:12,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:12,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782261536] [2020-11-30 01:27:12,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:12,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:12,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:12,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782261536] [2020-11-30 01:27:12,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:12,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 01:27:12,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627466308] [2020-11-30 01:27:12,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 01:27:12,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:12,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 01:27:12,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-30 01:27:12,257 INFO L87 Difference]: Start difference. First operand 135 states and 161 transitions. Second operand 7 states. [2020-11-30 01:27:12,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:12,499 INFO L93 Difference]: Finished difference Result 138 states and 163 transitions. [2020-11-30 01:27:12,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 01:27:12,499 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-11-30 01:27:12,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:12,500 INFO L225 Difference]: With dead ends: 138 [2020-11-30 01:27:12,500 INFO L226 Difference]: Without dead ends: 138 [2020-11-30 01:27:12,501 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-30 01:27:12,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-11-30 01:27:12,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2020-11-30 01:27:12,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-11-30 01:27:12,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 162 transitions. [2020-11-30 01:27:12,505 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 162 transitions. Word has length 27 [2020-11-30 01:27:12,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:12,505 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 162 transitions. [2020-11-30 01:27:12,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 01:27:12,505 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 162 transitions. [2020-11-30 01:27:12,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-30 01:27:12,506 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:12,506 INFO L422 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] [2020-11-30 01:27:12,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-30 01:27:12,506 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:12,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:12,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1953522082, now seen corresponding path program 1 times [2020-11-30 01:27:12,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:12,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252771798] [2020-11-30 01:27:12,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:12,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:12,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:12,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252771798] [2020-11-30 01:27:12,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604221314] [2020-11-30 01:27:12,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/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 [2020-11-30 01:27:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:12,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 36 conjunts are in the unsatisfiable core [2020-11-30 01:27:12,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:27:13,127 INFO L384 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 [2020-11-30 01:27:13,127 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:13,136 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:13,140 INFO L384 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 [2020-11-30 01:27:13,140 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:13,147 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:13,148 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:13,148 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2020-11-30 01:27:13,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:13,208 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 01:27:13,208 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:13,224 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:13,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:13,235 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 01:27:13,236 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:13,248 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:13,249 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:13,249 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:25 [2020-11-30 01:27:13,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:13,350 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 01:27:13,351 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:13,375 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:13,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:13,382 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 01:27:13,382 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:13,393 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:13,395 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:13,395 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:25 [2020-11-30 01:27:13,736 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:13,736 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2020-11-30 01:27:13,737 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:13,747 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:13,754 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:13,754 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2020-11-30 01:27:13,755 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:13,769 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:13,770 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:13,770 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:9 [2020-11-30 01:27:13,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:13,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:27:13,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2020-11-30 01:27:13,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554355823] [2020-11-30 01:27:13,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-30 01:27:13,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:13,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-30 01:27:13,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2020-11-30 01:27:13,842 INFO L87 Difference]: Start difference. First operand 136 states and 162 transitions. Second operand 19 states. [2020-11-30 01:27:14,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:14,970 INFO L93 Difference]: Finished difference Result 183 states and 202 transitions. [2020-11-30 01:27:14,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 01:27:14,970 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 27 [2020-11-30 01:27:14,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:14,971 INFO L225 Difference]: With dead ends: 183 [2020-11-30 01:27:14,971 INFO L226 Difference]: Without dead ends: 183 [2020-11-30 01:27:14,972 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=161, Invalid=541, Unknown=0, NotChecked=0, Total=702 [2020-11-30 01:27:14,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-11-30 01:27:14,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 151. [2020-11-30 01:27:14,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-11-30 01:27:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 183 transitions. [2020-11-30 01:27:14,977 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 183 transitions. Word has length 27 [2020-11-30 01:27:14,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:14,977 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 183 transitions. [2020-11-30 01:27:14,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-30 01:27:14,977 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 183 transitions. [2020-11-30 01:27:14,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 01:27:14,978 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:14,978 INFO L422 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] [2020-11-30 01:27:15,197 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2020-11-30 01:27:15,198 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:15,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:15,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1222659237, now seen corresponding path program 1 times [2020-11-30 01:27:15,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:15,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343658642] [2020-11-30 01:27:15,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:15,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:15,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:15,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343658642] [2020-11-30 01:27:15,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262443534] [2020-11-30 01:27:15,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/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 [2020-11-30 01:27:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:15,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 28 conjunts are in the unsatisfiable core [2020-11-30 01:27:15,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:27:15,583 INFO L384 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 [2020-11-30 01:27:15,583 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:15,585 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:15,585 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:15,586 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 01:27:15,594 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_48|], 3=[|v_#valid_58|]} [2020-11-30 01:27:15,600 INFO L384 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 [2020-11-30 01:27:15,600 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:15,640 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:15,666 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:15,666 INFO L384 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 [2020-11-30 01:27:15,668 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:15,704 INFO L625 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2020-11-30 01:27:15,704 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:15,704 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2020-11-30 01:27:15,759 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 01:27:15,759 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:15,778 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:15,779 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:15,780 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:38 [2020-11-30 01:27:15,910 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:15,911 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 56 [2020-11-30 01:27:15,912 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:15,942 INFO L625 ElimStorePlain]: treesize reduction 24, result has 60.7 percent of original size [2020-11-30 01:27:15,942 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:15,942 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:37 [2020-11-30 01:27:15,999 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 01:27:15,999 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:16,023 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:16,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:16,031 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2020-11-30 01:27:16,032 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:16,048 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:16,049 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:16,049 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:35 [2020-11-30 01:27:16,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:16,139 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:16,139 INFO L384 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 60 treesize of output 91 [2020-11-30 01:27:16,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-11-30 01:27:16,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 01:27:16,147 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:16,181 INFO L625 ElimStorePlain]: treesize reduction 60, result has 40.0 percent of original size [2020-11-30 01:27:16,183 INFO L545 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. [2020-11-30 01:27:16,183 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:40 [2020-11-30 01:27:16,252 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:16,253 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2020-11-30 01:27:16,253 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:16,262 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:16,267 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:27:16,267 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:15 [2020-11-30 01:27:16,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:16,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:27:16,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2020-11-30 01:27:16,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410275784] [2020-11-30 01:27:16,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-30 01:27:16,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:16,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-30 01:27:16,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2020-11-30 01:27:16,355 INFO L87 Difference]: Start difference. First operand 151 states and 183 transitions. Second operand 22 states. [2020-11-30 01:27:17,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:17,543 INFO L93 Difference]: Finished difference Result 248 states and 284 transitions. [2020-11-30 01:27:17,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-30 01:27:17,544 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2020-11-30 01:27:17,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:17,545 INFO L225 Difference]: With dead ends: 248 [2020-11-30 01:27:17,545 INFO L226 Difference]: Without dead ends: 248 [2020-11-30 01:27:17,546 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=260, Invalid=930, Unknown=0, NotChecked=0, Total=1190 [2020-11-30 01:27:17,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-11-30 01:27:17,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 173. [2020-11-30 01:27:17,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-11-30 01:27:17,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 209 transitions. [2020-11-30 01:27:17,552 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 209 transitions. Word has length 28 [2020-11-30 01:27:17,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:17,553 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 209 transitions. [2020-11-30 01:27:17,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-30 01:27:17,553 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 209 transitions. [2020-11-30 01:27:17,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 01:27:17,554 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:17,554 INFO L422 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] [2020-11-30 01:27:17,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-11-30 01:27:17,766 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:17,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:17,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1222659238, now seen corresponding path program 1 times [2020-11-30 01:27:17,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:17,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340726419] [2020-11-30 01:27:17,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:18,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:18,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:18,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340726419] [2020-11-30 01:27:18,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935382643] [2020-11-30 01:27:18,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/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 [2020-11-30 01:27:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:18,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 37 conjunts are in the unsatisfiable core [2020-11-30 01:27:18,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:27:18,163 INFO L384 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 [2020-11-30 01:27:18,163 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:18,165 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:18,165 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:18,165 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 01:27:18,173 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_49|], 1=[|v_#valid_60|]} [2020-11-30 01:27:18,178 INFO L384 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 [2020-11-30 01:27:18,178 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:18,188 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:18,203 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:18,204 INFO L384 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 [2020-11-30 01:27:18,204 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:18,213 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:18,213 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:18,213 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2020-11-30 01:27:18,222 INFO L384 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 [2020-11-30 01:27:18,222 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:18,239 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:18,264 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 01:27:18,264 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:18,279 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:18,279 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:18,279 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2020-11-30 01:27:18,414 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:18,414 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2020-11-30 01:27:18,415 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:18,463 INFO L625 ElimStorePlain]: treesize reduction 24, result has 65.2 percent of original size [2020-11-30 01:27:18,467 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-11-30 01:27:18,468 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:18,485 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:18,486 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:18,486 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:41 [2020-11-30 01:27:18,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:18,544 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2020-11-30 01:27:18,545 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:18,574 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:18,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:18,582 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2020-11-30 01:27:18,582 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:18,605 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:18,605 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:18,605 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:48 [2020-11-30 01:27:18,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:18,698 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:18,698 INFO L384 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 113 treesize of output 124 [2020-11-30 01:27:18,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-11-30 01:27:18,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-30 01:27:18,702 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:18,757 INFO L625 ElimStorePlain]: treesize reduction 32, result has 74.2 percent of original size [2020-11-30 01:27:18,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:18,764 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 25 [2020-11-30 01:27:18,765 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:18,801 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:18,803 INFO L545 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. [2020-11-30 01:27:18,803 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:123, output treesize:61 [2020-11-30 01:27:18,886 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:18,886 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 45 [2020-11-30 01:27:18,887 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:18,900 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:18,903 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-11-30 01:27:18,905 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:18,914 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:18,915 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:18,915 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:75, output treesize:14 [2020-11-30 01:27:18,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:18,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:27:18,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 17 [2020-11-30 01:27:18,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371283888] [2020-11-30 01:27:18,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-30 01:27:18,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:18,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-30 01:27:18,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2020-11-30 01:27:18,932 INFO L87 Difference]: Start difference. First operand 173 states and 209 transitions. Second operand 18 states. [2020-11-30 01:27:20,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:20,068 INFO L93 Difference]: Finished difference Result 246 states and 288 transitions. [2020-11-30 01:27:20,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-30 01:27:20,068 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2020-11-30 01:27:20,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:20,069 INFO L225 Difference]: With dead ends: 246 [2020-11-30 01:27:20,069 INFO L226 Difference]: Without dead ends: 246 [2020-11-30 01:27:20,070 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=654, Unknown=0, NotChecked=0, Total=812 [2020-11-30 01:27:20,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2020-11-30 01:27:20,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 187. [2020-11-30 01:27:20,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-11-30 01:27:20,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 229 transitions. [2020-11-30 01:27:20,076 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 229 transitions. Word has length 28 [2020-11-30 01:27:20,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:20,076 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 229 transitions. [2020-11-30 01:27:20,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-30 01:27:20,076 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 229 transitions. [2020-11-30 01:27:20,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-30 01:27:20,076 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:20,076 INFO L422 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] [2020-11-30 01:27:20,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-11-30 01:27:20,298 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:20,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:20,298 INFO L82 PathProgramCache]: Analyzing trace with hash -752289896, now seen corresponding path program 1 times [2020-11-30 01:27:20,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:20,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558989530] [2020-11-30 01:27:20,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:20,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:20,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558989530] [2020-11-30 01:27:20,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233811291] [2020-11-30 01:27:20,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/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 [2020-11-30 01:27:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:20,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 29 conjunts are in the unsatisfiable core [2020-11-30 01:27:20,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:27:20,734 INFO L384 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 [2020-11-30 01:27:20,734 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:20,737 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:20,737 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:20,737 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 01:27:20,747 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_50|], 1=[|v_#valid_62|]} [2020-11-30 01:27:20,751 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-11-30 01:27:20,752 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:20,769 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:20,781 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:20,781 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-11-30 01:27:20,782 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:20,795 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:20,795 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:20,795 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2020-11-30 01:27:20,838 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 01:27:20,838 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:20,852 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:20,852 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:20,853 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:32 [2020-11-30 01:27:20,988 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:20,988 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 55 [2020-11-30 01:27:20,989 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:21,028 INFO L625 ElimStorePlain]: treesize reduction 24, result has 56.4 percent of original size [2020-11-30 01:27:21,029 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:21,029 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:31 [2020-11-30 01:27:21,083 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 13 treesize of output 9 [2020-11-30 01:27:21,084 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:21,103 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:21,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:21,111 INFO L384 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 21 [2020-11-30 01:27:21,112 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:21,127 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:21,127 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:21,127 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:29 [2020-11-30 01:27:21,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:21,221 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:21,222 INFO L384 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 59 treesize of output 90 [2020-11-30 01:27:21,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-11-30 01:27:21,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 01:27:21,225 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:21,256 INFO L625 ElimStorePlain]: treesize reduction 60, result has 36.2 percent of original size [2020-11-30 01:27:21,257 INFO L545 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. [2020-11-30 01:27:21,257 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2020-11-30 01:27:21,336 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:21,336 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2020-11-30 01:27:21,337 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:21,345 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:21,347 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:21,347 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:4 [2020-11-30 01:27:21,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:21,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:27:21,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2020-11-30 01:27:21,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545530592] [2020-11-30 01:27:21,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-30 01:27:21,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:21,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-30 01:27:21,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2020-11-30 01:27:21,359 INFO L87 Difference]: Start difference. First operand 187 states and 229 transitions. Second operand 20 states. [2020-11-30 01:27:22,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:22,463 INFO L93 Difference]: Finished difference Result 245 states and 286 transitions. [2020-11-30 01:27:22,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-30 01:27:22,464 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2020-11-30 01:27:22,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:22,465 INFO L225 Difference]: With dead ends: 245 [2020-11-30 01:27:22,465 INFO L226 Difference]: Without dead ends: 245 [2020-11-30 01:27:22,465 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=144, Invalid=668, Unknown=0, NotChecked=0, Total=812 [2020-11-30 01:27:22,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2020-11-30 01:27:22,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 187. [2020-11-30 01:27:22,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-11-30 01:27:22,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 228 transitions. [2020-11-30 01:27:22,470 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 228 transitions. Word has length 29 [2020-11-30 01:27:22,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:22,471 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 228 transitions. [2020-11-30 01:27:22,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-30 01:27:22,471 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 228 transitions. [2020-11-30 01:27:22,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-30 01:27:22,471 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:22,471 INFO L422 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] [2020-11-30 01:27:22,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:27:22,686 INFO L429 AbstractCegarLoop]: === Iteration 28 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:22,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:22,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1162533043, now seen corresponding path program 1 times [2020-11-30 01:27:22,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:22,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674477958] [2020-11-30 01:27:22,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:22,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:22,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:22,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674477958] [2020-11-30 01:27:22,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:22,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-30 01:27:22,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337896693] [2020-11-30 01:27:22,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-30 01:27:22,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:22,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 01:27:22,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-30 01:27:22,997 INFO L87 Difference]: Start difference. First operand 187 states and 228 transitions. Second operand 12 states. [2020-11-30 01:27:23,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:23,519 INFO L93 Difference]: Finished difference Result 199 states and 230 transitions. [2020-11-30 01:27:23,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-30 01:27:23,520 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2020-11-30 01:27:23,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:23,521 INFO L225 Difference]: With dead ends: 199 [2020-11-30 01:27:23,521 INFO L226 Difference]: Without dead ends: 199 [2020-11-30 01:27:23,521 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2020-11-30 01:27:23,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-11-30 01:27:23,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 186. [2020-11-30 01:27:23,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-11-30 01:27:23,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 226 transitions. [2020-11-30 01:27:23,526 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 226 transitions. Word has length 30 [2020-11-30 01:27:23,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:23,527 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 226 transitions. [2020-11-30 01:27:23,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-30 01:27:23,527 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 226 transitions. [2020-11-30 01:27:23,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-30 01:27:23,527 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:23,527 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:23,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-30 01:27:23,528 INFO L429 AbstractCegarLoop]: === Iteration 29 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:23,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:23,528 INFO L82 PathProgramCache]: Analyzing trace with hash -569428324, now seen corresponding path program 1 times [2020-11-30 01:27:23,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:23,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913885161] [2020-11-30 01:27:23,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:23,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:23,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:23,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913885161] [2020-11-30 01:27:23,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654204287] [2020-11-30 01:27:23,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/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 [2020-11-30 01:27:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:23,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 37 conjunts are in the unsatisfiable core [2020-11-30 01:27:23,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:27:23,904 INFO L384 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 [2020-11-30 01:27:23,904 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:23,912 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:23,915 INFO L384 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 [2020-11-30 01:27:23,916 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:23,923 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:23,923 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:23,924 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2020-11-30 01:27:23,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:23,938 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 01:27:23,938 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:23,948 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:23,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:23,952 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 01:27:23,953 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:23,960 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:23,960 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:23,960 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:18 [2020-11-30 01:27:23,996 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_21|], 2=[|v_#memory_$Pointer$.offset_31|, |v_#memory_$Pointer$.base_39|]} [2020-11-30 01:27:24,006 INFO L384 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 [2020-11-30 01:27:24,007 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:24,020 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:24,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:24,025 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 01:27:24,025 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:24,036 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:24,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:24,040 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 01:27:24,041 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:24,050 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:24,051 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:24,051 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:72, output treesize:27 [2020-11-30 01:27:24,226 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 01:27:24,230 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:24,230 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2020-11-30 01:27:24,230 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:24,253 INFO L625 ElimStorePlain]: treesize reduction 5, result has 87.5 percent of original size [2020-11-30 01:27:24,254 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:24,254 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:32 [2020-11-30 01:27:24,296 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 01:27:24,296 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2020-11-30 01:27:24,297 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:24,302 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:24,303 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:24,303 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:18 [2020-11-30 01:27:24,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:27:24,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:24,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 01:27:24,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2020-11-30 01:27:24,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104757131] [2020-11-30 01:27:24,380 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-30 01:27:24,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:24,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 01:27:24,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=330, Unknown=3, NotChecked=0, Total=380 [2020-11-30 01:27:24,381 INFO L87 Difference]: Start difference. First operand 186 states and 226 transitions. Second operand 11 states. [2020-11-30 01:27:25,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:25,303 INFO L93 Difference]: Finished difference Result 198 states and 228 transitions. [2020-11-30 01:27:25,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 01:27:25,303 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2020-11-30 01:27:25,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:25,305 INFO L225 Difference]: With dead ends: 198 [2020-11-30 01:27:25,305 INFO L226 Difference]: Without dead ends: 198 [2020-11-30 01:27:25,307 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=109, Invalid=537, Unknown=4, NotChecked=0, Total=650 [2020-11-30 01:27:25,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-11-30 01:27:25,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2020-11-30 01:27:25,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-11-30 01:27:25,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 225 transitions. [2020-11-30 01:27:25,312 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 225 transitions. Word has length 30 [2020-11-30 01:27:25,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:25,313 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 225 transitions. [2020-11-30 01:27:25,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-30 01:27:25,313 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 225 transitions. [2020-11-30 01:27:25,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-11-30 01:27:25,313 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:25,314 INFO L422 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] [2020-11-30 01:27:25,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2020-11-30 01:27:25,526 INFO L429 AbstractCegarLoop]: === Iteration 30 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:25,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:25,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1376222380, now seen corresponding path program 1 times [2020-11-30 01:27:25,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:25,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150123157] [2020-11-30 01:27:25,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:25,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:25,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:25,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150123157] [2020-11-30 01:27:25,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7836606] [2020-11-30 01:27:25,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/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 [2020-11-30 01:27:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:26,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 41 conjunts are in the unsatisfiable core [2020-11-30 01:27:26,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:27:26,032 INFO L384 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 [2020-11-30 01:27:26,032 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:26,034 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:26,034 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:26,035 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 01:27:26,038 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_51|], 1=[|v_#valid_64|]} [2020-11-30 01:27:26,042 INFO L384 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 [2020-11-30 01:27:26,042 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:26,054 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:26,070 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:26,070 INFO L384 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 [2020-11-30 01:27:26,071 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:26,081 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:26,082 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:26,082 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2020-11-30 01:27:26,125 INFO L384 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 [2020-11-30 01:27:26,125 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:26,141 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:26,146 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 01:27:26,147 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:26,162 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:26,162 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:26,163 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:31 [2020-11-30 01:27:26,282 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:26,282 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2020-11-30 01:27:26,282 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:26,310 INFO L625 ElimStorePlain]: treesize reduction 24, result has 65.2 percent of original size [2020-11-30 01:27:26,314 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-11-30 01:27:26,315 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:26,326 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:26,326 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:26,326 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:41 [2020-11-30 01:27:26,379 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 01:27:26,379 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:26,400 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:26,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:26,406 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2020-11-30 01:27:26,406 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:26,422 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:26,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:26,426 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2020-11-30 01:27:26,427 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:26,439 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:26,439 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:26,439 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:86, output treesize:39 [2020-11-30 01:27:26,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:26,549 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:26,550 INFO L384 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 93 treesize of output 112 [2020-11-30 01:27:26,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 2, 1] term [2020-11-30 01:27:26,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-30 01:27:26,552 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:26,591 INFO L625 ElimStorePlain]: treesize reduction 32, result has 70.1 percent of original size [2020-11-30 01:27:26,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:26,601 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 25 [2020-11-30 01:27:26,602 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:26,614 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:26,615 INFO L545 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. [2020-11-30 01:27:26,615 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:106, output treesize:44 [2020-11-30 01:27:26,689 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2020-11-30 01:27:26,691 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:26,704 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:26,707 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-11-30 01:27:26,708 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:63, output treesize:41 [2020-11-30 01:27:26,905 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 01:27:26,925 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:26,925 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 41 [2020-11-30 01:27:26,926 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 01:27:26,927 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:26,940 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:26,942 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:26,942 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:5 [2020-11-30 01:27:26,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:26,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:27:26,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 23 [2020-11-30 01:27:26,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674293299] [2020-11-30 01:27:26,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-30 01:27:26,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:26,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-30 01:27:26,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=499, Unknown=0, NotChecked=0, Total=552 [2020-11-30 01:27:26,951 INFO L87 Difference]: Start difference. First operand 186 states and 225 transitions. Second operand 24 states. [2020-11-30 01:27:29,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:29,868 INFO L93 Difference]: Finished difference Result 241 states and 280 transitions. [2020-11-30 01:27:29,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-30 01:27:29,869 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2020-11-30 01:27:29,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:29,870 INFO L225 Difference]: With dead ends: 241 [2020-11-30 01:27:29,871 INFO L226 Difference]: Without dead ends: 241 [2020-11-30 01:27:29,871 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2020-11-30 01:27:29,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-11-30 01:27:29,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 186. [2020-11-30 01:27:29,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-11-30 01:27:29,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 224 transitions. [2020-11-30 01:27:29,880 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 224 transitions. Word has length 31 [2020-11-30 01:27:29,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:29,880 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 224 transitions. [2020-11-30 01:27:29,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-30 01:27:29,881 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 224 transitions. [2020-11-30 01:27:29,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-11-30 01:27:29,881 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:29,881 INFO L422 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] [2020-11-30 01:27:30,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:27:30,094 INFO L429 AbstractCegarLoop]: === Iteration 31 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:30,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:30,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1376222379, now seen corresponding path program 1 times [2020-11-30 01:27:30,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:30,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905294360] [2020-11-30 01:27:30,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:30,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:30,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:30,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905294360] [2020-11-30 01:27:30,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341306285] [2020-11-30 01:27:30,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/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 [2020-11-30 01:27:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:30,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 41 conjunts are in the unsatisfiable core [2020-11-30 01:27:30,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:27:30,527 INFO L384 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 [2020-11-30 01:27:30,527 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:30,529 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:30,530 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:30,530 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 01:27:30,608 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:30,608 INFO L384 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 [2020-11-30 01:27:30,609 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:30,620 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:30,623 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2020-11-30 01:27:30,623 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:30,635 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:30,635 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:30,635 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2020-11-30 01:27:30,679 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 01:27:30,680 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:30,702 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:30,707 INFO L384 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 [2020-11-30 01:27:30,707 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:30,727 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:30,727 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:30,728 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:41 [2020-11-30 01:27:30,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:30,854 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-11-30 01:27:30,854 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:30,871 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:30,908 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:30,908 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2020-11-30 01:27:30,909 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:30,952 INFO L625 ElimStorePlain]: treesize reduction 24, result has 68.0 percent of original size [2020-11-30 01:27:30,952 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:30,953 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:51 [2020-11-30 01:27:31,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:31,018 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2020-11-30 01:27:31,019 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:31,047 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:31,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:31,055 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2020-11-30 01:27:31,056 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:31,076 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:31,077 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:31,077 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:58 [2020-11-30 01:27:31,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:31,160 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 25 [2020-11-30 01:27:31,160 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:31,186 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:31,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:31,218 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:31,218 INFO L384 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 82 treesize of output 105 [2020-11-30 01:27:31,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-11-30 01:27:31,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-30 01:27:31,221 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:31,266 INFO L625 ElimStorePlain]: treesize reduction 32, result has 68.9 percent of original size [2020-11-30 01:27:31,267 INFO L545 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. [2020-11-30 01:27:31,267 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:133, output treesize:71 [2020-11-30 01:27:31,587 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:31,587 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 72 [2020-11-30 01:27:31,589 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-30 01:27:31,591 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-30 01:27:31,592 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:27:31,667 INFO L625 ElimStorePlain]: treesize reduction 17, result has 79.0 percent of original size [2020-11-30 01:27:31,677 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:31,677 INFO L384 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 1 case distinctions, treesize of input 29 treesize of output 21 [2020-11-30 01:27:31,678 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:31,722 INFO L625 ElimStorePlain]: treesize reduction 5, result has 89.4 percent of original size [2020-11-30 01:27:31,725 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:27:31,726 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:103, output treesize:25 [2020-11-30 01:27:31,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:31,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:27:31,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2020-11-30 01:27:31,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826727903] [2020-11-30 01:27:31,790 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-11-30 01:27:31,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:31,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-11-30 01:27:31,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2020-11-30 01:27:31,791 INFO L87 Difference]: Start difference. First operand 186 states and 224 transitions. Second operand 29 states. [2020-11-30 01:27:34,481 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2020-11-30 01:27:36,459 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2020-11-30 01:27:37,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:37,468 INFO L93 Difference]: Finished difference Result 242 states and 280 transitions. [2020-11-30 01:27:37,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-30 01:27:37,469 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 31 [2020-11-30 01:27:37,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:37,471 INFO L225 Difference]: With dead ends: 242 [2020-11-30 01:27:37,471 INFO L226 Difference]: Without dead ends: 242 [2020-11-30 01:27:37,472 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=244, Invalid=1396, Unknown=0, NotChecked=0, Total=1640 [2020-11-30 01:27:37,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-11-30 01:27:37,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 186. [2020-11-30 01:27:37,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-11-30 01:27:37,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 223 transitions. [2020-11-30 01:27:37,478 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 223 transitions. Word has length 31 [2020-11-30 01:27:37,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:37,478 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 223 transitions. [2020-11-30 01:27:37,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-11-30 01:27:37,478 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 223 transitions. [2020-11-30 01:27:37,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-30 01:27:37,479 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:37,479 INFO L422 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] [2020-11-30 01:27:37,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:27:37,698 INFO L429 AbstractCegarLoop]: === Iteration 32 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:37,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:37,698 INFO L82 PathProgramCache]: Analyzing trace with hash 286764382, now seen corresponding path program 1 times [2020-11-30 01:27:37,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:37,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53102676] [2020-11-30 01:27:37,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:37,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:37,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 01:27:37,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53102676] [2020-11-30 01:27:37,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:27:37,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 01:27:37,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155774773] [2020-11-30 01:27:37,828 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 01:27:37,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:37,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 01:27:37,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-30 01:27:37,828 INFO L87 Difference]: Start difference. First operand 186 states and 223 transitions. Second operand 8 states. [2020-11-30 01:27:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:38,229 INFO L93 Difference]: Finished difference Result 218 states and 255 transitions. [2020-11-30 01:27:38,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 01:27:38,229 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-11-30 01:27:38,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:38,231 INFO L225 Difference]: With dead ends: 218 [2020-11-30 01:27:38,231 INFO L226 Difference]: Without dead ends: 218 [2020-11-30 01:27:38,231 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-11-30 01:27:38,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-11-30 01:27:38,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 185. [2020-11-30 01:27:38,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-11-30 01:27:38,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 220 transitions. [2020-11-30 01:27:38,236 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 220 transitions. Word has length 32 [2020-11-30 01:27:38,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:38,236 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 220 transitions. [2020-11-30 01:27:38,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 01:27:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 220 transitions. [2020-11-30 01:27:38,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-30 01:27:38,237 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:38,237 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:38,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-30 01:27:38,239 INFO L429 AbstractCegarLoop]: === Iteration 33 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:38,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:38,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1699416668, now seen corresponding path program 1 times [2020-11-30 01:27:38,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:38,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455225082] [2020-11-30 01:27:38,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:38,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:38,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:38,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455225082] [2020-11-30 01:27:38,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134545970] [2020-11-30 01:27:38,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:27:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:38,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 37 conjunts are in the unsatisfiable core [2020-11-30 01:27:38,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:27:38,631 INFO L384 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 [2020-11-30 01:27:38,631 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:38,635 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:38,636 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:38,636 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 01:27:38,668 INFO L384 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 [2020-11-30 01:27:38,669 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:38,688 INFO L625 ElimStorePlain]: treesize reduction 3, result has 90.0 percent of original size [2020-11-30 01:27:38,691 INFO L384 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 [2020-11-30 01:27:38,691 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:38,700 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:38,700 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:38,701 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2020-11-30 01:27:38,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:38,731 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 01:27:38,731 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:38,742 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:38,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:38,747 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 01:27:38,748 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:38,767 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:38,767 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:38,767 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2020-11-30 01:27:38,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:38,806 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 01:27:38,806 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:38,819 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:38,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:38,824 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 01:27:38,824 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:38,834 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:38,837 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:38,837 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:23 [2020-11-30 01:27:39,030 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:39,030 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2020-11-30 01:27:39,031 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:39,040 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:39,041 INFO L545 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. [2020-11-30 01:27:39,041 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:27 [2020-11-30 01:27:39,152 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:39,152 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 37 [2020-11-30 01:27:39,153 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:39,157 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:39,158 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:39,158 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2020-11-30 01:27:39,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:39,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:27:39,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2020-11-30 01:27:39,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890508080] [2020-11-30 01:27:39,168 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-30 01:27:39,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:39,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-30 01:27:39,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2020-11-30 01:27:39,171 INFO L87 Difference]: Start difference. First operand 185 states and 220 transitions. Second operand 19 states. [2020-11-30 01:27:40,373 WARN L193 SmtUtils]: Spent 721.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-11-30 01:27:40,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:40,821 INFO L93 Difference]: Finished difference Result 208 states and 233 transitions. [2020-11-30 01:27:40,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-30 01:27:40,821 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2020-11-30 01:27:40,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:40,823 INFO L225 Difference]: With dead ends: 208 [2020-11-30 01:27:40,823 INFO L226 Difference]: Without dead ends: 208 [2020-11-30 01:27:40,823 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=178, Invalid=634, Unknown=0, NotChecked=0, Total=812 [2020-11-30 01:27:40,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-11-30 01:27:40,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 185. [2020-11-30 01:27:40,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-11-30 01:27:40,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 219 transitions. [2020-11-30 01:27:40,828 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 219 transitions. Word has length 34 [2020-11-30 01:27:40,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:40,829 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 219 transitions. [2020-11-30 01:27:40,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-30 01:27:40,829 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2020-11-30 01:27:40,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-30 01:27:40,830 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:40,830 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:41,041 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2020-11-30 01:27:41,042 INFO L429 AbstractCegarLoop]: === Iteration 34 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:41,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:41,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1699416667, now seen corresponding path program 1 times [2020-11-30 01:27:41,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:41,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044283635] [2020-11-30 01:27:41,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:41,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:41,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044283635] [2020-11-30 01:27:41,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137236545] [2020-11-30 01:27:41,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:27:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:41,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 38 conjunts are in the unsatisfiable core [2020-11-30 01:27:41,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:27:41,409 INFO L384 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 [2020-11-30 01:27:41,409 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:41,415 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:41,417 INFO L384 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 [2020-11-30 01:27:41,418 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:41,430 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:41,431 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:41,431 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2020-11-30 01:27:41,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:41,459 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 01:27:41,459 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:41,476 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:41,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:41,481 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 01:27:41,481 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:41,490 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:41,490 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:41,491 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:25 [2020-11-30 01:27:41,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:41,558 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 01:27:41,558 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:41,573 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:41,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:41,580 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 01:27:41,581 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:41,597 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:41,598 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:41,598 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:25 [2020-11-30 01:27:45,773 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:45,774 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2020-11-30 01:27:45,774 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:45,783 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:45,790 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:45,791 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2020-11-30 01:27:45,791 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:45,798 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:45,798 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:45,799 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:9 [2020-11-30 01:27:45,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-30 01:27:45,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:27:45,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2020-11-30 01:27:45,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152550112] [2020-11-30 01:27:45,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-30 01:27:45,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:45,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-30 01:27:45,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=284, Unknown=6, NotChecked=0, Total=342 [2020-11-30 01:27:45,835 INFO L87 Difference]: Start difference. First operand 185 states and 219 transitions. Second operand 19 states. [2020-11-30 01:27:50,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:50,787 INFO L93 Difference]: Finished difference Result 199 states and 224 transitions. [2020-11-30 01:27:50,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 01:27:50,787 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2020-11-30 01:27:50,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:50,789 INFO L225 Difference]: With dead ends: 199 [2020-11-30 01:27:50,789 INFO L226 Difference]: Without dead ends: 199 [2020-11-30 01:27:50,789 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=127, Invalid=467, Unknown=6, NotChecked=0, Total=600 [2020-11-30 01:27:50,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-11-30 01:27:50,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 175. [2020-11-30 01:27:50,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-11-30 01:27:50,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 200 transitions. [2020-11-30 01:27:50,793 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 200 transitions. Word has length 34 [2020-11-30 01:27:50,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:50,794 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 200 transitions. [2020-11-30 01:27:50,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-30 01:27:50,794 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 200 transitions. [2020-11-30 01:27:50,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-30 01:27:50,794 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:50,794 INFO L422 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] [2020-11-30 01:27:50,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:27:50,995 INFO L429 AbstractCegarLoop]: === Iteration 35 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:50,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:50,995 INFO L82 PathProgramCache]: Analyzing trace with hash 702667948, now seen corresponding path program 1 times [2020-11-30 01:27:50,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:50,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269927100] [2020-11-30 01:27:50,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:51,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-30 01:27:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:51,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:51,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269927100] [2020-11-30 01:27:51,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099821925] [2020-11-30 01:27:51,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:27:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:51,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 39 conjunts are in the unsatisfiable core [2020-11-30 01:27:51,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:27:51,419 INFO L384 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 [2020-11-30 01:27:51,420 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:51,422 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:51,422 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:51,422 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 01:27:51,429 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_53|], 1=[|v_#valid_69|]} [2020-11-30 01:27:51,433 INFO L384 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 [2020-11-30 01:27:51,434 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:51,445 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:51,454 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:51,455 INFO L384 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 [2020-11-30 01:27:51,455 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:51,465 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:51,465 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:51,465 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2020-11-30 01:27:51,509 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 01:27:51,509 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:51,522 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:51,526 INFO L384 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 [2020-11-30 01:27:51,526 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:51,538 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:51,539 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:51,539 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:31 [2020-11-30 01:27:51,659 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:51,659 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2020-11-30 01:27:51,659 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:51,710 INFO L625 ElimStorePlain]: treesize reduction 24, result has 65.2 percent of original size [2020-11-30 01:27:51,717 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-11-30 01:27:51,718 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:51,737 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:51,737 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:51,737 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:41 [2020-11-30 01:27:51,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:51,780 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2020-11-30 01:27:51,780 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:51,797 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:51,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:51,806 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2020-11-30 01:27:51,807 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:51,820 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:51,820 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:51,821 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:48 [2020-11-30 01:27:51,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:51,871 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 25 [2020-11-30 01:27:51,871 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:51,887 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:51,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:27:51,914 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:51,915 INFO L384 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 82 treesize of output 105 [2020-11-30 01:27:51,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-11-30 01:27:51,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-11-30 01:27:51,917 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:51,943 INFO L625 ElimStorePlain]: treesize reduction 60, result has 50.4 percent of original size [2020-11-30 01:27:51,944 INFO L545 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. [2020-11-30 01:27:51,944 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:123, output treesize:61 [2020-11-30 01:27:52,013 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:52,013 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 45 [2020-11-30 01:27:52,014 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:52,029 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:52,030 INFO L545 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. [2020-11-30 01:27:52,030 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:75, output treesize:41 [2020-11-30 01:27:52,157 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2020-11-30 01:27:52,157 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:52,168 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:52,170 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:27:52,170 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:32 [2020-11-30 01:27:52,232 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 13 [2020-11-30 01:27:52,233 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:27:52,243 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:27:52,244 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:27:52,244 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:7 [2020-11-30 01:27:52,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:27:52,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:27:52,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2020-11-30 01:27:52,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051813146] [2020-11-30 01:27:52,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-11-30 01:27:52,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:52,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-11-30 01:27:52,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2020-11-30 01:27:52,297 INFO L87 Difference]: Start difference. First operand 175 states and 200 transitions. Second operand 26 states. [2020-11-30 01:27:54,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:54,094 INFO L93 Difference]: Finished difference Result 229 states and 257 transitions. [2020-11-30 01:27:54,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-30 01:27:54,095 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 34 [2020-11-30 01:27:54,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:54,096 INFO L225 Difference]: With dead ends: 229 [2020-11-30 01:27:54,096 INFO L226 Difference]: Without dead ends: 229 [2020-11-30 01:27:54,097 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=284, Invalid=1522, Unknown=0, NotChecked=0, Total=1806 [2020-11-30 01:27:54,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-11-30 01:27:54,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 196. [2020-11-30 01:27:54,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-11-30 01:27:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 232 transitions. [2020-11-30 01:27:54,104 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 232 transitions. Word has length 34 [2020-11-30 01:27:54,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:54,104 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 232 transitions. [2020-11-30 01:27:54,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-11-30 01:27:54,104 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 232 transitions. [2020-11-30 01:27:54,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-30 01:27:54,105 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:54,105 INFO L422 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] [2020-11-30 01:27:54,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:27:54,319 INFO L429 AbstractCegarLoop]: === Iteration 36 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:27:54,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:54,319 INFO L82 PathProgramCache]: Analyzing trace with hash 307870135, now seen corresponding path program 1 times [2020-11-30 01:27:54,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:54,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164916595] [2020-11-30 01:27:54,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:54,351 ERROR L253 erpolLogProxyWrapper]: Interpolant 9 not inductive [2020-11-30 01:27:54,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-11-30 01:27:54,361 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:219) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:876) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:241) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-30 01:27:54,367 INFO L168 Benchmark]: Toolchain (without parser) took 58151.90 ms. Allocated memory was 88.1 MB in the beginning and 255.9 MB in the end (delta: 167.8 MB). Free memory was 55.6 MB in the beginning and 102.6 MB in the end (delta: -47.0 MB). Peak memory consumption was 121.8 MB. Max. memory is 16.1 GB. [2020-11-30 01:27:54,368 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 88.1 MB. Free memory was 46.5 MB in the beginning and 46.5 MB in the end (delta: 34.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:27:54,368 INFO L168 Benchmark]: CACSL2BoogieTranslator took 642.68 ms. Allocated memory was 88.1 MB in the beginning and 119.5 MB in the end (delta: 31.5 MB). Free memory was 55.4 MB in the beginning and 85.4 MB in the end (delta: -30.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 01:27:54,368 INFO L168 Benchmark]: Boogie Preprocessor took 116.16 ms. Allocated memory is still 119.5 MB. Free memory was 85.4 MB in the beginning and 82.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:27:54,369 INFO L168 Benchmark]: RCFGBuilder took 1144.68 ms. Allocated memory is still 119.5 MB. Free memory was 82.6 MB in the beginning and 90.4 MB in the end (delta: -7.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 16.1 GB. [2020-11-30 01:27:54,369 INFO L168 Benchmark]: TraceAbstraction took 56230.37 ms. Allocated memory was 119.5 MB in the beginning and 255.9 MB in the end (delta: 136.3 MB). Free memory was 89.5 MB in the beginning and 102.6 MB in the end (delta: -13.1 MB). Peak memory consumption was 123.0 MB. Max. memory is 16.1 GB. [2020-11-30 01:27:54,371 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.55 ms. Allocated memory is still 88.1 MB. Free memory was 46.5 MB in the beginning and 46.5 MB in the end (delta: 34.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 642.68 ms. Allocated memory was 88.1 MB in the beginning and 119.5 MB in the end (delta: 31.5 MB). Free memory was 55.4 MB in the beginning and 85.4 MB in the end (delta: -30.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 116.16 ms. Allocated memory is still 119.5 MB. Free memory was 85.4 MB in the beginning and 82.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1144.68 ms. Allocated memory is still 119.5 MB. Free memory was 82.6 MB in the beginning and 90.4 MB in the end (delta: -7.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 56230.37 ms. Allocated memory was 119.5 MB in the beginning and 255.9 MB in the end (delta: 136.3 MB). Free memory was 89.5 MB in the beginning and 102.6 MB in the end (delta: -13.1 MB). Peak memory consumption was 123.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:219) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-a4ecdab [2020-11-30 01:27:56,834 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:27:56,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:27:56,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:27:56,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:27:56,897 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:27:56,900 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:27:56,905 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:27:56,908 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:27:56,914 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:27:56,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:27:56,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:27:56,924 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:27:56,927 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:27:56,929 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:27:56,931 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:27:56,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:27:56,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:27:56,939 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:27:56,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:27:56,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:27:56,956 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:27:56,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:27:56,960 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:27:56,967 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:27:56,970 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:27:56,971 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:27:56,972 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:27:56,973 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:27:56,975 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:27:56,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:27:56,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:27:56,978 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:27:56,979 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:27:56,980 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:27:56,981 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:27:56,982 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:27:56,982 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:27:56,982 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:27:56,984 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:27:56,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:27:56,986 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2020-11-30 01:27:57,045 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:27:57,045 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:27:57,048 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:27:57,048 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:27:57,049 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 01:27:57,049 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:27:57,049 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:27:57,049 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 01:27:57,050 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:27:57,050 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:27:57,051 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:27:57,051 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-30 01:27:57,051 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-30 01:27:57,052 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-11-30 01:27:57,052 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:27:57,052 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 01:27:57,052 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-30 01:27:57,053 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-30 01:27:57,053 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:27:57,053 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:27:57,053 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:27:57,053 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:27:57,054 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:27:57,054 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:27:57,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:27:57,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:27:57,055 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:27:57,055 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-11-30 01:27:57,055 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-30 01:27:57,055 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:27:57,056 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 01:27:57,056 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_69410ff6-bc57-45e8-82b6-8e7f79531692/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 -> 550de44c598358d86c5215062b141ca9f9605e9c [2020-11-30 01:27:57,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:27:57,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:27:57,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:27:57,498 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:27:57,500 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:27:57,501 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-circular-1.i [2020-11-30 01:27:57,581 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/data/0eaffe19a/5829f03eea584740b7216211c28b15c3/FLAG2534715ee [2020-11-30 01:27:58,159 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:27:58,159 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/sv-benchmarks/c/forester-heap/sll-circular-1.i [2020-11-30 01:27:58,170 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/data/0eaffe19a/5829f03eea584740b7216211c28b15c3/FLAG2534715ee [2020-11-30 01:27:58,461 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/data/0eaffe19a/5829f03eea584740b7216211c28b15c3 [2020-11-30 01:27:58,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:27:58,465 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-30 01:27:58,468 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:27:58,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:27:58,471 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:27:58,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:27:58" (1/1) ... [2020-11-30 01:27:58,483 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5728246b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:58, skipping insertion in model container [2020-11-30 01:27:58,483 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:27:58" (1/1) ... [2020-11-30 01:27:58,490 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:27:58,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:27:58,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:27:58,872 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:27:58,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:27:58,984 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:27:58,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:58 WrapperNode [2020-11-30 01:27:58,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:27:58,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:27:58,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:27:58,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:27:58,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:58" (1/1) ... [2020-11-30 01:27:58,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:58" (1/1) ... [2020-11-30 01:27:59,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:58" (1/1) ... [2020-11-30 01:27:59,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:58" (1/1) ... [2020-11-30 01:27:59,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:58" (1/1) ... [2020-11-30 01:27:59,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:58" (1/1) ... [2020-11-30 01:27:59,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:58" (1/1) ... [2020-11-30 01:27:59,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:27:59,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:27:59,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:27:59,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:27:59,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/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 [2020-11-30 01:27:59,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-30 01:27:59,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:27:59,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2020-11-30 01:27:59,124 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-30 01:27:59,124 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-30 01:27:59,124 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-11-30 01:27:59,124 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-11-30 01:27:59,124 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-11-30 01:27:59,124 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-11-30 01:27:59,125 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-11-30 01:27:59,125 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-11-30 01:27:59,125 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-11-30 01:27:59,125 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-11-30 01:27:59,125 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-11-30 01:27:59,125 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-11-30 01:27:59,125 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-11-30 01:27:59,126 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-11-30 01:27:59,126 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-11-30 01:27:59,126 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-11-30 01:27:59,126 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-11-30 01:27:59,126 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-11-30 01:27:59,126 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-11-30 01:27:59,126 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-11-30 01:27:59,126 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-11-30 01:27:59,127 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-11-30 01:27:59,127 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-11-30 01:27:59,127 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-11-30 01:27:59,127 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-11-30 01:27:59,127 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-11-30 01:27:59,127 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-11-30 01:27:59,127 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-11-30 01:27:59,127 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-11-30 01:27:59,128 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-11-30 01:27:59,128 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-11-30 01:27:59,128 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-11-30 01:27:59,128 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-11-30 01:27:59,128 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-11-30 01:27:59,128 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-11-30 01:27:59,128 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-11-30 01:27:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-11-30 01:27:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-11-30 01:27:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-11-30 01:27:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-11-30 01:27:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-11-30 01:27:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-11-30 01:27:59,129 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-11-30 01:27:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-11-30 01:27:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-11-30 01:27:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-11-30 01:27:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-11-30 01:27:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-11-30 01:27:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-11-30 01:27:59,130 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-11-30 01:27:59,131 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-11-30 01:27:59,131 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-11-30 01:27:59,131 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-30 01:27:59,131 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-30 01:27:59,131 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-11-30 01:27:59,131 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-30 01:27:59,131 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-11-30 01:27:59,132 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-11-30 01:27:59,132 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-11-30 01:27:59,132 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-11-30 01:27:59,132 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-11-30 01:27:59,132 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-30 01:27:59,132 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-11-30 01:27:59,132 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-11-30 01:27:59,133 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-11-30 01:27:59,133 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-11-30 01:27:59,133 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-11-30 01:27:59,133 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-11-30 01:27:59,133 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-11-30 01:27:59,133 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-11-30 01:27:59,133 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-11-30 01:27:59,134 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-11-30 01:27:59,134 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-11-30 01:27:59,134 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-11-30 01:27:59,134 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-11-30 01:27:59,134 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-11-30 01:27:59,134 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-11-30 01:27:59,134 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-11-30 01:27:59,134 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-11-30 01:27:59,135 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-11-30 01:27:59,135 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-11-30 01:27:59,135 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-11-30 01:27:59,135 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-11-30 01:27:59,135 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-11-30 01:27:59,135 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-11-30 01:27:59,135 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-11-30 01:27:59,135 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-11-30 01:27:59,136 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-11-30 01:27:59,136 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-11-30 01:27:59,136 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-11-30 01:27:59,136 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-11-30 01:27:59,136 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-11-30 01:27:59,136 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-11-30 01:27:59,136 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-11-30 01:27:59,136 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-11-30 01:27:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-11-30 01:27:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-11-30 01:27:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-11-30 01:27:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-11-30 01:27:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-11-30 01:27:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-11-30 01:27:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-11-30 01:27:59,138 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-11-30 01:27:59,138 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-11-30 01:27:59,138 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-11-30 01:27:59,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-30 01:27:59,138 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-30 01:27:59,138 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-30 01:27:59,138 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-30 01:27:59,138 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-30 01:27:59,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:27:59,139 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-30 01:27:59,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-30 01:27:59,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-30 01:27:59,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-11-30 01:27:59,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-30 01:27:59,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-11-30 01:27:59,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 01:27:59,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-30 01:27:59,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-11-30 01:27:59,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:27:59,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2020-11-30 01:27:59,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2020-11-30 01:27:59,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2020-11-30 01:28:00,150 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:28:00,150 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-11-30 01:28:00,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:28:00 BoogieIcfgContainer [2020-11-30 01:28:00,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:28:00,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:28:00,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:28:00,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:28:00,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:27:58" (1/3) ... [2020-11-30 01:28:00,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535f73bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:28:00, skipping insertion in model container [2020-11-30 01:28:00,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:27:58" (2/3) ... [2020-11-30 01:28:00,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535f73bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:28:00, skipping insertion in model container [2020-11-30 01:28:00,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:28:00" (3/3) ... [2020-11-30 01:28:00,163 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2020-11-30 01:28:00,174 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:28:00,187 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 44 error locations. [2020-11-30 01:28:00,199 INFO L253 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2020-11-30 01:28:00,227 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:28:00,228 INFO L378 AbstractCegarLoop]: Hoare is false [2020-11-30 01:28:00,228 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:28:00,228 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:28:00,228 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:28:00,228 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:28:00,228 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:28:00,229 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:28:00,248 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2020-11-30 01:28:00,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-30 01:28:00,256 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:28:00,256 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:28:00,257 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:28:00,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:28:00,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1521923274, now seen corresponding path program 1 times [2020-11-30 01:28:00,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:28:00,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225178231] [2020-11-30 01:28:00,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-11-30 01:28:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:28:00,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 01:28:00,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:28:00,562 INFO L384 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 [2020-11-30 01:28:00,563 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:00,570 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:00,571 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:00,571 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 01:28:00,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:00,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:28:00,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:00,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225178231] [2020-11-30 01:28:00,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:28:00,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-11-30 01:28:00,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528465141] [2020-11-30 01:28:00,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:28:00,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:28:00,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:28:00,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:28:00,631 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 3 states. [2020-11-30 01:28:00,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:28:00,923 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2020-11-30 01:28:00,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:28:00,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-30 01:28:00,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:28:00,942 INFO L225 Difference]: With dead ends: 110 [2020-11-30 01:28:00,942 INFO L226 Difference]: Without dead ends: 107 [2020-11-30 01:28:00,943 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:28:00,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-11-30 01:28:00,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 97. [2020-11-30 01:28:00,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-11-30 01:28:00,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2020-11-30 01:28:00,993 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 7 [2020-11-30 01:28:00,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:28:00,994 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2020-11-30 01:28:00,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:28:00,994 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2020-11-30 01:28:00,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-30 01:28:00,995 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:28:00,995 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:28:01,203 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-30 01:28:01,204 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:28:01,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:28:01,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1521923275, now seen corresponding path program 1 times [2020-11-30 01:28:01,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:28:01,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210953835] [2020-11-30 01:28:01,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-11-30 01:28:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:28:01,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 01:28:01,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:28:01,419 INFO L384 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 [2020-11-30 01:28:01,419 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:01,426 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:01,427 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:01,427 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 01:28:01,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:01,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:28:01,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:01,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210953835] [2020-11-30 01:28:01,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:28:01,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2020-11-30 01:28:01,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049183532] [2020-11-30 01:28:01,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:28:01,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:28:01,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:28:01,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:28:01,510 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 4 states. [2020-11-30 01:28:01,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:28:01,810 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2020-11-30 01:28:01,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:28:01,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-11-30 01:28:01,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:28:01,813 INFO L225 Difference]: With dead ends: 105 [2020-11-30 01:28:01,813 INFO L226 Difference]: Without dead ends: 105 [2020-11-30 01:28:01,814 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:28:01,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-11-30 01:28:01,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2020-11-30 01:28:01,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-11-30 01:28:01,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2020-11-30 01:28:01,835 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 7 [2020-11-30 01:28:01,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:28:01,836 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2020-11-30 01:28:01,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:28:01,837 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2020-11-30 01:28:01,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-30 01:28:01,838 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:28:01,838 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:28:02,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-30 01:28:02,051 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:28:02,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:28:02,052 INFO L82 PathProgramCache]: Analyzing trace with hash 56530510, now seen corresponding path program 1 times [2020-11-30 01:28:02,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:28:02,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105963538] [2020-11-30 01:28:02,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-11-30 01:28:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:28:02,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 01:28:02,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:28:02,253 INFO L384 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 [2020-11-30 01:28:02,253 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:02,256 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:02,256 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:02,257 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 01:28:02,305 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:02,305 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2020-11-30 01:28:02,306 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:02,330 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2020-11-30 01:28:02,331 INFO L545 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. [2020-11-30 01:28:02,331 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2020-11-30 01:28:02,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:02,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:28:02,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:02,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105963538] [2020-11-30 01:28:02,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:28:02,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-11-30 01:28:02,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702179074] [2020-11-30 01:28:02,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:28:02,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:28:02,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:28:02,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:28:02,386 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 4 states. [2020-11-30 01:28:02,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:28:02,756 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2020-11-30 01:28:02,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:28:02,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-30 01:28:02,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:28:02,758 INFO L225 Difference]: With dead ends: 91 [2020-11-30 01:28:02,758 INFO L226 Difference]: Without dead ends: 91 [2020-11-30 01:28:02,759 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:28:02,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-11-30 01:28:02,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2020-11-30 01:28:02,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-11-30 01:28:02,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2020-11-30 01:28:02,766 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 11 [2020-11-30 01:28:02,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:28:02,766 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2020-11-30 01:28:02,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:28:02,766 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2020-11-30 01:28:02,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-30 01:28:02,767 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:28:02,767 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:28:02,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-30 01:28:02,985 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:28:02,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:28:02,986 INFO L82 PathProgramCache]: Analyzing trace with hash 56530511, now seen corresponding path program 1 times [2020-11-30 01:28:02,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:28:02,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1179193271] [2020-11-30 01:28:02,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-11-30 01:28:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:28:03,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 01:28:03,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:28:03,181 INFO L384 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 [2020-11-30 01:28:03,182 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:03,189 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:03,189 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:03,190 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 01:28:03,246 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:03,246 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2020-11-30 01:28:03,247 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:03,279 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2020-11-30 01:28:03,281 INFO L545 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. [2020-11-30 01:28:03,281 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2020-11-30 01:28:03,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:03,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:28:03,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:03,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1179193271] [2020-11-30 01:28:03,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:28:03,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 6 [2020-11-30 01:28:03,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540570444] [2020-11-30 01:28:03,582 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 01:28:03,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:28:03,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 01:28:03,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-30 01:28:03,583 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 7 states. [2020-11-30 01:28:04,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:28:04,429 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2020-11-30 01:28:04,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:28:04,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-11-30 01:28:04,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:28:04,433 INFO L225 Difference]: With dead ends: 97 [2020-11-30 01:28:04,433 INFO L226 Difference]: Without dead ends: 97 [2020-11-30 01:28:04,433 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-11-30 01:28:04,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-11-30 01:28:04,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 82. [2020-11-30 01:28:04,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-11-30 01:28:04,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2020-11-30 01:28:04,448 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 11 [2020-11-30 01:28:04,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:28:04,448 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2020-11-30 01:28:04,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 01:28:04,448 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2020-11-30 01:28:04,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 01:28:04,449 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:28:04,449 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:28:04,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-11-30 01:28:04,670 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:28:04,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:28:04,670 INFO L82 PathProgramCache]: Analyzing trace with hash 473266314, now seen corresponding path program 1 times [2020-11-30 01:28:04,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:28:04,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090696917] [2020-11-30 01:28:04,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-11-30 01:28:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:28:04,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 01:28:04,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:28:04,844 INFO L384 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 [2020-11-30 01:28:04,844 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:04,848 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:04,848 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:04,862 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 01:28:04,877 INFO L384 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 [2020-11-30 01:28:04,878 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:04,888 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:04,889 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:04,889 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2020-11-30 01:28:04,902 INFO L384 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 17 treesize of output 9 [2020-11-30 01:28:04,903 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:04,905 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:04,905 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:04,906 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2020-11-30 01:28:04,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:04,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:28:04,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:04,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090696917] [2020-11-30 01:28:04,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:28:04,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2020-11-30 01:28:04,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515910842] [2020-11-30 01:28:04,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:28:04,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:28:04,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:28:04,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:28:04,937 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 6 states. [2020-11-30 01:28:05,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:28:05,636 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2020-11-30 01:28:05,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:28:05,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-11-30 01:28:05,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:28:05,638 INFO L225 Difference]: With dead ends: 128 [2020-11-30 01:28:05,638 INFO L226 Difference]: Without dead ends: 128 [2020-11-30 01:28:05,638 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:28:05,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-11-30 01:28:05,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 81. [2020-11-30 01:28:05,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-11-30 01:28:05,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2020-11-30 01:28:05,645 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 14 [2020-11-30 01:28:05,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:28:05,645 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2020-11-30 01:28:05,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:28:05,645 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2020-11-30 01:28:05,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 01:28:05,646 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:28:05,646 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:28:05,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-11-30 01:28:05,847 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:28:05,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:28:05,847 INFO L82 PathProgramCache]: Analyzing trace with hash 473266315, now seen corresponding path program 1 times [2020-11-30 01:28:05,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:28:05,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894057128] [2020-11-30 01:28:05,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-11-30 01:28:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:28:06,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 01:28:06,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:28:06,047 INFO L384 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 [2020-11-30 01:28:06,047 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:06,054 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:06,054 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:06,054 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 01:28:06,082 INFO L384 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 [2020-11-30 01:28:06,082 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:06,101 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:06,108 INFO L384 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 [2020-11-30 01:28:06,108 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:06,121 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:06,122 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:06,122 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2020-11-30 01:28:06,156 INFO L384 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 [2020-11-30 01:28:06,157 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:06,176 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:06,188 INFO L384 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 17 treesize of output 9 [2020-11-30 01:28:06,189 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:06,199 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:06,199 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:06,199 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2020-11-30 01:28:06,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:06,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:28:06,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:06,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894057128] [2020-11-30 01:28:06,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:28:06,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2020-11-30 01:28:06,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597177551] [2020-11-30 01:28:06,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 01:28:06,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:28:06,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 01:28:06,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-30 01:28:06,506 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 10 states. [2020-11-30 01:28:08,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:28:08,281 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2020-11-30 01:28:08,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 01:28:08,282 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2020-11-30 01:28:08,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:28:08,283 INFO L225 Difference]: With dead ends: 128 [2020-11-30 01:28:08,283 INFO L226 Difference]: Without dead ends: 128 [2020-11-30 01:28:08,284 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-11-30 01:28:08,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-11-30 01:28:08,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 74. [2020-11-30 01:28:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-11-30 01:28:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2020-11-30 01:28:08,290 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 14 [2020-11-30 01:28:08,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:28:08,290 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2020-11-30 01:28:08,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 01:28:08,290 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2020-11-30 01:28:08,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-30 01:28:08,291 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:28:08,291 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:28:08,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-11-30 01:28:08,502 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:28:08,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:28:08,502 INFO L82 PathProgramCache]: Analyzing trace with hash -964435240, now seen corresponding path program 1 times [2020-11-30 01:28:08,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:28:08,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069672102] [2020-11-30 01:28:08,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-11-30 01:28:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:28:08,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 01:28:08,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:28:08,699 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-11-30 01:28:08,699 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:08,709 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:08,709 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:08,710 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-11-30 01:28:08,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:28:08,732 INFO L384 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 27 treesize of output 11 [2020-11-30 01:28:08,733 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:08,741 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:08,742 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:08,742 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2020-11-30 01:28:08,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:28:08,786 INFO L384 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 27 treesize of output 11 [2020-11-30 01:28:08,787 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:08,799 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:08,799 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:08,800 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2020-11-30 01:28:08,812 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-11-30 01:28:08,812 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:08,818 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:08,819 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:08,819 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:4 [2020-11-30 01:28:08,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:08,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:28:08,872 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:08,879 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:08,880 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:08,880 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2020-11-30 01:28:08,938 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:08,942 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:08,943 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:08,943 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:13 [2020-11-30 01:28:08,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:08,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069672102] [2020-11-30 01:28:08,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:28:08,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2020-11-30 01:28:08,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234174549] [2020-11-30 01:28:08,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 01:28:08,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:28:08,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 01:28:08,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-30 01:28:08,980 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 10 states. [2020-11-30 01:28:09,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:28:09,682 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2020-11-30 01:28:09,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 01:28:09,683 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2020-11-30 01:28:09,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:28:09,684 INFO L225 Difference]: With dead ends: 155 [2020-11-30 01:28:09,684 INFO L226 Difference]: Without dead ends: 155 [2020-11-30 01:28:09,684 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2020-11-30 01:28:09,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-11-30 01:28:09,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 79. [2020-11-30 01:28:09,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-30 01:28:09,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2020-11-30 01:28:09,690 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 17 [2020-11-30 01:28:09,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:28:09,690 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2020-11-30 01:28:09,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 01:28:09,690 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2020-11-30 01:28:09,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-30 01:28:09,691 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:28:09,691 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:28:09,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-11-30 01:28:09,899 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:28:09,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:28:09,900 INFO L82 PathProgramCache]: Analyzing trace with hash -723846791, now seen corresponding path program 1 times [2020-11-30 01:28:09,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:28:09,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42601952] [2020-11-30 01:28:09,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-11-30 01:28:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:28:10,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 01:28:10,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:28:10,058 INFO L384 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 [2020-11-30 01:28:10,058 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:10,063 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:10,063 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:10,063 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 01:28:10,087 INFO L384 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 [2020-11-30 01:28:10,087 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:10,097 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:10,098 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:10,098 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2020-11-30 01:28:10,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:28:10,125 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 01:28:10,126 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:10,136 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:10,136 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:10,136 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:18 [2020-11-30 01:28:10,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:28:10,171 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 01:28:10,172 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:10,182 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:10,182 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:10,183 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:18 [2020-11-30 01:28:10,194 INFO L384 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 [2020-11-30 01:28:10,195 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:10,200 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:10,200 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:10,201 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2020-11-30 01:28:10,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:10,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:28:10,232 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:10,244 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:10,245 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:10,245 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2020-11-30 01:28:12,400 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:12,404 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:12,405 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:12,405 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:14 [2020-11-30 01:28:12,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:12,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42601952] [2020-11-30 01:28:12,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:28:12,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2020-11-30 01:28:12,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749490244] [2020-11-30 01:28:12,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 01:28:12,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:28:12,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 01:28:12,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=62, Unknown=1, NotChecked=0, Total=90 [2020-11-30 01:28:12,492 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 10 states. [2020-11-30 01:28:15,065 WARN L193 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 28 [2020-11-30 01:28:15,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:28:15,500 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2020-11-30 01:28:15,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 01:28:15,501 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-30 01:28:15,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:28:15,502 INFO L225 Difference]: With dead ends: 126 [2020-11-30 01:28:15,502 INFO L226 Difference]: Without dead ends: 126 [2020-11-30 01:28:15,503 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=85, Invalid=154, Unknown=1, NotChecked=0, Total=240 [2020-11-30 01:28:15,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-11-30 01:28:15,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 81. [2020-11-30 01:28:15,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-11-30 01:28:15,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2020-11-30 01:28:15,508 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 16 [2020-11-30 01:28:15,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:28:15,508 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2020-11-30 01:28:15,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 01:28:15,509 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2020-11-30 01:28:15,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-30 01:28:15,510 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:28:15,510 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:28:15,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-11-30 01:28:15,723 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:28:15,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:28:15,724 INFO L82 PathProgramCache]: Analyzing trace with hash -723846790, now seen corresponding path program 1 times [2020-11-30 01:28:15,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:28:15,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230008808] [2020-11-30 01:28:15,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-11-30 01:28:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:28:15,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-30 01:28:15,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:28:15,945 INFO L384 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 [2020-11-30 01:28:15,945 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:15,954 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:15,955 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:15,955 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 01:28:15,980 INFO L384 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 [2020-11-30 01:28:15,980 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:15,997 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:16,002 INFO L384 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 [2020-11-30 01:28:16,003 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:16,016 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:16,016 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:16,017 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2020-11-30 01:28:16,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:28:16,058 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 01:28:16,058 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:16,083 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:16,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:28:16,090 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 01:28:16,091 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:16,103 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:16,104 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:16,104 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2020-11-30 01:28:16,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:28:16,149 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 01:28:16,150 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:16,175 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:16,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:28:16,184 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 01:28:16,185 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:16,198 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:16,199 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:16,199 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2020-11-30 01:28:16,210 INFO L384 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 [2020-11-30 01:28:16,210 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:16,225 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:16,230 INFO L384 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 [2020-11-30 01:28:16,230 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:16,240 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:16,241 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:16,241 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:9 [2020-11-30 01:28:16,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:16,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:28:16,462 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:28:16,478 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:16,487 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:16,597 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-11-30 01:28:16,598 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:16,604 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:16,609 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:16,662 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:16,663 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-11-30 01:28:16,663 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:71 [2020-11-30 01:28:17,040 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:28:17,056 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:17,077 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:17,118 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:17,123 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:17,133 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:17,181 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:17,182 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-11-30 01:28:17,183 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:51 [2020-11-30 01:28:17,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:17,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230008808] [2020-11-30 01:28:17,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:28:17,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2020-11-30 01:28:17,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95192342] [2020-11-30 01:28:17,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-30 01:28:17,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:28:17,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 01:28:17,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-11-30 01:28:17,342 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 12 states. [2020-11-30 01:28:17,850 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 24 [2020-11-30 01:28:20,507 WARN L193 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 46 DAG size of output: 31 [2020-11-30 01:28:22,941 WARN L193 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2020-11-30 01:28:23,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:28:23,592 INFO L93 Difference]: Finished difference Result 150 states and 165 transitions. [2020-11-30 01:28:23,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 01:28:23,593 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-30 01:28:23,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:28:23,595 INFO L225 Difference]: With dead ends: 150 [2020-11-30 01:28:23,595 INFO L226 Difference]: Without dead ends: 150 [2020-11-30 01:28:23,595 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-11-30 01:28:23,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-11-30 01:28:23,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 82. [2020-11-30 01:28:23,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-11-30 01:28:23,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2020-11-30 01:28:23,600 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 16 [2020-11-30 01:28:23,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:28:23,600 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2020-11-30 01:28:23,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-30 01:28:23,600 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2020-11-30 01:28:23,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-30 01:28:23,601 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:28:23,601 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:28:23,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-11-30 01:28:23,813 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:28:23,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:28:23,813 INFO L82 PathProgramCache]: Analyzing trace with hash 533964504, now seen corresponding path program 1 times [2020-11-30 01:28:23,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:28:23,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050529365] [2020-11-30 01:28:23,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-11-30 01:28:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:28:23,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 01:28:23,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:28:23,997 INFO L384 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 [2020-11-30 01:28:23,997 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:24,008 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:24,009 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:24,009 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2020-11-30 01:28:24,027 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2020-11-30 01:28:24,027 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:24,031 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:24,032 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:24,032 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2020-11-30 01:28:24,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:24,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:28:24,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:24,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050529365] [2020-11-30 01:28:24,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:28:24,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2020-11-30 01:28:24,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927061273] [2020-11-30 01:28:24,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:28:24,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:28:24,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:28:24,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:28:24,059 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 6 states. [2020-11-30 01:28:24,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:28:24,383 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2020-11-30 01:28:24,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 01:28:24,384 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-11-30 01:28:24,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:28:24,385 INFO L225 Difference]: With dead ends: 127 [2020-11-30 01:28:24,385 INFO L226 Difference]: Without dead ends: 127 [2020-11-30 01:28:24,386 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-30 01:28:24,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-11-30 01:28:24,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 81. [2020-11-30 01:28:24,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-11-30 01:28:24,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2020-11-30 01:28:24,391 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 20 [2020-11-30 01:28:24,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:28:24,391 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2020-11-30 01:28:24,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:28:24,391 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2020-11-30 01:28:24,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-30 01:28:24,392 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:28:24,392 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:28:24,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-11-30 01:28:24,603 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2020-11-30 01:28:24,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:28:24,604 INFO L82 PathProgramCache]: Analyzing trace with hash 911147924, now seen corresponding path program 1 times [2020-11-30 01:28:24,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:28:24,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954977873] [2020-11-30 01:28:24,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-11-30 01:28:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:28:24,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-30 01:28:24,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:28:24,796 INFO L384 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 [2020-11-30 01:28:24,797 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:24,803 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:24,806 INFO L384 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 [2020-11-30 01:28:24,806 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:24,817 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:24,817 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:24,817 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-11-30 01:28:24,843 INFO L384 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 [2020-11-30 01:28:24,843 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:24,852 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:24,852 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:24,852 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2020-11-30 01:28:24,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:28:24,877 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 01:28:24,878 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:24,900 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:24,900 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:24,900 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2020-11-30 01:28:24,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:28:24,957 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-11-30 01:28:24,958 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:24,971 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:24,971 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:24,971 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2020-11-30 01:28:25,098 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 01:28:25,099 INFO L384 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 14 [2020-11-30 01:28:25,100 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:25,130 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:25,139 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 01:28:25,148 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:25,149 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2020-11-30 01:28:25,149 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:25,169 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:25,172 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:28:25,172 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:7 [2020-11-30 01:28:25,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:28:25,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:28:25,453 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:25,511 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:25,512 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 01:28:25,513 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:86 [2020-11-30 01:28:34,582 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:28:34,627 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:28:34,629 INFO L545 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. [2020-11-30 01:28:34,629 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:91, output treesize:71 [2020-11-30 01:28:39,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954977873] [2020-11-30 01:28:39,770 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2020-11-30 01:28:39,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1159455719] [2020-11-30 01:28:39,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 01:28:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:28:40,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 20 conjunts are in the unsatisfiable core [2020-11-30 01:28:40,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:28:40,042 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@74a4d4f1 [2020-11-30 01:28:40,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361674612] [2020-11-30 01:28:40,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69410ff6-bc57-45e8-82b6-8e7f79531692/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:28:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:28:40,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 01:28:40,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:28:40,223 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@74a4d4f1 [2020-11-30 01:28:40,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:28:40,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-11-30 01:28:40,224 ERROR L205 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2020-11-30 01:28:40,224 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 01:28:40,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 cvc4 --incremental --print-success --lang smt --rewrite-divk,12 mathsat -unsat_core_generation=3 [2020-11-30 01:28:40,860 WARN L238 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-11-30 01:28:40,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 01:28:40 BoogieIcfgContainer [2020-11-30 01:28:40,861 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 01:28:40,861 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:28:40,861 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:28:40,862 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:28:40,862 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:28:00" (3/4) ... [2020-11-30 01:28:40,866 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-30 01:28:40,866 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:28:40,867 INFO L168 Benchmark]: Toolchain (without parser) took 42401.99 ms. Allocated memory was 71.3 MB in the beginning and 134.2 MB in the end (delta: 62.9 MB). Free memory was 52.6 MB in the beginning and 52.7 MB in the end (delta: -161.9 kB). Peak memory consumption was 63.6 MB. Max. memory is 16.1 GB. [2020-11-30 01:28:40,867 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 71.3 MB. Free memory is still 53.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:28:40,868 INFO L168 Benchmark]: CACSL2BoogieTranslator took 517.65 ms. Allocated memory is still 71.3 MB. Free memory was 52.2 MB in the beginning and 42.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-30 01:28:40,868 INFO L168 Benchmark]: Boogie Preprocessor took 75.13 ms. Allocated memory is still 71.3 MB. Free memory was 42.5 MB in the beginning and 39.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 01:28:40,869 INFO L168 Benchmark]: RCFGBuilder took 1090.58 ms. Allocated memory was 71.3 MB in the beginning and 92.3 MB in the end (delta: 21.0 MB). Free memory was 39.2 MB in the beginning and 50.2 MB in the end (delta: -11.0 MB). Peak memory consumption was 17.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:28:40,869 INFO L168 Benchmark]: TraceAbstraction took 40704.45 ms. Allocated memory was 92.3 MB in the beginning and 134.2 MB in the end (delta: 41.9 MB). Free memory was 49.7 MB in the beginning and 53.8 MB in the end (delta: -4.1 MB). Peak memory consumption was 36.3 MB. Max. memory is 16.1 GB. [2020-11-30 01:28:40,870 INFO L168 Benchmark]: Witness Printer took 4.82 ms. Allocated memory is still 134.2 MB. Free memory was 53.8 MB in the beginning and 52.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:28:40,872 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 71.3 MB. Free memory is still 53.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 517.65 ms. Allocated memory is still 71.3 MB. Free memory was 52.2 MB in the beginning and 42.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 75.13 ms. Allocated memory is still 71.3 MB. Free memory was 42.5 MB in the beginning and 39.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1090.58 ms. Allocated memory was 71.3 MB in the beginning and 92.3 MB in the end (delta: 21.0 MB). Free memory was 39.2 MB in the beginning and 50.2 MB in the end (delta: -11.0 MB). Peak memory consumption was 17.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 40704.45 ms. Allocated memory was 92.3 MB in the beginning and 134.2 MB in the end (delta: 41.9 MB). Free memory was 49.7 MB in the beginning and 53.8 MB in the end (delta: -4.1 MB). Peak memory consumption was 36.3 MB. Max. memory is 16.1 GB. * Witness Printer took 4.82 ms. Allocated memory is still 134.2 MB. Free memory was 53.8 MB in the beginning and 52.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L996] SLL* head = malloc(sizeof(SLL)); [L997] head->next = head [L998] head->data = 0 [L1000] SLL* x = head; [L1001] int state = 1; [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1025] x->data = state [L1027] EXPR head->next [L1027] x = head->next [L1028] COND FALSE !(!(((void*)0) != x)) [L1030] EXPR x->data [L1030] COND TRUE x->data != 0 [L1032] EXPR x->next [L1032] x->next->data - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 115 locations, 44 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 40.6s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 697 SDtfs, 1705 SDslu, 1590 SDs, 0 SdLazy, 1823 SolverSat, 143 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 293 GetRequests, 194 SyntacticMatches, 10 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 11.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 382 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 246 ConstructedInterpolants, 10 QuantifiedInterpolants, 20951 SizeOfPredicates, 60 NumberOfNonLiveVariables, 885 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...