./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/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 5a3a274b64e7ba6d81948d0b8c45cbd715251888 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/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 5a3a274b64e7ba6d81948d0b8c45cbd715251888 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: nested self-update not yet implemented: (store v_prenex_104 (bvadd |main_#t~malloc2.offset| (_ bv4 32)) v_DerPreprocessor_106) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 14:14:06,257 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:14:06,258 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:14:06,264 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:14:06,265 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:14:06,265 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:14:06,266 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:14:06,267 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:14:06,268 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:14:06,269 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:14:06,269 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:14:06,270 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:14:06,271 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:14:06,271 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:14:06,272 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:14:06,273 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:14:06,273 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:14:06,275 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:14:06,276 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:14:06,277 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:14:06,278 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:14:06,279 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:14:06,280 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:14:06,280 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:14:06,280 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:14:06,281 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:14:06,281 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:14:06,282 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:14:06,282 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:14:06,283 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:14:06,283 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:14:06,284 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:14:06,284 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:14:06,284 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:14:06,285 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:14:06,285 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:14:06,285 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-23 14:14:06,295 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:14:06,295 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:14:06,295 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:14:06,295 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 14:14:06,296 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:14:06,296 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:14:06,296 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 14:14:06,296 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:14:06,296 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:14:06,296 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 14:14:06,297 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:14:06,297 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:14:06,297 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:14:06,297 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 14:14:06,297 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 14:14:06,297 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 14:14:06,297 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:14:06,297 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:14:06,297 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:14:06,298 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:14:06,299 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:14:06,299 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:14:06,299 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 14:14:06,299 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:14:06,299 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:14:06,299 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:14:06,299 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 14:14:06,299 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:14:06,299 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/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 -> 5a3a274b64e7ba6d81948d0b8c45cbd715251888 [2018-11-23 14:14:06,324 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:14:06,333 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:14:06,335 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:14:06,336 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:14:06,336 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:14:06,336 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-11-23 14:14:06,374 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/data/d2771d021/d8c26de73e3d4fce9e6fa889d41200b4/FLAG6e454d527 [2018-11-23 14:14:06,742 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:14:06,743 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/sv-benchmarks/c/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-11-23 14:14:06,752 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/data/d2771d021/d8c26de73e3d4fce9e6fa889d41200b4/FLAG6e454d527 [2018-11-23 14:14:07,135 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/data/d2771d021/d8c26de73e3d4fce9e6fa889d41200b4 [2018-11-23 14:14:07,137 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:14:07,138 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-23 14:14:07,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:14:07,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:14:07,141 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:14:07,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:14:07" (1/1) ... [2018-11-23 14:14:07,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160bb857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:07, skipping insertion in model container [2018-11-23 14:14:07,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:14:07" (1/1) ... [2018-11-23 14:14:07,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:14:07,177 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:14:07,367 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:14:07,374 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:14:07,446 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:14:07,471 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:14:07,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:07 WrapperNode [2018-11-23 14:14:07,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:14:07,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:14:07,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:14:07,472 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:14:07,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:07" (1/1) ... [2018-11-23 14:14:07,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:07" (1/1) ... [2018-11-23 14:14:07,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:07" (1/1) ... [2018-11-23 14:14:07,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:07" (1/1) ... [2018-11-23 14:14:07,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:07" (1/1) ... [2018-11-23 14:14:07,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:07" (1/1) ... [2018-11-23 14:14:07,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:07" (1/1) ... [2018-11-23 14:14:07,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:14:07,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:14:07,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:14:07,517 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:14:07,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/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 [2018-11-23 14:14:07,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 14:14:07,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:14:07,558 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 14:14:07,559 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-23 14:14:07,559 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-23 14:14:07,559 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-23 14:14:07,559 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-23 14:14:07,559 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-23 14:14:07,559 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-23 14:14:07,559 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-23 14:14:07,559 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-23 14:14:07,559 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-23 14:14:07,559 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-23 14:14:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-23 14:14:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-23 14:14:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-23 14:14:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-23 14:14:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-23 14:14:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-23 14:14:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-23 14:14:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-23 14:14:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-23 14:14:07,561 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-23 14:14:07,561 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-23 14:14:07,561 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-23 14:14:07,561 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-23 14:14:07,561 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-23 14:14:07,561 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-23 14:14:07,561 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-23 14:14:07,561 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-23 14:14:07,561 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-23 14:14:07,561 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-23 14:14:07,561 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-23 14:14:07,562 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-23 14:14:07,562 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-23 14:14:07,562 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-23 14:14:07,562 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-23 14:14:07,562 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-23 14:14:07,562 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-23 14:14:07,562 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-23 14:14:07,562 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-23 14:14:07,562 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-23 14:14:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-23 14:14:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-23 14:14:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-23 14:14:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-23 14:14:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-23 14:14:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-23 14:14:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-23 14:14:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-23 14:14:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-23 14:14:07,563 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-23 14:14:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-23 14:14:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-23 14:14:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-23 14:14:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-23 14:14:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-23 14:14:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-23 14:14:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-23 14:14:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-23 14:14:07,564 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-23 14:14:07,565 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-23 14:14:07,565 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-23 14:14:07,565 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-23 14:14:07,565 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-23 14:14:07,565 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-23 14:14:07,565 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 14:14:07,565 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-23 14:14:07,565 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-23 14:14:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-23 14:14:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-23 14:14:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-23 14:14:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-23 14:14:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-23 14:14:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-23 14:14:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-23 14:14:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-23 14:14:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-23 14:14:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-23 14:14:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-23 14:14:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-23 14:14:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-23 14:14:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-23 14:14:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-23 14:14:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-23 14:14:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-23 14:14:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-23 14:14:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-23 14:14:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-23 14:14:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-23 14:14:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-23 14:14:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-23 14:14:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-23 14:14:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-23 14:14:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-23 14:14:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-23 14:14:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-23 14:14:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-23 14:14:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-23 14:14:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-23 14:14:07,568 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-23 14:14:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-23 14:14:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-23 14:14:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-23 14:14:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-23 14:14:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-23 14:14:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-23 14:14:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-23 14:14:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 14:14:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:14:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 14:14:07,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 14:14:07,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 14:14:07,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 14:14:07,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:14:07,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 14:14:07,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:14:07,991 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:14:07,991 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 14:14:07,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:14:07 BoogieIcfgContainer [2018-11-23 14:14:07,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:14:07,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 14:14:07,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 14:14:07,994 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 14:14:07,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:14:07" (1/3) ... [2018-11-23 14:14:07,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad6e1f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:14:07, skipping insertion in model container [2018-11-23 14:14:07,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:07" (2/3) ... [2018-11-23 14:14:07,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad6e1f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:14:07, skipping insertion in model container [2018-11-23 14:14:07,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:14:07" (3/3) ... [2018-11-23 14:14:07,996 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-11-23 14:14:08,001 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 14:14:08,008 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-11-23 14:14:08,021 INFO L257 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2018-11-23 14:14:08,041 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:14:08,042 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 14:14:08,042 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 14:14:08,042 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 14:14:08,042 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:14:08,043 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:14:08,043 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 14:14:08,043 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:14:08,043 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 14:14:08,055 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2018-11-23 14:14:08,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 14:14:08,061 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:08,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:14:08,062 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr33REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2018-11-23 14:14:08,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:08,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1698639190, now seen corresponding path program 1 times [2018-11-23 14:14:08,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:14:08,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:14:08,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:08,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:08,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:08,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:08,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:14:08,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:14:08,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:14:08,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:14:08,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:14:08,194 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 3 states. [2018-11-23 14:14:08,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:08,337 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2018-11-23 14:14:08,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:14:08,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 14:14:08,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:08,345 INFO L225 Difference]: With dead ends: 125 [2018-11-23 14:14:08,345 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 14:14:08,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:14:08,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 14:14:08,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 92. [2018-11-23 14:14:08,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 14:14:08,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2018-11-23 14:14:08,373 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 7 [2018-11-23 14:14:08,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:08,373 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2018-11-23 14:14:08,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:14:08,373 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2018-11-23 14:14:08,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 14:14:08,374 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:08,374 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:14:08,374 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr33REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2018-11-23 14:14:08,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:08,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1698639191, now seen corresponding path program 1 times [2018-11-23 14:14:08,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:14:08,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:14:08,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:08,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:08,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:08,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:14:08,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:14:08,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:14:08,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:14:08,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:14:08,414 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 3 states. [2018-11-23 14:14:08,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:08,522 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2018-11-23 14:14:08,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:14:08,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 14:14:08,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:08,524 INFO L225 Difference]: With dead ends: 117 [2018-11-23 14:14:08,524 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 14:14:08,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:14:08,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 14:14:08,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 90. [2018-11-23 14:14:08,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 14:14:08,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2018-11-23 14:14:08,528 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 7 [2018-11-23 14:14:08,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:08,529 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2018-11-23 14:14:08,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:14:08,529 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2018-11-23 14:14:08,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 14:14:08,529 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:08,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:14:08,530 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr33REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2018-11-23 14:14:08,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:08,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1704573720, now seen corresponding path program 1 times [2018-11-23 14:14:08,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:14:08,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:14:08,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:08,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:08,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:08,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:08,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:14:08,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:14:08,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:14:08,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:14:08,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:14:08,573 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand 4 states. [2018-11-23 14:14:08,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:08,687 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2018-11-23 14:14:08,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 14:14:08,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 14:14:08,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:08,688 INFO L225 Difference]: With dead ends: 91 [2018-11-23 14:14:08,689 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 14:14:08,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:14:08,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 14:14:08,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2018-11-23 14:14:08,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 14:14:08,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2018-11-23 14:14:08,693 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 12 [2018-11-23 14:14:08,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:08,693 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2018-11-23 14:14:08,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:14:08,694 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2018-11-23 14:14:08,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 14:14:08,694 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:08,694 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:14:08,694 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr33REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2018-11-23 14:14:08,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:08,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1704573721, now seen corresponding path program 1 times [2018-11-23 14:14:08,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:14:08,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:14:08,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:08,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:08,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:08,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:08,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:14:08,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:14:08,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:14:08,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:14:08,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:14:08,738 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand 4 states. [2018-11-23 14:14:08,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:08,849 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2018-11-23 14:14:08,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:14:08,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 14:14:08,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:08,850 INFO L225 Difference]: With dead ends: 111 [2018-11-23 14:14:08,850 INFO L226 Difference]: Without dead ends: 111 [2018-11-23 14:14:08,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:14:08,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-23 14:14:08,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2018-11-23 14:14:08,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 14:14:08,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2018-11-23 14:14:08,854 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 12 [2018-11-23 14:14:08,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:08,855 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2018-11-23 14:14:08,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:14:08,855 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2018-11-23 14:14:08,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 14:14:08,855 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:08,855 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:14:08,856 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr33REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2018-11-23 14:14:08,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:08,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1557345058, now seen corresponding path program 1 times [2018-11-23 14:14:08,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:14:08,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:14:08,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:08,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:08,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:08,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:08,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:14:08,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 14:14:08,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 14:14:08,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 14:14:08,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 14:14:08,904 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 6 states. [2018-11-23 14:14:09,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:09,112 INFO L93 Difference]: Finished difference Result 159 states and 178 transitions. [2018-11-23 14:14:09,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 14:14:09,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 14:14:09,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:09,113 INFO L225 Difference]: With dead ends: 159 [2018-11-23 14:14:09,113 INFO L226 Difference]: Without dead ends: 159 [2018-11-23 14:14:09,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-23 14:14:09,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-23 14:14:09,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 96. [2018-11-23 14:14:09,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 14:14:09,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2018-11-23 14:14:09,120 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 15 [2018-11-23 14:14:09,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:09,120 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2018-11-23 14:14:09,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 14:14:09,120 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2018-11-23 14:14:09,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 14:14:09,121 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:09,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:14:09,121 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr33REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2018-11-23 14:14:09,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:09,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1557345059, now seen corresponding path program 1 times [2018-11-23 14:14:09,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:14:09,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:14:09,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:09,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:09,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:09,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:09,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:14:09,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 14:14:09,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 14:14:09,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 14:14:09,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 14:14:09,181 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 6 states. [2018-11-23 14:14:09,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:09,392 INFO L93 Difference]: Finished difference Result 167 states and 187 transitions. [2018-11-23 14:14:09,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 14:14:09,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 14:14:09,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:09,394 INFO L225 Difference]: With dead ends: 167 [2018-11-23 14:14:09,394 INFO L226 Difference]: Without dead ends: 167 [2018-11-23 14:14:09,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-23 14:14:09,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-23 14:14:09,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 88. [2018-11-23 14:14:09,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 14:14:09,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2018-11-23 14:14:09,400 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 15 [2018-11-23 14:14:09,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:09,400 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2018-11-23 14:14:09,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 14:14:09,400 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2018-11-23 14:14:09,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 14:14:09,401 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:09,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:14:09,401 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr33REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2018-11-23 14:14:09,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:09,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1004200128, now seen corresponding path program 1 times [2018-11-23 14:14:09,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:14:09,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:14:09,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:09,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:09,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:09,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:09,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:14:09,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 14:14:09,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 14:14:09,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 14:14:09,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:14:09,458 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand 5 states. [2018-11-23 14:14:09,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:09,550 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2018-11-23 14:14:09,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 14:14:09,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 14:14:09,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:09,551 INFO L225 Difference]: With dead ends: 99 [2018-11-23 14:14:09,551 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 14:14:09,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 14:14:09,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 14:14:09,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2018-11-23 14:14:09,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-23 14:14:09,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2018-11-23 14:14:09,555 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 19 [2018-11-23 14:14:09,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:09,555 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2018-11-23 14:14:09,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 14:14:09,555 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2018-11-23 14:14:09,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 14:14:09,556 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:09,556 INFO L402 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] [2018-11-23 14:14:09,556 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr33REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2018-11-23 14:14:09,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:09,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1742257143, now seen corresponding path program 1 times [2018-11-23 14:14:09,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:14:09,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:14:09,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:09,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:09,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:09,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:09,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:14:09,627 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:14:09,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:09,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:14:09,719 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 14:14:09,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:09,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:09,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-11-23 14:14:09,747 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:14:09,754 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:09,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:09,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:09,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:09,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-11-23 14:14:09,791 INFO L478 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 13 [2018-11-23 14:14:09,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 [2018-11-23 14:14:09,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:09,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:09,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:14:09,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:11 [2018-11-23 14:14:09,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:09,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:14:09,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-23 14:14:09,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 14:14:09,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 14:14:09,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-23 14:14:09,826 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 11 states. [2018-11-23 14:14:10,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:10,024 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2018-11-23 14:14:10,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 14:14:10,024 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-11-23 14:14:10,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:10,025 INFO L225 Difference]: With dead ends: 132 [2018-11-23 14:14:10,025 INFO L226 Difference]: Without dead ends: 132 [2018-11-23 14:14:10,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-11-23 14:14:10,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-23 14:14:10,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 98. [2018-11-23 14:14:10,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-23 14:14:10,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2018-11-23 14:14:10,028 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 22 [2018-11-23 14:14:10,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:10,028 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2018-11-23 14:14:10,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 14:14:10,028 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2018-11-23 14:14:10,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 14:14:10,029 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:10,029 INFO L402 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] [2018-11-23 14:14:10,029 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr33REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2018-11-23 14:14:10,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:10,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1742257142, now seen corresponding path program 1 times [2018-11-23 14:14:10,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:14:10,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:14:10,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:10,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:10,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:10,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:10,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:14:10,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:14:10,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:10,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:14:10,183 INFO L478 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 [2018-11-23 14:14:10,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:10,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:10,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 14:14:10,217 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-23 14:14:10,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:10,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:10,225 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:19 [2018-11-23 14:14:10,243 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:14:10,245 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:10,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:10,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:10,255 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:14:10,256 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:10,257 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:10,258 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:10,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:10,269 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:31 [2018-11-23 14:14:10,293 INFO L478 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 13 [2018-11-23 14:14:10,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 [2018-11-23 14:14:10,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:10,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:10,303 INFO L478 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 24 treesize of output 18 [2018-11-23 14:14:10,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 18 treesize of output 9 [2018-11-23 14:14:10,305 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:10,308 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:10,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:14:10,312 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:19 [2018-11-23 14:14:10,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:10,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:14:10,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-11-23 14:14:10,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 14:14:10,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 14:14:10,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-11-23 14:14:10,363 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 15 states. [2018-11-23 14:14:10,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:10,847 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2018-11-23 14:14:10,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 14:14:10,847 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-11-23 14:14:10,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:10,849 INFO L225 Difference]: With dead ends: 151 [2018-11-23 14:14:10,849 INFO L226 Difference]: Without dead ends: 151 [2018-11-23 14:14:10,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2018-11-23 14:14:10,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-23 14:14:10,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 97. [2018-11-23 14:14:10,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 14:14:10,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2018-11-23 14:14:10,854 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 22 [2018-11-23 14:14:10,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:10,854 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2018-11-23 14:14:10,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 14:14:10,854 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2018-11-23 14:14:10,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 14:14:10,854 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:10,855 INFO L402 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] [2018-11-23 14:14:10,855 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr33REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2018-11-23 14:14:10,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:10,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1822972564, now seen corresponding path program 1 times [2018-11-23 14:14:10,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:14:10,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:14:10,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:10,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:10,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:10,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:10,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:14:10,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 14:14:10,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 14:14:10,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 14:14:10,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 14:14:10,930 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 8 states. [2018-11-23 14:14:11,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:11,146 INFO L93 Difference]: Finished difference Result 137 states and 153 transitions. [2018-11-23 14:14:11,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 14:14:11,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-23 14:14:11,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:11,148 INFO L225 Difference]: With dead ends: 137 [2018-11-23 14:14:11,148 INFO L226 Difference]: Without dead ends: 137 [2018-11-23 14:14:11,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-11-23 14:14:11,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-23 14:14:11,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 101. [2018-11-23 14:14:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-23 14:14:11,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2018-11-23 14:14:11,151 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 23 [2018-11-23 14:14:11,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:11,152 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2018-11-23 14:14:11,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 14:14:11,152 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2018-11-23 14:14:11,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 14:14:11,152 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:11,153 INFO L402 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] [2018-11-23 14:14:11,153 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr33REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2018-11-23 14:14:11,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:11,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1822972565, now seen corresponding path program 1 times [2018-11-23 14:14:11,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:14:11,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:14:11,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:11,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:11,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:11,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:11,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:14:11,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 14:14:11,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 14:14:11,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 14:14:11,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 14:14:11,267 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand 8 states. [2018-11-23 14:14:11,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:11,537 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2018-11-23 14:14:11,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 14:14:11,537 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-23 14:14:11,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:11,538 INFO L225 Difference]: With dead ends: 155 [2018-11-23 14:14:11,538 INFO L226 Difference]: Without dead ends: 155 [2018-11-23 14:14:11,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-11-23 14:14:11,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-23 14:14:11,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 103. [2018-11-23 14:14:11,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-23 14:14:11,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2018-11-23 14:14:11,543 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 23 [2018-11-23 14:14:11,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:11,543 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2018-11-23 14:14:11,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 14:14:11,543 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2018-11-23 14:14:11,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 14:14:11,544 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:11,544 INFO L402 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] [2018-11-23 14:14:11,544 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr33REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2018-11-23 14:14:11,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:11,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1660465187, now seen corresponding path program 1 times [2018-11-23 14:14:11,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:14:11,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:14:11,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:11,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:11,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:11,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:11,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:14:11,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 14:14:11,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 14:14:11,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 14:14:11,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 14:14:11,644 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand 8 states. [2018-11-23 14:14:11,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:11,796 INFO L93 Difference]: Finished difference Result 168 states and 185 transitions. [2018-11-23 14:14:11,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 14:14:11,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-23 14:14:11,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:11,797 INFO L225 Difference]: With dead ends: 168 [2018-11-23 14:14:11,797 INFO L226 Difference]: Without dead ends: 168 [2018-11-23 14:14:11,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-23 14:14:11,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-23 14:14:11,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 106. [2018-11-23 14:14:11,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 14:14:11,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-11-23 14:14:11,800 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 26 [2018-11-23 14:14:11,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:11,800 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-11-23 14:14:11,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 14:14:11,800 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-11-23 14:14:11,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 14:14:11,801 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:11,801 INFO L402 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] [2018-11-23 14:14:11,801 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr33REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2018-11-23 14:14:11,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:11,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1686568980, now seen corresponding path program 1 times [2018-11-23 14:14:11,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:14:11,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:14:11,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:11,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:11,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:11,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:11,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:14:11,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:14:11,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:14:11,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:14:11,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:14:11,822 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 4 states. [2018-11-23 14:14:11,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:11,879 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2018-11-23 14:14:11,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:14:11,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-23 14:14:11,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:11,880 INFO L225 Difference]: With dead ends: 121 [2018-11-23 14:14:11,880 INFO L226 Difference]: Without dead ends: 121 [2018-11-23 14:14:11,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:14:11,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-23 14:14:11,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 106. [2018-11-23 14:14:11,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 14:14:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2018-11-23 14:14:11,883 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 26 [2018-11-23 14:14:11,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:11,883 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2018-11-23 14:14:11,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:14:11,883 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2018-11-23 14:14:11,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 14:14:11,884 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:11,884 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:14:11,884 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr33REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2018-11-23 14:14:11,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:11,885 INFO L82 PathProgramCache]: Analyzing trace with hash -343636737, now seen corresponding path program 2 times [2018-11-23 14:14:11,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:14:11,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:14:11,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:11,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:11,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:11,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 14:14:11,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:14:11,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 14:14:11,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 14:14:11,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 14:14:11,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-23 14:14:11,975 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand 9 states. [2018-11-23 14:14:12,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:12,139 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2018-11-23 14:14:12,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 14:14:12,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-23 14:14:12,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:12,140 INFO L225 Difference]: With dead ends: 128 [2018-11-23 14:14:12,140 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 14:14:12,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-23 14:14:12,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 14:14:12,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 104. [2018-11-23 14:14:12,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 14:14:12,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-11-23 14:14:12,143 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 26 [2018-11-23 14:14:12,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:12,143 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-11-23 14:14:12,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 14:14:12,143 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-11-23 14:14:12,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 14:14:12,144 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:12,144 INFO L402 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] [2018-11-23 14:14:12,144 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr33REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2018-11-23 14:14:12,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:12,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1597248197, now seen corresponding path program 1 times [2018-11-23 14:14:12,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:14:12,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:14:12,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:12,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:14:12,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:12,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:12,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:14:12,255 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:14:12,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:12,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:14:12,302 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:12,303 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:12,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-23 14:14:12,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:12,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:12,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-11-23 14:14:12,326 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:14:12,328 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:12,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:12,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:12,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:12,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-11-23 14:14:12,375 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:12,377 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-11-23 14:14:12,379 INFO L478 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 16 treesize of output 1 [2018-11-23 14:14:12,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:12,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:12,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:12,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:26 [2018-11-23 14:14:12,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-11-23 14:14:12,405 INFO L478 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 12 treesize of output 11 [2018-11-23 14:14:12,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:12,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:12,415 INFO L267 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. [2018-11-23 14:14:12,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-11-23 14:14:12,466 INFO L478 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 36 treesize of output 24 [2018-11-23 14:14:12,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-23 14:14:12,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:12,475 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-23 14:14:12,475 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:12,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:12,482 INFO L267 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. [2018-11-23 14:14:12,482 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-11-23 14:14:12,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:12,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:14:12,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-11-23 14:14:12,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 14:14:12,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 14:14:12,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-11-23 14:14:12,543 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 21 states. [2018-11-23 14:14:13,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:13,186 INFO L93 Difference]: Finished difference Result 159 states and 178 transitions. [2018-11-23 14:14:13,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 14:14:13,187 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 26 [2018-11-23 14:14:13,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:13,187 INFO L225 Difference]: With dead ends: 159 [2018-11-23 14:14:13,187 INFO L226 Difference]: Without dead ends: 159 [2018-11-23 14:14:13,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=926, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 14:14:13,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-23 14:14:13,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 119. [2018-11-23 14:14:13,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-23 14:14:13,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 136 transitions. [2018-11-23 14:14:13,192 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 136 transitions. Word has length 26 [2018-11-23 14:14:13,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:13,192 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 136 transitions. [2018-11-23 14:14:13,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 14:14:13,192 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 136 transitions. [2018-11-23 14:14:13,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 14:14:13,193 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:13,193 INFO L402 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] [2018-11-23 14:14:13,193 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr33REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2018-11-23 14:14:13,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:13,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1597248198, now seen corresponding path program 1 times [2018-11-23 14:14:13,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:14:13,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:14:13,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:13,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:13,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:13,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:13,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:14:13,377 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:14:13,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:13,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:14:13,425 INFO L478 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 [2018-11-23 14:14:13,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:13,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:13,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:13,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 14:14:13,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:13,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:13,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-23 14:14:13,458 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:14:13,461 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:13,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:13,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:13,478 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:14:13,481 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:13,481 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:13,484 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:13,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:13,494 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-11-23 14:14:13,542 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:13,545 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-11-23 14:14:13,547 INFO L478 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 16 treesize of output 1 [2018-11-23 14:14:13,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:13,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:13,563 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2018-11-23 14:14:13,565 INFO L478 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 20 treesize of output 19 [2018-11-23 14:14:13,565 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:13,568 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:13,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:13,573 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:70, output treesize:28 [2018-11-23 14:14:13,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-11-23 14:14:13,592 INFO L478 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 12 treesize of output 11 [2018-11-23 14:14:13,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:13,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:13,608 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-23 14:14:13,609 INFO L478 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 12 treesize of output 11 [2018-11-23 14:14:13,610 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:13,613 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:13,619 INFO L267 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. [2018-11-23 14:14:13,619 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2018-11-23 14:14:13,660 INFO L478 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 47 treesize of output 33 [2018-11-23 14:14:13,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-23 14:14:13,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:13,668 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-11-23 14:14:13,668 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:13,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:13,677 INFO L478 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 20 [2018-11-23 14:14:13,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-23 14:14:13,679 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:13,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-23 14:14:13,686 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:13,688 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:13,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:13,693 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-11-23 14:14:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:13,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:14:13,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 17 [2018-11-23 14:14:13,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 14:14:13,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 14:14:13,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-11-23 14:14:13,719 INFO L87 Difference]: Start difference. First operand 119 states and 136 transitions. Second operand 18 states. [2018-11-23 14:14:14,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:14,381 INFO L93 Difference]: Finished difference Result 169 states and 190 transitions. [2018-11-23 14:14:14,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 14:14:14,381 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2018-11-23 14:14:14,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:14,382 INFO L225 Difference]: With dead ends: 169 [2018-11-23 14:14:14,382 INFO L226 Difference]: Without dead ends: 169 [2018-11-23 14:14:14,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=869, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 14:14:14,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-23 14:14:14,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 126. [2018-11-23 14:14:14,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 14:14:14,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 144 transitions. [2018-11-23 14:14:14,385 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 144 transitions. Word has length 26 [2018-11-23 14:14:14,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:14,385 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 144 transitions. [2018-11-23 14:14:14,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 14:14:14,386 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 144 transitions. [2018-11-23 14:14:14,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 14:14:14,386 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:14,386 INFO L402 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] [2018-11-23 14:14:14,386 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr33REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2018-11-23 14:14:14,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:14,387 INFO L82 PathProgramCache]: Analyzing trace with hash 63555904, now seen corresponding path program 1 times [2018-11-23 14:14:14,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:14:14,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:14:14,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:14,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:14,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:14,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:14,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:14:14,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 14:14:14,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 14:14:14,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 14:14:14,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-23 14:14:14,480 INFO L87 Difference]: Start difference. First operand 126 states and 144 transitions. Second operand 11 states. [2018-11-23 14:14:14,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:14,665 INFO L93 Difference]: Finished difference Result 152 states and 170 transitions. [2018-11-23 14:14:14,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 14:14:14,666 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-23 14:14:14,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:14,666 INFO L225 Difference]: With dead ends: 152 [2018-11-23 14:14:14,666 INFO L226 Difference]: Without dead ends: 152 [2018-11-23 14:14:14,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-11-23 14:14:14,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-23 14:14:14,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 137. [2018-11-23 14:14:14,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-23 14:14:14,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 155 transitions. [2018-11-23 14:14:14,669 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 155 transitions. Word has length 27 [2018-11-23 14:14:14,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:14,669 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 155 transitions. [2018-11-23 14:14:14,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 14:14:14,669 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2018-11-23 14:14:14,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 14:14:14,670 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:14,670 INFO L402 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] [2018-11-23 14:14:14,670 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr33REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2018-11-23 14:14:14,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:14,670 INFO L82 PathProgramCache]: Analyzing trace with hash -746877279, now seen corresponding path program 1 times [2018-11-23 14:14:14,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:14:14,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:14:14,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:14,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:14,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:14,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:14,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:14:14,771 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:14:14,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:14,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:14:14,807 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:14:14,808 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:14,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:14,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:14,816 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:14:14,817 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:14,817 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:14,819 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:14,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:14,823 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-11-23 14:14:14,837 INFO L478 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 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 14:14:14,840 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:14,842 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 14:14:14,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:14,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:14,857 INFO L478 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 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 14:14:14,859 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:14,860 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 14:14:14,860 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:14,863 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:14,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:14,867 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2018-11-23 14:14:14,871 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:14,871 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:14,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 14:14:14,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:14,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:14,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2018-11-23 14:14:14,898 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-23 14:14:14,900 INFO L478 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 16 treesize of output 1 [2018-11-23 14:14:14,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:14,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:14,911 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-23 14:14:14,912 INFO L478 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 16 treesize of output 1 [2018-11-23 14:14:14,913 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:14,915 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:14,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:14,919 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:60, output treesize:22 [2018-11-23 14:14:14,925 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 14:14:14,926 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:14,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:14,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:14,937 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 14:14:14,942 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:14,942 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:14,945 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:14,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:14,950 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:38 [2018-11-23 14:14:15,016 INFO L478 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 61 treesize of output 48 [2018-11-23 14:14:15,017 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2018-11-23 14:14:15,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:15,024 INFO L478 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 29 treesize of output 23 [2018-11-23 14:14:15,024 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:14:15,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:14:15,034 INFO L478 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 33 treesize of output 27 [2018-11-23 14:14:15,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 18 treesize of output 9 [2018-11-23 14:14:15,036 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:15,040 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 14:14:15,040 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:15,042 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:15,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:15,045 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:68, output treesize:7 [2018-11-23 14:14:15,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:15,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:14:15,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2018-11-23 14:14:15,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 14:14:15,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 14:14:15,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=222, Unknown=11, NotChecked=0, Total=272 [2018-11-23 14:14:15,075 INFO L87 Difference]: Start difference. First operand 137 states and 155 transitions. Second operand 17 states. [2018-11-23 14:14:15,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:15,630 INFO L93 Difference]: Finished difference Result 175 states and 195 transitions. [2018-11-23 14:14:15,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 14:14:15,630 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2018-11-23 14:14:15,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:15,631 INFO L225 Difference]: With dead ends: 175 [2018-11-23 14:14:15,631 INFO L226 Difference]: Without dead ends: 175 [2018-11-23 14:14:15,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=729, Unknown=12, NotChecked=0, Total=870 [2018-11-23 14:14:15,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-23 14:14:15,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 150. [2018-11-23 14:14:15,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-23 14:14:15,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 169 transitions. [2018-11-23 14:14:15,634 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 169 transitions. Word has length 28 [2018-11-23 14:14:15,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:15,634 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 169 transitions. [2018-11-23 14:14:15,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 14:14:15,634 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 169 transitions. [2018-11-23 14:14:15,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 14:14:15,635 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:15,635 INFO L402 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] [2018-11-23 14:14:15,635 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr33REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2018-11-23 14:14:15,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:15,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1935155437, now seen corresponding path program 1 times [2018-11-23 14:14:15,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:14:15,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:14:15,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:15,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:15,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:15,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 14:14:15,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:14:15,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 14:14:15,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 14:14:15,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 14:14:15,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 14:14:15,676 INFO L87 Difference]: Start difference. First operand 150 states and 169 transitions. Second operand 7 states. [2018-11-23 14:14:15,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:15,799 INFO L93 Difference]: Finished difference Result 179 states and 197 transitions. [2018-11-23 14:14:15,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 14:14:15,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-23 14:14:15,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:15,800 INFO L225 Difference]: With dead ends: 179 [2018-11-23 14:14:15,800 INFO L226 Difference]: Without dead ends: 179 [2018-11-23 14:14:15,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-23 14:14:15,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-23 14:14:15,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 150. [2018-11-23 14:14:15,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-23 14:14:15,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 167 transitions. [2018-11-23 14:14:15,803 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 167 transitions. Word has length 30 [2018-11-23 14:14:15,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:15,803 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 167 transitions. [2018-11-23 14:14:15,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 14:14:15,803 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 167 transitions. [2018-11-23 14:14:15,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 14:14:15,804 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:15,804 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:14:15,804 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr33REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2018-11-23 14:14:15,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:15,804 INFO L82 PathProgramCache]: Analyzing trace with hash 174659178, now seen corresponding path program 2 times [2018-11-23 14:14:15,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:14:15,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:14:15,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:15,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:15,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:15,957 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:15,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:14:15,957 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:14:15,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 14:14:15,981 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 14:14:15,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 14:14:15,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:14:16,016 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:16,016 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:16,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 14:14:16,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:16,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:16,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-11-23 14:14:16,036 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:14:16,039 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:16,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:16,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:16,052 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:14:16,054 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:16,054 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:16,056 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:16,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:16,063 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:18 [2018-11-23 14:14:16,116 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:16,119 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2018-11-23 14:14:16,121 INFO L478 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 20 treesize of output 19 [2018-11-23 14:14:16,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:16,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:16,133 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:16,135 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-11-23 14:14:16,137 INFO L478 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 16 treesize of output 1 [2018-11-23 14:14:16,137 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:16,140 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:16,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:16,146 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:22 [2018-11-23 14:14:16,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-11-23 14:14:16,164 INFO L478 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 16 treesize of output 15 [2018-11-23 14:14:16,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:16,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:16,177 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2018-11-23 14:14:16,179 INFO L478 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 16 treesize of output 15 [2018-11-23 14:14:16,179 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:16,183 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:16,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:16,187 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:42 [2018-11-23 14:14:16,260 INFO L478 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 69 treesize of output 56 [2018-11-23 14:14:16,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 3 [2018-11-23 14:14:16,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:16,266 INFO L478 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 33 treesize of output 27 [2018-11-23 14:14:16,267 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:14:16,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:14:16,275 INFO L478 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 23 treesize of output 19 [2018-11-23 14:14:16,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 [2018-11-23 14:14:16,277 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:14:16,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-23 14:14:16,281 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:16,282 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:16,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:16,284 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:69, output treesize:7 [2018-11-23 14:14:16,294 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:16,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:14:16,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-11-23 14:14:16,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 14:14:16,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 14:14:16,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=528, Unknown=3, NotChecked=0, Total=600 [2018-11-23 14:14:16,309 INFO L87 Difference]: Start difference. First operand 150 states and 167 transitions. Second operand 25 states. [2018-11-23 14:14:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:17,120 INFO L93 Difference]: Finished difference Result 177 states and 193 transitions. [2018-11-23 14:14:17,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 14:14:17,120 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2018-11-23 14:14:17,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:17,121 INFO L225 Difference]: With dead ends: 177 [2018-11-23 14:14:17,121 INFO L226 Difference]: Without dead ends: 177 [2018-11-23 14:14:17,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=1059, Unknown=4, NotChecked=0, Total=1260 [2018-11-23 14:14:17,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-23 14:14:17,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 149. [2018-11-23 14:14:17,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-23 14:14:17,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 164 transitions. [2018-11-23 14:14:17,124 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 164 transitions. Word has length 31 [2018-11-23 14:14:17,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:17,125 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 164 transitions. [2018-11-23 14:14:17,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 14:14:17,125 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 164 transitions. [2018-11-23 14:14:17,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 14:14:17,125 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:17,125 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:14:17,126 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr33REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2018-11-23 14:14:17,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:17,126 INFO L82 PathProgramCache]: Analyzing trace with hash 2011463968, now seen corresponding path program 3 times [2018-11-23 14:14:17,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:14:17,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:14:17,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:17,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:14:17,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:17,309 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:17,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:14:17,309 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:14:17,316 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 14:14:17,343 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 14:14:17,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 14:14:17,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:14:17,385 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:17,386 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:17,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 14:14:17,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:17,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:17,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-11-23 14:14:17,408 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:14:17,409 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:17,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:17,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:17,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:17,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-11-23 14:14:17,479 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:17,483 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-11-23 14:14:17,484 INFO L478 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 16 treesize of output 1 [2018-11-23 14:14:17,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:17,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:17,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:17,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:20 [2018-11-23 14:14:17,515 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:17,517 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-23 14:14:17,519 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:17,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:17,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:17,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:17,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:27 [2018-11-23 14:14:17,552 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:17,553 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:17,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 14:14:17,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:17,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:17,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-11-23 14:14:17,584 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-23 14:14:17,588 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-23 14:14:17,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:17,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:17,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:17,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:28 [2018-11-23 14:14:17,663 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:17,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 73 [2018-11-23 14:14:17,677 INFO L478 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 69 treesize of output 53 [2018-11-23 14:14:17,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:17,702 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 34 [2018-11-23 14:14:17,702 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 14:14:17,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:14:17,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 14:14:17,724 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:63, output treesize:61 [2018-11-23 14:14:17,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 64 [2018-11-23 14:14:17,774 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 51 [2018-11-23 14:14:17,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 14:14:17,798 INFO L478 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 49 treesize of output 48 [2018-11-23 14:14:17,799 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:17,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:14:17,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-11-23 14:14:17,835 INFO L478 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 12 treesize of output 11 [2018-11-23 14:14:17,835 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:17,839 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:17,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-23 14:14:17,855 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:101, output treesize:113 [2018-11-23 14:14:17,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 43 [2018-11-23 14:14:17,971 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2018-11-23 14:14:17,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 14:14:17,988 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-11-23 14:14:17,988 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:18,003 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-11-23 14:14:18,003 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:18,004 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-11-23 14:14:18,004 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:18,016 INFO L478 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 27 treesize of output 23 [2018-11-23 14:14:18,016 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:18,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 10 [2018-11-23 14:14:18,028 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:18,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:18,041 INFO L478 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 36 treesize of output 24 [2018-11-23 14:14:18,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-23 14:14:18,043 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:18,047 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-23 14:14:18,047 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:18,050 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:18,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:18,056 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:89, output treesize:5 [2018-11-23 14:14:18,059 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:18,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:14:18,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2018-11-23 14:14:18,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 14:14:18,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 14:14:18,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2018-11-23 14:14:18,076 INFO L87 Difference]: Start difference. First operand 149 states and 164 transitions. Second operand 32 states. [2018-11-23 14:14:19,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:19,507 INFO L93 Difference]: Finished difference Result 230 states and 252 transitions. [2018-11-23 14:14:19,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 14:14:19,507 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 33 [2018-11-23 14:14:19,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:19,508 INFO L225 Difference]: With dead ends: 230 [2018-11-23 14:14:19,508 INFO L226 Difference]: Without dead ends: 230 [2018-11-23 14:14:19,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=585, Invalid=3073, Unknown=2, NotChecked=0, Total=3660 [2018-11-23 14:14:19,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-11-23 14:14:19,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 164. [2018-11-23 14:14:19,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-23 14:14:19,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 184 transitions. [2018-11-23 14:14:19,512 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 184 transitions. Word has length 33 [2018-11-23 14:14:19,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:19,512 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 184 transitions. [2018-11-23 14:14:19,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 14:14:19,512 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 184 transitions. [2018-11-23 14:14:19,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 14:14:19,512 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:19,513 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:14:19,513 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr33REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2018-11-23 14:14:19,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:19,513 INFO L82 PathProgramCache]: Analyzing trace with hash 2011463969, now seen corresponding path program 2 times [2018-11-23 14:14:19,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:14:19,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:14:19,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:19,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:14:19,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:19,706 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:19,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:14:19,707 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:14:19,713 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 14:14:19,730 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 14:14:19,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 14:14:19,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:14:19,773 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:19,774 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:19,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-23 14:14:19,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:19,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:19,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-11-23 14:14:19,803 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:14:19,805 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:19,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:19,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:19,816 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:14:19,818 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:19,818 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:19,819 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:19,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:19,827 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-11-23 14:14:19,889 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:19,892 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2018-11-23 14:14:19,894 INFO L478 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 20 treesize of output 19 [2018-11-23 14:14:19,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:19,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:19,908 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:19,911 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-11-23 14:14:19,913 INFO L478 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 16 treesize of output 1 [2018-11-23 14:14:19,913 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:19,918 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:19,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:19,925 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:36 [2018-11-23 14:14:19,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:19,951 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-11-23 14:14:19,954 INFO L478 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 12 treesize of output 11 [2018-11-23 14:14:19,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:19,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:19,978 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:19,982 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-11-23 14:14:19,984 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:19,985 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:19,994 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:20,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:20,007 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:57 [2018-11-23 14:14:20,051 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:20,052 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:20,053 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:20,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-23 14:14:20,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:20,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:20,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:62, output treesize:55 [2018-11-23 14:14:20,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-11-23 14:14:20,119 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-11-23 14:14:20,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:20,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:20,142 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-11-23 14:14:20,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-23 14:14:20,146 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:20,152 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:20,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:20,162 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:84, output treesize:52 [2018-11-23 14:14:20,244 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:20,245 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:20,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 82 [2018-11-23 14:14:20,252 INFO L478 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 16 treesize of output 1 [2018-11-23 14:14:20,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:20,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:20,274 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 36 [2018-11-23 14:14:20,276 INFO L478 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 24 treesize of output 23 [2018-11-23 14:14:20,276 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:20,280 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:20,288 INFO L267 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. [2018-11-23 14:14:20,289 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:110, output treesize:64 [2018-11-23 14:14:20,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 81 [2018-11-23 14:14:20,326 INFO L478 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 16 treesize of output 15 [2018-11-23 14:14:20,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:20,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:20,349 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-11-23 14:14:20,350 INFO L478 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 16 treesize of output 15 [2018-11-23 14:14:20,351 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:20,354 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:20,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 14:14:20,364 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:115, output treesize:91 [2018-11-23 14:14:20,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 54 [2018-11-23 14:14:20,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-23 14:14:20,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:20,456 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-11-23 14:14:20,456 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:20,465 INFO L478 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 22 treesize of output 16 [2018-11-23 14:14:20,465 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:14:20,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:14:20,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 20 [2018-11-23 14:14:20,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-23 14:14:20,481 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:20,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-23 14:14:20,485 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:20,486 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:20,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:20,492 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:102, output treesize:9 [2018-11-23 14:14:20,532 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:20,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:14:20,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2018-11-23 14:14:20,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 14:14:20,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 14:14:20,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=936, Unknown=5, NotChecked=0, Total=1056 [2018-11-23 14:14:20,548 INFO L87 Difference]: Start difference. First operand 164 states and 184 transitions. Second operand 33 states. [2018-11-23 14:14:22,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:22,588 INFO L93 Difference]: Finished difference Result 225 states and 249 transitions. [2018-11-23 14:14:22,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 14:14:22,591 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-11-23 14:14:22,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:22,592 INFO L225 Difference]: With dead ends: 225 [2018-11-23 14:14:22,592 INFO L226 Difference]: Without dead ends: 225 [2018-11-23 14:14:22,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=465, Invalid=2938, Unknown=19, NotChecked=0, Total=3422 [2018-11-23 14:14:22,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-11-23 14:14:22,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 166. [2018-11-23 14:14:22,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-23 14:14:22,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 187 transitions. [2018-11-23 14:14:22,596 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 187 transitions. Word has length 33 [2018-11-23 14:14:22,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:22,596 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 187 transitions. [2018-11-23 14:14:22,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 14:14:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 187 transitions. [2018-11-23 14:14:22,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 14:14:22,596 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:22,597 INFO L402 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] [2018-11-23 14:14:22,597 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr33REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2018-11-23 14:14:22,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:22,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1794692839, now seen corresponding path program 1 times [2018-11-23 14:14:22,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:14:22,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:14:22,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:22,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:14:22,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:22,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:22,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:14:22,654 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:14:22,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:22,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:14:22,753 INFO L478 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 11 [2018-11-23 14:14:22,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-23 14:14:22,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:22,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:22,761 INFO L478 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 11 [2018-11-23 14:14:22,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-23 14:14:22,763 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:22,763 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:22,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:22,767 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2018-11-23 14:14:22,794 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:14:22,795 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:22,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:22,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:22,800 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:14:22,802 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:22,802 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:22,803 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:22,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:22,805 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-11-23 14:14:22,856 INFO L478 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 11 [2018-11-23 14:14:22,860 INFO L478 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:14:22,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 14:14:22,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:14:22,871 INFO L478 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 11 [2018-11-23 14:14:22,876 INFO L478 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:14:22,876 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 14:14:22,879 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:14:22,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:14:22,887 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:18 [2018-11-23 14:14:22,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:22,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:14:22,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 20 [2018-11-23 14:14:22,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 14:14:22,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 14:14:22,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-11-23 14:14:22,948 INFO L87 Difference]: Start difference. First operand 166 states and 187 transitions. Second operand 20 states. [2018-11-23 14:14:23,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:23,623 INFO L93 Difference]: Finished difference Result 203 states and 225 transitions. [2018-11-23 14:14:23,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 14:14:23,624 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2018-11-23 14:14:23,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:23,625 INFO L225 Difference]: With dead ends: 203 [2018-11-23 14:14:23,625 INFO L226 Difference]: Without dead ends: 203 [2018-11-23 14:14:23,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 14:14:23,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-23 14:14:23,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 176. [2018-11-23 14:14:23,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-23 14:14:23,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 198 transitions. [2018-11-23 14:14:23,629 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 198 transitions. Word has length 34 [2018-11-23 14:14:23,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:23,629 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 198 transitions. [2018-11-23 14:14:23,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 14:14:23,629 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 198 transitions. [2018-11-23 14:14:23,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 14:14:23,629 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:23,630 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:14:23,630 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr33REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION]=== [2018-11-23 14:14:23,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:23,630 INFO L82 PathProgramCache]: Analyzing trace with hash -199098276, now seen corresponding path program 1 times [2018-11-23 14:14:23,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:14:23,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:14:23,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:23,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:23,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:14:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:14:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:14:23,663 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=18, |#NULL.offset|=10, |old(#NULL.base)|=18, |old(#NULL.offset)|=10] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=18, |old(#NULL.offset)|=10] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=18, |old(#NULL.offset)|=10] [?] RET #180#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret17 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~head~0.base=15, main_~head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0] [?] SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L989 VAL [main_~head~0.base=15, main_~head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0] [?] SUMMARY for call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L989-1 VAL [main_~head~0.base=15, main_~head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0] [?] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~nondet4|=0] [?] assume !(0 != #t~nondet4);havoc #t~nondet4;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0] [?] SUMMARY for call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1015-3 VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~mem8.base|=0, |main_#t~mem8.offset|=0] [?] assume !(#t~mem8.base != 0 || #t~mem8.offset != 0);havoc #t~mem8.base, #t~mem8.offset; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0] [?] SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1015-4 VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~mem9.base|=0, |main_#t~mem9.offset|=0] [?] ~y~0.base, ~y~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(8); VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc10.base|=14, |main_#t~malloc10.offset|=0] [?] SUMMARY for call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1023 VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc10.base|=14, |main_#t~malloc10.offset|=0] [?] SUMMARY for call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4); srcloc: L1023-1 VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc10.base|=14, |main_#t~malloc10.offset|=0] [?] SUMMARY for call write~$Pointer$(~y~0.base, ~y~0.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1024 VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc10.base|=14, |main_#t~malloc10.offset|=0] [?] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc10.base|=14, |main_#t~malloc10.offset|=0] [?] SUMMARY for call #t~mem11 := read~int(~x~0.base, 4 + ~x~0.offset, 4); srcloc: L1032-3 VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc10.base|=14, |main_#t~malloc10.offset|=0, |main_#t~mem11|=1] [?] assume !(1 != #t~mem11);havoc #t~mem11; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc10.base|=14, |main_#t~malloc10.offset|=0] [?] SUMMARY for call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1032-4 VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc10.base|=14, |main_#t~malloc10.offset|=0, |main_#t~mem13.base|=0, |main_#t~mem13.offset|=0] [?] ~x~0.base, ~x~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=0, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc10.base|=14, |main_#t~malloc10.offset|=0] [?] assume !(~x~0.base != 0 || ~x~0.offset != 0); VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=0, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc10.base|=14, |main_#t~malloc10.offset|=0] [?] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc10.base|=14, |main_#t~malloc10.offset|=0] [?] assume !!(~x~0.base != 0 || ~x~0.offset != 0);~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc10.base|=14, |main_#t~malloc10.offset|=0] [?] SUMMARY for call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1051 VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc10.base|=14, |main_#t~malloc10.offset|=0, |main_#t~mem16.base|=0, |main_#t~mem16.offset|=0] [?] ~x~0.base, ~x~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=0, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc10.base|=14, |main_#t~malloc10.offset|=0] [?] assume 0 == ~head~0.offset; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=0, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc10.base|=14, |main_#t~malloc10.offset|=0] [?] assume 0 == ~head~0.base || 1 == #valid[~head~0.base];call ULTIMATE.dealloc(~head~0.base, ~head~0.offset); VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=0, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc10.base|=14, |main_#t~malloc10.offset|=0] [?] assume !(~x~0.base != 0 || ~x~0.offset != 0); VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=0, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc10.base|=14, |main_#t~malloc10.offset|=0] [?] #res := 0; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=0, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#res|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc10.base|=14, |main_#t~malloc10.offset|=0] [?] assume !(#valid == old(#valid)); VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=0, main_~x~0.offset=0, main_~y~0.base=0, main_~y~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#res|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc10.base|=14, |main_#t~malloc10.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=18, #NULL.offset=10, old(#NULL.base)=18, old(#NULL.offset)=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=18, old(#NULL.offset)=10] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=18, old(#NULL.offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L988] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L988] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~head~0.base=15, ~head~0.offset=0] [L989] call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~head~0.base=15, ~head~0.offset=0] [L990] call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~head~0.base=15, ~head~0.offset=0] [L992] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L995] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~nondet1=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L995-L1002] assume !(0 != #t~nondet1); [L995] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1005] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~nondet4=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1005-L1026] assume !(0 != #t~nondet4); [L1005] havoc #t~nondet4; [L1014] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1015] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~mem8.base=0, #t~mem8.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1015-L1019] assume !(#t~mem8.base != 0 || #t~mem8.offset != 0); [L1015] havoc #t~mem8.base, #t~mem8.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1022] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~mem9.base=0, #t~mem9.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1022] ~y~0.base, ~y~0.offset := #t~mem9.base, #t~mem9.offset; [L1022] havoc #t~mem9.base, #t~mem9.offset; [L1023] call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(8); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1023] call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~x~0.base, ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1024] call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1025] call write~$Pointer$(~y~0.base, ~y~0.offset, ~x~0.base, ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1029] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1032] call #t~mem11 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, #t~mem11=1, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1032-L1035] assume !(1 != #t~mem11); [L1032] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1038] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, #t~mem13.base=0, #t~mem13.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1038] ~x~0.base, ~x~0.offset := #t~mem13.base, #t~mem13.offset; [L1038] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=0, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1039-L1044] assume !(~x~0.base != 0 || ~x~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=0, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1047] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1048-L1053] assume !!(~x~0.base != 0 || ~x~0.offset != 0); [L1050] ~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1051] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, #t~mem16.base=0, #t~mem16.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1051] ~x~0.base, ~x~0.offset := #t~mem16.base, #t~mem16.offset; [L1051] havoc #t~mem16.base, #t~mem16.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=0, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1052] assert 0 == ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=0, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1052] assert 0 == ~head~0.base || 1 == #valid[~head~0.base]; [L1052] call ULTIMATE.dealloc(~head~0.base, ~head~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=0, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1048-L1053] assume !(~x~0.base != 0 || ~x~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=0, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1055] #res := 0; VAL [#NULL.base=0, #NULL.offset=0, #res=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=0, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L985-L1056] ensures #valid == old(#valid); VAL [#NULL.base=0, #NULL.offset=0, #res=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=0, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] ----- [2018-11-23 14:14:23,696 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=18, #NULL.offset=10, old(#NULL.base)=18, old(#NULL.offset)=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=18, old(#NULL.offset)=10] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=18, old(#NULL.offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L988] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L988] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~head~0.base=15, ~head~0.offset=0] [L989] call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~head~0.base=15, ~head~0.offset=0] [L990] call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~head~0.base=15, ~head~0.offset=0] [L992] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L995] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~nondet1=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L995-L1002] assume !(0 != #t~nondet1); [L995] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1005] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~nondet4=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1005-L1026] assume !(0 != #t~nondet4); [L1005] havoc #t~nondet4; [L1014] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1015] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~mem8.base=0, #t~mem8.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1015-L1019] assume !(#t~mem8.base != 0 || #t~mem8.offset != 0); [L1015] havoc #t~mem8.base, #t~mem8.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1022] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~mem9.base=0, #t~mem9.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1022] ~y~0.base, ~y~0.offset := #t~mem9.base, #t~mem9.offset; [L1022] havoc #t~mem9.base, #t~mem9.offset; [L1023] call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(8); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1023] call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~x~0.base, ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1024] call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1025] call write~$Pointer$(~y~0.base, ~y~0.offset, ~x~0.base, ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1029] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1032] call #t~mem11 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, #t~mem11=1, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1032-L1035] assume !(1 != #t~mem11); [L1032] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1038] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, #t~mem13.base=0, #t~mem13.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1038] ~x~0.base, ~x~0.offset := #t~mem13.base, #t~mem13.offset; [L1038] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=0, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1039-L1044] assume !(~x~0.base != 0 || ~x~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=0, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1047] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1048-L1053] assume !!(~x~0.base != 0 || ~x~0.offset != 0); [L1050] ~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1051] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, #t~mem16.base=0, #t~mem16.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1051] ~x~0.base, ~x~0.offset := #t~mem16.base, #t~mem16.offset; [L1051] havoc #t~mem16.base, #t~mem16.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=0, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1052] assert 0 == ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=0, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1052] assert 0 == ~head~0.base || 1 == #valid[~head~0.base]; [L1052] call ULTIMATE.dealloc(~head~0.base, ~head~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=0, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1048-L1053] assume !(~x~0.base != 0 || ~x~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=0, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L1055] #res := 0; VAL [#NULL.base=0, #NULL.offset=0, #res=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=0, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [L985-L1056] ensures #valid == old(#valid); VAL [#NULL.base=0, #NULL.offset=0, #res=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc10.base=14, #t~malloc10.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=0, ~x~0.offset=0, ~y~0.base=0, ~y~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=18, #NULL!offset=10, old(#NULL!base)=18, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=18, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L988] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L988] ~head~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0] [L989] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0] [L990] FCALL call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0] [L992] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L995] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L995-L1002] COND TRUE !(0 != #t~nondet1) [L995] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1005] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet4=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1005-L1026] COND FALSE !(0 != #t~nondet4) [L1005] havoc #t~nondet4; [L1014] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1015] FCALL call #t~mem8 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~mem8!base=0, #t~mem8!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1015-L1019] COND TRUE !(#t~mem8 != { base: 0, offset: 0 }) [L1015] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1022] FCALL call #t~mem9 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~mem9!base=0, #t~mem9!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1022] ~y~0 := #t~mem9; [L1022] havoc #t~mem9; [L1023] FCALL call #t~malloc10 := #Ultimate.alloc(8); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1023] FCALL call write~$Pointer$(#t~malloc10, { base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1024] FCALL call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1025] FCALL call write~$Pointer$(~y~0, { base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1029] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1032] FCALL call #t~mem11 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, #t~mem11=1, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1032-L1035] COND TRUE !(1 != #t~mem11) [L1032] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1038] FCALL call #t~mem13 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, #t~mem13!base=0, #t~mem13!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1038] ~x~0 := #t~mem13; [L1038] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=0, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1039-L1044] COND TRUE !(~x~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=0, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1047] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1048-L1053] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) [L1050] ~head~0 := ~x~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1051] FCALL call #t~mem16 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, #t~mem16!base=0, #t~mem16!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1051] ~x~0 := #t~mem16; [L1051] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=0, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1052] assert 0 == ~head~0!offset; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=0, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1052] assert 0 == ~head~0!base || 1 == #valid[~head~0!base]; [L1052] FCALL call ULTIMATE.dealloc(~head~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=0, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1048-L1053] COND TRUE !(~x~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=0, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1055] #res := 0; VAL [#NULL!base=0, #NULL!offset=0, #res=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=0, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=18, #NULL!offset=10, old(#NULL!base)=18, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=18, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L988] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L988] ~head~0 := #t~malloc0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0] [L989] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0] [L990] FCALL call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0] [L992] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L995] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L995-L1002] COND TRUE !(0 != #t~nondet1) [L995] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1005] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet4=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1005-L1026] COND FALSE !(0 != #t~nondet4) [L1005] havoc #t~nondet4; [L1014] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1015] FCALL call #t~mem8 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~mem8!base=0, #t~mem8!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1015-L1019] COND TRUE !(#t~mem8 != { base: 0, offset: 0 }) [L1015] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1022] FCALL call #t~mem9 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~mem9!base=0, #t~mem9!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1022] ~y~0 := #t~mem9; [L1022] havoc #t~mem9; [L1023] FCALL call #t~malloc10 := #Ultimate.alloc(8); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1023] FCALL call write~$Pointer$(#t~malloc10, { base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1024] FCALL call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1025] FCALL call write~$Pointer$(~y~0, { base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1029] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1032] FCALL call #t~mem11 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, #t~mem11=1, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1032-L1035] COND TRUE !(1 != #t~mem11) [L1032] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1038] FCALL call #t~mem13 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, #t~mem13!base=0, #t~mem13!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1038] ~x~0 := #t~mem13; [L1038] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=0, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1039-L1044] COND TRUE !(~x~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=0, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1047] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1048-L1053] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) [L1050] ~head~0 := ~x~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1051] FCALL call #t~mem16 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, #t~mem16!base=0, #t~mem16!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1051] ~x~0 := #t~mem16; [L1051] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=0, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1052] assert 0 == ~head~0!offset; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=0, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1052] assert 0 == ~head~0!base || 1 == #valid[~head~0!base]; [L1052] FCALL call ULTIMATE.dealloc(~head~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=0, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1048-L1053] COND TRUE !(~x~0 != { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=0, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L1055] #res := 0; VAL [#NULL!base=0, #NULL!offset=0, #res=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc10!base=14, #t~malloc10!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=0, ~x~0!offset=0, ~y~0!base=0, ~y~0!offset=0] [L988] SLL* head = malloc(sizeof(SLL)); VAL [head={15:0}, malloc(sizeof(SLL))={15:0}] [L989] head->next = ((void*)0) VAL [head={15:0}, malloc(sizeof(SLL))={15:0}] [L990] head->data = 0 VAL [head={15:0}, malloc(sizeof(SLL))={15:0}] [L992] SLL* x = head; VAL [head={15:0}, malloc(sizeof(SLL))={15:0}, x={15:0}] [L995] COND FALSE !(__VERIFIER_nondet_int()) [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1014] x = head VAL [head={15:0}, malloc(sizeof(SLL))={15:0}, x={15:0}] [L1015] x->next VAL [head={15:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, x->next={0:0}] [L1015] COND FALSE !(x->next) [L1022] EXPR x->next VAL [head={15:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, x->next={0:0}] [L1022] SLL* y = x->next; [L1023] x->next = malloc(sizeof(SLL)) VAL [head={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, y={0:0}] [L1024] x->data = 1 VAL [head={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, y={0:0}] [L1025] x->next = y VAL [head={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, y={0:0}] [L1029] x = head VAL [head={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, y={0:0}] [L1032] EXPR x->data VAL [head={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, x->data=1, y={0:0}] [L1032] COND FALSE !(x->data != 1) [L1038] EXPR x->next VAL [head={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, x->next={0:0}, y={0:0}] [L1038] x = x->next [L1039] COND FALSE !(\read(*x)) VAL [head={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1047] x = head VAL [head={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, y={0:0}] [L1048] COND TRUE x != ((void*)0) [L1050] head = x VAL [head={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, y={0:0}] [L1051] EXPR x->next VAL [head={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, x->next={0:0}, y={0:0}] [L1051] x = x->next [L1052] free(head) VAL [head={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1052] free(head) [L1048] COND FALSE !(x != ((void*)0)) VAL [head={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1055] return 0; VAL [\result=0, head={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] ----- [2018-11-23 14:14:23,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:14:23 BoogieIcfgContainer [2018-11-23 14:14:23,739 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 14:14:23,739 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:14:23,740 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:14:23,740 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:14:23,740 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:14:07" (3/4) ... [2018-11-23 14:14:23,744 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 14:14:23,744 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:14:23,744 INFO L168 Benchmark]: Toolchain (without parser) took 16606.87 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 440.4 MB). Free memory was 955.4 MB in the beginning and 907.1 MB in the end (delta: 48.3 MB). Peak memory consumption was 488.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:14:23,745 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:14:23,746 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:14:23,751 INFO L168 Benchmark]: Boogie Preprocessor took 44.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 14:14:23,752 INFO L168 Benchmark]: RCFGBuilder took 475.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. [2018-11-23 14:14:23,752 INFO L168 Benchmark]: TraceAbstraction took 15747.10 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 312.0 MB). Free memory was 1.1 GB in the beginning and 907.1 MB in the end (delta: 148.0 MB). Peak memory consumption was 460.0 MB. Max. memory is 11.5 GB. [2018-11-23 14:14:23,752 INFO L168 Benchmark]: Witness Printer took 4.29 ms. Allocated memory is still 1.5 GB. Free memory is still 907.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:14:23,753 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 333.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 475.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15747.10 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 312.0 MB). Free memory was 1.1 GB in the beginning and 907.1 MB in the end (delta: 148.0 MB). Peak memory consumption was 460.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.29 ms. Allocated memory is still 1.5 GB. Free memory is still 907.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 985. Possible FailurePath: [L988] SLL* head = malloc(sizeof(SLL)); VAL [head={15:0}, malloc(sizeof(SLL))={15:0}] [L989] head->next = ((void*)0) VAL [head={15:0}, malloc(sizeof(SLL))={15:0}] [L990] head->data = 0 VAL [head={15:0}, malloc(sizeof(SLL))={15:0}] [L992] SLL* x = head; VAL [head={15:0}, malloc(sizeof(SLL))={15:0}, x={15:0}] [L995] COND FALSE !(__VERIFIER_nondet_int()) [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1014] x = head VAL [head={15:0}, malloc(sizeof(SLL))={15:0}, x={15:0}] [L1015] x->next VAL [head={15:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, x->next={0:0}] [L1015] COND FALSE !(x->next) [L1022] EXPR x->next VAL [head={15:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, x->next={0:0}] [L1022] SLL* y = x->next; [L1023] x->next = malloc(sizeof(SLL)) VAL [head={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, y={0:0}] [L1024] x->data = 1 VAL [head={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, y={0:0}] [L1025] x->next = y VAL [head={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, y={0:0}] [L1029] x = head VAL [head={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, y={0:0}] [L1032] EXPR x->data VAL [head={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, x->data=1, y={0:0}] [L1032] COND FALSE !(x->data != 1) [L1038] EXPR x->next VAL [head={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, x->next={0:0}, y={0:0}] [L1038] x = x->next [L1039] COND FALSE !(\read(*x)) VAL [head={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1047] x = head VAL [head={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, y={0:0}] [L1048] COND TRUE x != ((void*)0) [L1050] head = x VAL [head={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, y={0:0}] [L1051] EXPR x->next VAL [head={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, x->next={0:0}, y={0:0}] [L1051] x = x->next [L1052] free(head) VAL [head={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1052] free(head) [L1048] COND FALSE !(x != ((void*)0)) VAL [head={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1055] return 0; VAL [\result=0, head={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 99 locations, 43 error locations. UNSAFE Result, 15.6s OverallTime, 24 OverallIterations, 3 TraceHistogramMax, 9.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1256 SDtfs, 4512 SDslu, 5133 SDs, 0 SdLazy, 11995 SolverSat, 1232 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 649 GetRequests, 198 SyntacticMatches, 41 SemanticMatches, 410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2816 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 831 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 813 NumberOfCodeBlocks, 813 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 746 ConstructedInterpolants, 47 QuantifiedInterpolants, 268108 SizeOfPredicates, 127 NumberOfNonLiveVariables, 1381 ConjunctsInSsa, 339 ConjunctsInUnsatCore, 32 InterpolantComputations, 14 PerfectInterpolantSequences, 24/100 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 14:14:25,285 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:14:25,287 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:14:25,295 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:14:25,296 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:14:25,296 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:14:25,297 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:14:25,298 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:14:25,299 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:14:25,300 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:14:25,301 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:14:25,301 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:14:25,301 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:14:25,303 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:14:25,303 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:14:25,304 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:14:25,304 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:14:25,306 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:14:25,307 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:14:25,309 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:14:25,310 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:14:25,310 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:14:25,312 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:14:25,312 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:14:25,312 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:14:25,313 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:14:25,314 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:14:25,315 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:14:25,315 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:14:25,316 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:14:25,316 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:14:25,317 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:14:25,317 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:14:25,317 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:14:25,318 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:14:25,319 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:14:25,319 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-11-23 14:14:25,329 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:14:25,329 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:14:25,330 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:14:25,330 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 14:14:25,331 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:14:25,331 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:14:25,331 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 14:14:25,331 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:14:25,331 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:14:25,331 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 14:14:25,332 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:14:25,332 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:14:25,332 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:14:25,332 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 14:14:25,332 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 14:14:25,332 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 14:14:25,332 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:14:25,332 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 14:14:25,333 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 14:14:25,333 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:14:25,333 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:14:25,333 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:14:25,333 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:14:25,333 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:14:25,333 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 14:14:25,334 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:14:25,336 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:14:25,336 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:14:25,336 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 14:14:25,336 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:14:25,336 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 14:14:25,336 INFO L133 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/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 -> 5a3a274b64e7ba6d81948d0b8c45cbd715251888 [2018-11-23 14:14:25,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:14:25,374 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:14:25,377 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:14:25,378 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:14:25,378 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:14:25,379 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-11-23 14:14:25,424 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/data/eb6122f82/a916c3ce0bdd42429b5825d6f1dfed2c/FLAGa3404dd10 [2018-11-23 14:14:25,780 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:14:25,780 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/sv-benchmarks/c/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-11-23 14:14:25,786 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/data/eb6122f82/a916c3ce0bdd42429b5825d6f1dfed2c/FLAGa3404dd10 [2018-11-23 14:14:26,180 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/data/eb6122f82/a916c3ce0bdd42429b5825d6f1dfed2c [2018-11-23 14:14:26,182 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:14:26,183 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-23 14:14:26,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:14:26,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:14:26,186 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:14:26,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:14:26" (1/1) ... [2018-11-23 14:14:26,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76c8d554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:26, skipping insertion in model container [2018-11-23 14:14:26,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:14:26" (1/1) ... [2018-11-23 14:14:26,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:14:26,225 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:14:26,458 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:14:26,470 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:14:26,506 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:14:26,543 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:14:26,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:26 WrapperNode [2018-11-23 14:14:26,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:14:26,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:14:26,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:14:26,544 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:14:26,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:26" (1/1) ... [2018-11-23 14:14:26,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:26" (1/1) ... [2018-11-23 14:14:26,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:26" (1/1) ... [2018-11-23 14:14:26,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:26" (1/1) ... [2018-11-23 14:14:26,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:26" (1/1) ... [2018-11-23 14:14:26,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:26" (1/1) ... [2018-11-23 14:14:26,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:26" (1/1) ... [2018-11-23 14:14:26,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:14:26,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:14:26,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:14:26,632 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:14:26,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/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 [2018-11-23 14:14:26,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 14:14:26,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:14:26,668 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 14:14:26,668 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-23 14:14:26,668 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-23 14:14:26,668 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-23 14:14:26,668 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-23 14:14:26,668 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-23 14:14:26,668 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-23 14:14:26,668 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-23 14:14:26,669 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-23 14:14:26,669 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-23 14:14:26,669 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-23 14:14:26,669 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-23 14:14:26,670 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-23 14:14:26,670 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-23 14:14:26,670 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-23 14:14:26,671 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-23 14:14:26,671 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-23 14:14:26,671 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-23 14:14:26,671 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-23 14:14:26,671 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-23 14:14:26,671 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-23 14:14:26,671 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-23 14:14:26,672 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-23 14:14:26,672 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-23 14:14:26,672 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-23 14:14:26,672 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-23 14:14:26,672 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-23 14:14:26,672 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-23 14:14:26,672 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-23 14:14:26,672 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-23 14:14:26,672 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-23 14:14:26,673 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-23 14:14:26,673 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-23 14:14:26,673 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-23 14:14:26,673 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-23 14:14:26,673 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-23 14:14:26,673 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-23 14:14:26,673 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-23 14:14:26,673 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-23 14:14:26,673 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-23 14:14:26,674 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-23 14:14:26,674 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-23 14:14:26,674 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-23 14:14:26,674 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-23 14:14:26,674 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-23 14:14:26,674 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-23 14:14:26,674 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-23 14:14:26,674 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-23 14:14:26,674 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-23 14:14:26,675 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-23 14:14:26,675 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-23 14:14:26,675 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-23 14:14:26,675 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-23 14:14:26,675 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-23 14:14:26,675 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-23 14:14:26,675 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-23 14:14:26,675 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-23 14:14:26,675 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-23 14:14:26,675 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-23 14:14:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-23 14:14:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-23 14:14:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-23 14:14:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-23 14:14:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-23 14:14:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 14:14:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-23 14:14:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-23 14:14:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-23 14:14:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-23 14:14:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-23 14:14:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-23 14:14:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-23 14:14:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-23 14:14:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-23 14:14:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-23 14:14:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-23 14:14:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-23 14:14:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-23 14:14:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-23 14:14:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-23 14:14:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-23 14:14:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-23 14:14:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-23 14:14:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-23 14:14:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-23 14:14:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-23 14:14:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-23 14:14:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-23 14:14:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-23 14:14:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-23 14:14:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-23 14:14:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-23 14:14:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-23 14:14:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-23 14:14:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-23 14:14:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-23 14:14:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-23 14:14:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-23 14:14:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-23 14:14:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-23 14:14:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-23 14:14:26,679 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-23 14:14:26,679 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-23 14:14:26,679 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-23 14:14:26,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-23 14:14:26,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-23 14:14:26,679 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 14:14:26,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:14:26,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 14:14:26,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 14:14:26,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 14:14:26,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 14:14:26,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:14:26,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 14:14:26,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:14:27,259 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:14:27,260 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 14:14:27,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:14:27 BoogieIcfgContainer [2018-11-23 14:14:27,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:14:27,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 14:14:27,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 14:14:27,263 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 14:14:27,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:14:26" (1/3) ... [2018-11-23 14:14:27,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d48269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:14:27, skipping insertion in model container [2018-11-23 14:14:27,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:14:26" (2/3) ... [2018-11-23 14:14:27,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d48269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:14:27, skipping insertion in model container [2018-11-23 14:14:27,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:14:27" (3/3) ... [2018-11-23 14:14:27,267 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-11-23 14:14:27,274 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 14:14:27,280 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-11-23 14:14:27,291 INFO L257 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2018-11-23 14:14:27,310 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:14:27,311 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 14:14:27,311 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 14:14:27,311 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 14:14:27,311 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:14:27,311 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:14:27,311 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 14:14:27,312 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:14:27,312 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 14:14:27,325 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-11-23 14:14:27,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 14:14:27,332 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:27,333 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:14:27,335 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION]=== [2018-11-23 14:14:27,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:27,339 INFO L82 PathProgramCache]: Analyzing trace with hash -76429676, now seen corresponding path program 1 times [2018-11-23 14:14:27,342 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 14:14:27,343 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 14:14:27,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:27,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:14:27,425 INFO L478 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 [2018-11-23 14:14:27,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:27,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:27,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 14:14:27,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:27,442 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:14:27,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:14:27,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:14:27,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:14:27,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:14:27,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:14:27,463 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 3 states. [2018-11-23 14:14:27,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:27,708 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-11-23 14:14:27,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:14:27,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 14:14:27,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:27,717 INFO L225 Difference]: With dead ends: 123 [2018-11-23 14:14:27,717 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 14:14:27,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:14:27,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 14:14:27,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 90. [2018-11-23 14:14:27,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 14:14:27,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2018-11-23 14:14:27,749 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 7 [2018-11-23 14:14:27,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:27,749 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2018-11-23 14:14:27,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:14:27,749 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2018-11-23 14:14:27,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 14:14:27,750 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:27,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:14:27,750 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION]=== [2018-11-23 14:14:27,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:27,750 INFO L82 PathProgramCache]: Analyzing trace with hash -76429675, now seen corresponding path program 1 times [2018-11-23 14:14:27,751 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 14:14:27,751 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 14:14:27,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:27,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:14:27,787 INFO L478 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 [2018-11-23 14:14:27,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:27,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:27,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 14:14:27,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:27,805 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:14:27,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:14:27,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:14:27,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:14:27,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:14:27,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:14:27,807 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand 3 states. [2018-11-23 14:14:28,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:28,052 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2018-11-23 14:14:28,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:14:28,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 14:14:28,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:28,055 INFO L225 Difference]: With dead ends: 115 [2018-11-23 14:14:28,055 INFO L226 Difference]: Without dead ends: 115 [2018-11-23 14:14:28,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:14:28,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-23 14:14:28,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 88. [2018-11-23 14:14:28,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 14:14:28,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-11-23 14:14:28,064 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 7 [2018-11-23 14:14:28,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:28,064 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-11-23 14:14:28,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:14:28,065 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-11-23 14:14:28,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 14:14:28,065 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:28,065 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:14:28,065 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION]=== [2018-11-23 14:14:28,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:28,069 INFO L82 PathProgramCache]: Analyzing trace with hash -919002280, now seen corresponding path program 1 times [2018-11-23 14:14:28,069 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 14:14:28,070 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 14:14:28,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:28,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:14:28,134 INFO L478 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 [2018-11-23 14:14:28,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:28,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:28,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 14:14:28,162 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:28,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:28,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-11-23 14:14:28,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:28,171 INFO L267 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. [2018-11-23 14:14:28,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:16 [2018-11-23 14:14:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:28,187 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:14:28,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:14:28,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:14:28,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 14:14:28,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 14:14:28,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:14:28,189 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 5 states. [2018-11-23 14:14:28,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:28,569 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2018-11-23 14:14:28,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 14:14:28,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 14:14:28,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:28,571 INFO L225 Difference]: With dead ends: 96 [2018-11-23 14:14:28,571 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 14:14:28,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 14:14:28,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 14:14:28,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 82. [2018-11-23 14:14:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 14:14:28,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-11-23 14:14:28,576 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 11 [2018-11-23 14:14:28,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:28,576 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-11-23 14:14:28,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 14:14:28,576 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-11-23 14:14:28,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 14:14:28,576 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:28,576 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:14:28,577 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION]=== [2018-11-23 14:14:28,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:28,577 INFO L82 PathProgramCache]: Analyzing trace with hash -919002279, now seen corresponding path program 1 times [2018-11-23 14:14:28,577 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 14:14:28,577 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 14:14:28,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:28,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:14:28,630 INFO L478 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 [2018-11-23 14:14:28,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:28,648 INFO L478 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 [2018-11-23 14:14:28,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:28,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:28,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-23 14:14:28,708 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:28,710 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:28,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 14:14:28,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:28,724 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-23 14:14:28,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:28,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:14:28,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2018-11-23 14:14:28,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:28,757 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:14:28,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:14:28,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:14:28,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 14:14:28,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 14:14:28,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:14:28,759 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 5 states. [2018-11-23 14:14:29,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:29,276 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-11-23 14:14:29,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 14:14:29,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 14:14:29,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:29,279 INFO L225 Difference]: With dead ends: 109 [2018-11-23 14:14:29,279 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 14:14:29,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 14:14:29,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 14:14:29,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 94. [2018-11-23 14:14:29,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-23 14:14:29,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2018-11-23 14:14:29,285 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 11 [2018-11-23 14:14:29,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:29,286 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2018-11-23 14:14:29,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 14:14:29,286 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2018-11-23 14:14:29,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 14:14:29,286 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:29,287 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:14:29,287 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION]=== [2018-11-23 14:14:29,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:29,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1875386623, now seen corresponding path program 1 times [2018-11-23 14:14:29,287 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 14:14:29,287 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 14:14:29,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:29,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:14:29,339 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-23 14:14:29,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:29,346 INFO L267 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. [2018-11-23 14:14:29,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-11-23 14:14:29,365 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:14:29,368 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:29,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:29,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:29,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:29,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-11-23 14:14:29,385 INFO L478 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 19 treesize of output 15 [2018-11-23 14:14:29,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 7 [2018-11-23 14:14:29,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:29,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:29,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:29,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2018-11-23 14:14:29,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:29,404 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:14:29,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:14:29,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 14:14:29,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 14:14:29,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 14:14:29,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 14:14:29,406 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 7 states. [2018-11-23 14:14:30,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:30,062 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2018-11-23 14:14:30,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 14:14:30,063 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-11-23 14:14:30,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:30,064 INFO L225 Difference]: With dead ends: 158 [2018-11-23 14:14:30,064 INFO L226 Difference]: Without dead ends: 158 [2018-11-23 14:14:30,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-11-23 14:14:30,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-23 14:14:30,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-11-23 14:14:30,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 14:14:30,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2018-11-23 14:14:30,070 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 14 [2018-11-23 14:14:30,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:30,070 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2018-11-23 14:14:30,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 14:14:30,071 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2018-11-23 14:14:30,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 14:14:30,071 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:30,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:14:30,072 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION]=== [2018-11-23 14:14:30,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:30,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1875386622, now seen corresponding path program 1 times [2018-11-23 14:14:30,072 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 14:14:30,072 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 14:14:30,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:30,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:14:30,128 INFO L478 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 [2018-11-23 14:14:30,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:30,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:30,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 14:14:30,145 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:14:30,148 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:30,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:30,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:30,162 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:14:30,164 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:30,164 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:30,167 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:30,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:30,173 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-11-23 14:14:30,184 INFO L478 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 11 [2018-11-23 14:14:30,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-23 14:14:30,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:30,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:30,199 INFO L478 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 19 treesize of output 15 [2018-11-23 14:14:30,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 7 [2018-11-23 14:14:30,202 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:30,203 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:30,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:30,207 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-11-23 14:14:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:30,224 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:14:30,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:14:30,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 14:14:30,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 14:14:30,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 14:14:30,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 14:14:30,226 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand 6 states. [2018-11-23 14:14:30,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:30,881 INFO L93 Difference]: Finished difference Result 163 states and 183 transitions. [2018-11-23 14:14:30,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 14:14:30,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 14:14:30,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:30,882 INFO L225 Difference]: With dead ends: 163 [2018-11-23 14:14:30,882 INFO L226 Difference]: Without dead ends: 163 [2018-11-23 14:14:30,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-23 14:14:30,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-23 14:14:30,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 86. [2018-11-23 14:14:30,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 14:14:30,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-11-23 14:14:30,885 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 14 [2018-11-23 14:14:30,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:30,885 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-11-23 14:14:30,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 14:14:30,886 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-11-23 14:14:30,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 14:14:30,886 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:30,886 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:14:30,886 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION]=== [2018-11-23 14:14:30,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:30,886 INFO L82 PathProgramCache]: Analyzing trace with hash -844299507, now seen corresponding path program 1 times [2018-11-23 14:14:30,886 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 14:14:30,887 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 14:14:30,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:30,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:14:30,942 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:14:30,945 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:30,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:30,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:30,974 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:14:30,977 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:30,977 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:30,982 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:30,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:30,990 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-23 14:14:31,006 INFO L478 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 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 14:14:31,021 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:31,024 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 14:14:31,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:31,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:31,048 INFO L478 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 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 14:14:31,051 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:31,054 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 14:14:31,054 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:31,057 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:31,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:31,062 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:18 [2018-11-23 14:14:31,073 INFO L478 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 11 [2018-11-23 14:14:31,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 [2018-11-23 14:14:31,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:31,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:31,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:31,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:21 [2018-11-23 14:14:31,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:31,106 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:14:31,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:14:31,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 14:14:31,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 14:14:31,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 14:14:31,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 14:14:31,109 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 6 states. [2018-11-23 14:14:31,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:31,512 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2018-11-23 14:14:31,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 14:14:31,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 14:14:31,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:31,513 INFO L225 Difference]: With dead ends: 123 [2018-11-23 14:14:31,513 INFO L226 Difference]: Without dead ends: 123 [2018-11-23 14:14:31,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 14:14:31,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-23 14:14:31,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 90. [2018-11-23 14:14:31,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 14:14:31,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2018-11-23 14:14:31,515 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 17 [2018-11-23 14:14:31,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:31,515 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2018-11-23 14:14:31,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 14:14:31,515 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2018-11-23 14:14:31,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:14:31,516 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:31,516 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:14:31,516 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION]=== [2018-11-23 14:14:31,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:31,516 INFO L82 PathProgramCache]: Analyzing trace with hash -324216102, now seen corresponding path program 1 times [2018-11-23 14:14:31,516 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 14:14:31,516 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 14:14:31,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:31,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:14:31,613 INFO L478 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 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 14:14:31,616 INFO L478 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 10 treesize of output 9 [2018-11-23 14:14:31,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:31,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:31,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:31,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-23 14:14:31,632 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-23 14:14:31,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:31,638 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 14:14:31,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:31,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:31,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:31,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:13 [2018-11-23 14:14:31,659 INFO L478 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 11 [2018-11-23 14:14:31,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-23 14:14:31,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:31,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:31,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:31,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 14:14:31,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:31,667 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:14:31,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:14:31,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 14:14:31,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 14:14:31,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 14:14:31,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 14:14:31,670 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 6 states. [2018-11-23 14:14:31,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:31,890 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2018-11-23 14:14:31,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 14:14:31,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 14:14:31,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:31,891 INFO L225 Difference]: With dead ends: 116 [2018-11-23 14:14:31,891 INFO L226 Difference]: Without dead ends: 116 [2018-11-23 14:14:31,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-23 14:14:31,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-23 14:14:31,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 93. [2018-11-23 14:14:31,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 14:14:31,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2018-11-23 14:14:31,894 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 20 [2018-11-23 14:14:31,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:31,895 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2018-11-23 14:14:31,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 14:14:31,895 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2018-11-23 14:14:31,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 14:14:31,895 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:31,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:14:31,896 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION]=== [2018-11-23 14:14:31,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:31,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1462395423, now seen corresponding path program 1 times [2018-11-23 14:14:31,896 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 14:14:31,896 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 14:14:31,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:31,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:14:31,994 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-23 14:14:31,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:32,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:32,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:14 [2018-11-23 14:14:32,013 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:14:32,015 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:32,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:32,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:32,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:32,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:18 [2018-11-23 14:14:32,055 INFO L478 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 19 treesize of output 15 [2018-11-23 14:14:32,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 7 [2018-11-23 14:14:32,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:32,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:32,066 INFO L267 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. [2018-11-23 14:14:32,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2018-11-23 14:14:32,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:32,083 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:14:32,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:14:32,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 14:14:32,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 14:14:32,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 14:14:32,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 14:14:32,085 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 8 states. [2018-11-23 14:14:32,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:32,623 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2018-11-23 14:14:32,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 14:14:32,623 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-23 14:14:32,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:32,623 INFO L225 Difference]: With dead ends: 119 [2018-11-23 14:14:32,623 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 14:14:32,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-11-23 14:14:32,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 14:14:32,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 97. [2018-11-23 14:14:32,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 14:14:32,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2018-11-23 14:14:32,627 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 21 [2018-11-23 14:14:32,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:32,627 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2018-11-23 14:14:32,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 14:14:32,627 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2018-11-23 14:14:32,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 14:14:32,628 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:32,628 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:14:32,628 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION]=== [2018-11-23 14:14:32,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:32,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1462395422, now seen corresponding path program 1 times [2018-11-23 14:14:32,628 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 14:14:32,629 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 14:14:32,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:32,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:14:32,705 INFO L478 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 [2018-11-23 14:14:32,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:32,721 INFO L478 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 [2018-11-23 14:14:32,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:32,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:32,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-23 14:14:32,742 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:32,742 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:32,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 14:14:32,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:32,752 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-23 14:14:32,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:32,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:32,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:23 [2018-11-23 14:14:32,780 INFO L478 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 11 treesize of output 8 [2018-11-23 14:14:32,788 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:32,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:32,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:32,814 INFO L478 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 11 treesize of output 8 [2018-11-23 14:14:32,817 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:32,817 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:32,819 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:32,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:32,831 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2018-11-23 14:14:32,883 INFO L478 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 11 [2018-11-23 14:14:32,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-23 14:14:32,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:32,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:32,901 INFO L478 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 25 treesize of output 19 [2018-11-23 14:14:32,903 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-23 14:14:32,904 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:32,907 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:32,914 INFO L267 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. [2018-11-23 14:14:32,914 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:20 [2018-11-23 14:14:32,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:32,956 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:14:32,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:14:32,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 14:14:32,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 14:14:32,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 14:14:32,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 14:14:32,958 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand 8 states. [2018-11-23 14:14:33,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:14:33,787 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2018-11-23 14:14:33,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 14:14:33,787 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-23 14:14:33,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:14:33,788 INFO L225 Difference]: With dead ends: 125 [2018-11-23 14:14:33,788 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 14:14:33,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-23 14:14:33,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 14:14:33,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 99. [2018-11-23 14:14:33,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 14:14:33,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2018-11-23 14:14:33,791 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 21 [2018-11-23 14:14:33,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:14:33,791 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2018-11-23 14:14:33,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 14:14:33,792 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2018-11-23 14:14:33,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 14:14:33,792 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:14:33,792 INFO L402 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] [2018-11-23 14:14:33,792 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION]=== [2018-11-23 14:14:33,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:14:33,793 INFO L82 PathProgramCache]: Analyzing trace with hash -591716716, now seen corresponding path program 1 times [2018-11-23 14:14:33,793 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 14:14:33,793 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 14:14:33,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:14:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:14:33,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:14:33,890 INFO L478 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 [2018-11-23 14:14:33,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:33,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:33,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 14:14:33,924 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:33,925 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:33,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-11-23 14:14:33,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:33,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:33,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:25 [2018-11-23 14:14:33,956 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:14:33,958 INFO L478 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 8 treesize of output 7 [2018-11-23 14:14:33,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:33,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:33,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:33,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:35 [2018-11-23 14:14:34,054 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:14:34,063 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-11-23 14:14:34,067 INFO L478 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 16 treesize of output 1 [2018-11-23 14:14:34,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:34,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:34,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:34,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:32 [2018-11-23 14:14:34,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-11-23 14:14:34,103 INFO L478 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 12 treesize of output 11 [2018-11-23 14:14:34,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:34,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:34,125 INFO L267 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. [2018-11-23 14:14:34,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-11-23 14:14:34,182 INFO L478 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 36 treesize of output 24 [2018-11-23 14:14:34,184 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-23 14:14:34,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:34,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-23 14:14:34,192 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:34,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:34,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:14:34,202 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:42, output treesize:16 [2018-11-23 14:14:34,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:14:34,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 14:14:34,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:14:34,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:14:34,397 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:14:34,400 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:14:34,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-11-23 14:14:34,426 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:40, output treesize:82 [2018-11-23 14:14:48,082 WARN L180 SmtUtils]: Spent 13.56 s on a formula simplification. DAG size of input: 49 DAG size of output: 27 [2018-11-23 14:14:54,152 WARN L180 SmtUtils]: Spent 6.02 s on a formula simplification that was a NOOP. DAG size: 27 [2018-11-23 14:15:00,237 WARN L180 SmtUtils]: Spent 6.02 s on a formula simplification that was a NOOP. DAG size: 32 [2018-11-23 14:15:00,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-11-23 14:15:00,285 INFO L478 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 9 treesize of output 8 [2018-11-23 14:15:00,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:15:00,321 INFO L478 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 19 treesize of output 17 [2018-11-23 14:15:00,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-23 14:15:00,325 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:15:00,331 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:15:00,343 INFO L478 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 18 treesize of output 22 [2018-11-23 14:15:00,346 INFO L478 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 17 treesize of output 15 [2018-11-23 14:15:00,347 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:15:00,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 9 [2018-11-23 14:15:00,368 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 14:15:00,390 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-11-23 14:15:00,391 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 14:15:00,407 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 14:15:00,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 10 xjuncts. [2018-11-23 14:15:00,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 10 xjuncts. [2018-11-23 14:15:00,549 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:111 [2018-11-23 14:15:00,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:15:00,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:15:00,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2018-11-23 14:15:00,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 14:15:00,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 14:15:00,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-11-23 14:15:00,763 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand 23 states. [2018-11-23 14:15:41,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:15:41,384 INFO L93 Difference]: Finished difference Result 159 states and 179 transitions. [2018-11-23 14:15:41,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 14:15:41,385 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-11-23 14:15:41,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:15:41,386 INFO L225 Difference]: With dead ends: 159 [2018-11-23 14:15:41,386 INFO L226 Difference]: Without dead ends: 159 [2018-11-23 14:15:41,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 34.0s TimeCoverageRelationStatistics Valid=391, Invalid=1499, Unknown=2, NotChecked=0, Total=1892 [2018-11-23 14:15:41,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-23 14:15:41,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 112. [2018-11-23 14:15:41,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 14:15:41,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2018-11-23 14:15:41,390 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 23 [2018-11-23 14:15:41,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:15:41,390 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2018-11-23 14:15:41,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 14:15:41,390 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2018-11-23 14:15:41,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 14:15:41,391 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:15:41,391 INFO L402 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] [2018-11-23 14:15:41,391 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION]=== [2018-11-23 14:15:41,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:15:41,392 INFO L82 PathProgramCache]: Analyzing trace with hash -591716715, now seen corresponding path program 1 times [2018-11-23 14:15:41,392 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 14:15:41,392 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 14:15:41,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:15:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:15:41,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:15:41,496 INFO L478 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 [2018-11-23 14:15:41,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:15:41,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:15:41,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 14:15:41,523 INFO L478 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 [2018-11-23 14:15:41,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:15:41,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:15:41,542 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:15:41,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 14:15:41,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:15:41,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:15:41,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:22 [2018-11-23 14:15:41,587 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:15:41,590 INFO L478 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 8 treesize of output 7 [2018-11-23 14:15:41,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:15:41,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:15:41,625 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:15:41,629 INFO L478 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 8 treesize of output 7 [2018-11-23 14:15:41,629 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:15:41,633 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:15:41,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:15:41,655 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-11-23 14:15:41,742 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:15:41,759 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2018-11-23 14:15:41,764 INFO L478 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 20 treesize of output 19 [2018-11-23 14:15:41,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:15:41,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:15:41,802 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:15:41,811 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-11-23 14:15:41,814 INFO L478 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 16 treesize of output 1 [2018-11-23 14:15:41,814 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:15:41,823 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:15:41,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:15:41,833 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:33 [2018-11-23 14:15:41,859 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-23 14:15:41,862 INFO L478 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 12 treesize of output 11 [2018-11-23 14:15:41,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:15:41,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:15:41,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2018-11-23 14:15:41,902 INFO L478 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 12 treesize of output 11 [2018-11-23 14:15:41,903 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:15:41,911 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:15:41,922 INFO L267 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. [2018-11-23 14:15:41,922 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:68, output treesize:52 [2018-11-23 14:15:42,011 INFO L478 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 24 [2018-11-23 14:15:42,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-23 14:15:42,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:15:42,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-23 14:15:42,022 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:15:42,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:15:42,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-11-23 14:15:42,041 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-11-23 14:15:42,041 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 14:15:42,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-23 14:15:42,059 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:15:42,064 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:15:42,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:15:42,071 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:63, output treesize:11 [2018-11-23 14:15:42,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:15:42,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 14:15:44,633 WARN L180 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-11-23 14:15:44,634 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:15:44,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:15:44,652 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:15:44,669 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:15:45,946 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:15:45,969 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:15:45,970 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:15:45,990 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:15:46,793 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 14:15:46,805 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:15:46,805 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 14:15:46,815 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:15:47,607 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:15:47,632 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:15:47,633 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:15:47,660 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:15:47,661 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 14:15:47,677 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:15:48,389 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:15:48,404 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:15:48,405 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:15:48,424 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:15:48,425 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 14:15:48,432 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:15:48,980 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 14:15:48,990 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:15:48,991 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 14:15:49,001 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:15:49,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: 14 dim-0 vars, and 7 xjuncts. [2018-11-23 14:15:49,511 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 9 variables, input treesize:199, output treesize:205 [2018-11-23 14:16:10,952 WARN L180 SmtUtils]: Spent 18.87 s on a formula simplification. DAG size of input: 95 DAG size of output: 57 [2018-11-23 14:16:19,716 WARN L180 SmtUtils]: Spent 8.17 s on a formula simplification that was a NOOP. DAG size: 57 [2018-11-23 14:16:28,452 WARN L180 SmtUtils]: Spent 8.17 s on a formula simplification that was a NOOP. DAG size: 60 [2018-11-23 14:16:28,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-11-23 14:16:28,503 INFO L478 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 9 treesize of output 8 [2018-11-23 14:16:28,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:28,537 INFO L478 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 19 treesize of output 17 [2018-11-23 14:16:28,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-23 14:16:28,541 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:28,547 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:28,559 INFO L478 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 16 treesize of output 20 [2018-11-23 14:16:28,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 9 [2018-11-23 14:16:28,562 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:28,580 INFO L478 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 9 treesize of output 7 [2018-11-23 14:16:28,581 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:28,600 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2018-11-23 14:16:28,600 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-23 14:16:28,608 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 14:16:28,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-11-23 14:16:29,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 64 [2018-11-23 14:16:29,595 INFO L478 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 9 treesize of output 8 [2018-11-23 14:16:29,595 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:29,694 INFO L478 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 19 treesize of output 17 [2018-11-23 14:16:29,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-23 14:16:29,701 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:29,713 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:29,745 INFO L478 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 50 treesize of output 54 [2018-11-23 14:16:29,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 49 treesize of output 43 [2018-11-23 14:16:29,751 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:29,826 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 46 [2018-11-23 14:16:29,827 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 14:16:29,883 INFO L478 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 43 treesize of output 41 [2018-11-23 14:16:29,883 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:16:29,952 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 14:16:30,109 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 10 xjuncts. [2018-11-23 14:16:31,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 46 [2018-11-23 14:16:31,210 INFO L478 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 9 treesize of output 8 [2018-11-23 14:16:31,210 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:31,268 INFO L478 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 19 treesize of output 17 [2018-11-23 14:16:31,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-23 14:16:31,274 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:31,284 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:31,299 INFO L478 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 24 [2018-11-23 14:16:31,305 INFO L478 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 19 treesize of output 15 [2018-11-23 14:16:31,306 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:31,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 10 treesize of output 3 [2018-11-23 14:16:31,341 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:31,372 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2018-11-23 14:16:31,374 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-11-23 14:16:31,390 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 14:16:31,436 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-11-23 14:16:32,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2018-11-23 14:16:32,340 INFO L478 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 9 treesize of output 8 [2018-11-23 14:16:32,341 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:32,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-23 14:16:32,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-23 14:16:32,368 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:32,382 INFO L478 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 9 treesize of output 7 [2018-11-23 14:16:32,383 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:16:32,389 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:16:32,408 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:16:32,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2018-11-23 14:16:32,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 8 [2018-11-23 14:16:32,479 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:32,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2018-11-23 14:16:32,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-11-23 14:16:32,522 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:16:32,548 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 14:16:32,548 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:32,567 INFO L478 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 11 [2018-11-23 14:16:32,567 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:16:32,583 INFO L267 ElimStorePlain]: Start of recursive call 33: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 14:16:32,616 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 14:16:32,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-11-23 14:16:32,671 INFO L478 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 9 treesize of output 8 [2018-11-23 14:16:32,671 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:32,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2018-11-23 14:16:32,727 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2018-11-23 14:16:32,728 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 14:16:32,769 INFO L478 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 19 treesize of output 17 [2018-11-23 14:16:32,770 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:16:32,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 17 treesize of output 11 [2018-11-23 14:16:32,817 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:32,864 INFO L267 ElimStorePlain]: Start of recursive call 39: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 14:16:32,927 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 14:16:32,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2018-11-23 14:16:33,001 INFO L478 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 9 treesize of output 8 [2018-11-23 14:16:33,002 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:33,037 INFO L478 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 20 treesize of output 24 [2018-11-23 14:16:33,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 13 [2018-11-23 14:16:33,042 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:33,074 INFO L478 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 11 [2018-11-23 14:16:33,075 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:16:33,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2018-11-23 14:16:33,117 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 14:16:33,145 INFO L267 ElimStorePlain]: Start of recursive call 45: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 14:16:33,183 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 14:16:33,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 58 [2018-11-23 14:16:33,297 INFO L478 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 9 treesize of output 8 [2018-11-23 14:16:33,297 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:33,407 INFO L478 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 31 treesize of output 33 [2018-11-23 14:16:33,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-11-23 14:16:33,417 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:16:33,468 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-11-23 14:16:33,468 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:33,515 INFO L478 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 22 treesize of output 18 [2018-11-23 14:16:33,515 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:16:33,550 INFO L267 ElimStorePlain]: Start of recursive call 51: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 14:16:33,558 INFO L478 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 19 treesize of output 17 [2018-11-23 14:16:33,562 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 14:16:33,563 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:33,574 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:33,673 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-11-23 14:16:33,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-11-23 14:16:33,761 INFO L478 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 9 treesize of output 8 [2018-11-23 14:16:33,761 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:33,800 INFO L478 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 20 treesize of output 24 [2018-11-23 14:16:33,807 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 14:16:33,807 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:33,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-11-23 14:16:33,834 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:16:33,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-11-23 14:16:33,863 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:16:33,884 INFO L267 ElimStorePlain]: Start of recursive call 59: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 14:16:33,914 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 14:16:33,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 58 [2018-11-23 14:16:34,017 INFO L478 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 9 treesize of output 8 [2018-11-23 14:16:34,017 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:34,096 INFO L478 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 19 treesize of output 17 [2018-11-23 14:16:34,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-23 14:16:34,105 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:34,115 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:34,126 INFO L478 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 31 treesize of output 28 [2018-11-23 14:16:34,134 INFO L478 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 19 treesize of output 15 [2018-11-23 14:16:34,135 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:16:34,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-23 14:16:34,165 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:34,177 INFO L267 ElimStorePlain]: Start of recursive call 67: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:16:34,248 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-23 14:16:34,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2018-11-23 14:16:34,300 INFO L478 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 9 treesize of output 8 [2018-11-23 14:16:34,300 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:34,319 INFO L478 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 8 treesize of output 6 [2018-11-23 14:16:34,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-23 14:16:34,323 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:34,325 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:34,337 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:34,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-11-23 14:16:34,416 INFO L478 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 9 treesize of output 8 [2018-11-23 14:16:34,416 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:34,447 INFO L478 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 20 treesize of output 19 [2018-11-23 14:16:34,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 1 [2018-11-23 14:16:34,453 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:34,465 INFO L478 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 9 treesize of output 7 [2018-11-23 14:16:34,465 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:16:34,470 INFO L267 ElimStorePlain]: Start of recursive call 76: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:16:34,485 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:16:36,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 48 dim-0 vars, and 32 xjuncts. [2018-11-23 14:16:36,886 INFO L202 ElimStorePlain]: Needed 78 recursive calls to eliminate 11 variables, input treesize:188, output treesize:442 [2018-11-23 14:16:37,481 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 19 [2018-11-23 14:16:39,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:16:39,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:16:39,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2018-11-23 14:16:39,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 14:16:39,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 14:16:39,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=440, Unknown=1, NotChecked=0, Total=506 [2018-11-23 14:16:39,572 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand 23 states. [2018-11-23 14:16:43,628 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2018-11-23 14:16:50,640 WARN L180 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2018-11-23 14:16:56,384 WARN L180 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2018-11-23 14:16:56,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:16:56,741 INFO L93 Difference]: Finished difference Result 162 states and 184 transitions. [2018-11-23 14:16:56,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 14:16:56,741 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-11-23 14:16:56,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:16:56,742 INFO L225 Difference]: With dead ends: 162 [2018-11-23 14:16:56,742 INFO L226 Difference]: Without dead ends: 162 [2018-11-23 14:16:56,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 45.1s TimeCoverageRelationStatistics Valid=298, Invalid=1423, Unknown=1, NotChecked=0, Total=1722 [2018-11-23 14:16:56,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-23 14:16:56,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 106. [2018-11-23 14:16:56,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 14:16:56,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2018-11-23 14:16:56,745 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 123 transitions. Word has length 23 [2018-11-23 14:16:56,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:16:56,745 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 123 transitions. [2018-11-23 14:16:56,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 14:16:56,745 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2018-11-23 14:16:56,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 14:16:56,746 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:16:56,746 INFO L402 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] [2018-11-23 14:16:56,746 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION]=== [2018-11-23 14:16:56,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:16:56,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1925436861, now seen corresponding path program 1 times [2018-11-23 14:16:56,747 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 14:16:56,747 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 14:16:56,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:16:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:16:56,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:16:56,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:16:56,790 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:16:56,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:16:56,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:16:56,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:16:56,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:16:56,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:16:56,792 INFO L87 Difference]: Start difference. First operand 106 states and 123 transitions. Second operand 4 states. [2018-11-23 14:16:56,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:16:56,968 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2018-11-23 14:16:56,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:16:56,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-23 14:16:56,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:16:56,969 INFO L225 Difference]: With dead ends: 123 [2018-11-23 14:16:56,969 INFO L226 Difference]: Without dead ends: 123 [2018-11-23 14:16:56,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:16:56,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-23 14:16:56,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 106. [2018-11-23 14:16:56,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 14:16:56,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 122 transitions. [2018-11-23 14:16:56,977 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 122 transitions. Word has length 24 [2018-11-23 14:16:56,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:16:56,977 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 122 transitions. [2018-11-23 14:16:56,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:16:56,977 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 122 transitions. [2018-11-23 14:16:56,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 14:16:56,978 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:16:56,978 INFO L402 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] [2018-11-23 14:16:56,979 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION]=== [2018-11-23 14:16:56,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:16:56,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1951540654, now seen corresponding path program 1 times [2018-11-23 14:16:56,979 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 14:16:56,979 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 14:16:56,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:16:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:16:57,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:16:57,066 INFO L478 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 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 14:16:57,068 INFO L478 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 10 treesize of output 9 [2018-11-23 14:16:57,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:57,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:57,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:57,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-23 14:16:57,095 INFO L478 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 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-23 14:16:57,097 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:16:57,099 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 14:16:57,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:57,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:57,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:57,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:13 [2018-11-23 14:16:57,123 INFO L478 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 11 [2018-11-23 14:16:57,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-23 14:16:57,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:57,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:57,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:57,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 14:16:57,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:16:57,132 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:16:57,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:16:57,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 14:16:57,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 14:16:57,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 14:16:57,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 14:16:57,134 INFO L87 Difference]: Start difference. First operand 106 states and 122 transitions. Second operand 8 states. [2018-11-23 14:16:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:16:57,667 INFO L93 Difference]: Finished difference Result 154 states and 174 transitions. [2018-11-23 14:16:57,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 14:16:57,667 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-23 14:16:57,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:16:57,668 INFO L225 Difference]: With dead ends: 154 [2018-11-23 14:16:57,668 INFO L226 Difference]: Without dead ends: 154 [2018-11-23 14:16:57,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-23 14:16:57,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-23 14:16:57,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 117. [2018-11-23 14:16:57,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-23 14:16:57,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 135 transitions. [2018-11-23 14:16:57,670 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 135 transitions. Word has length 24 [2018-11-23 14:16:57,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:16:57,670 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 135 transitions. [2018-11-23 14:16:57,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 14:16:57,671 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2018-11-23 14:16:57,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 14:16:57,671 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:16:57,671 INFO L402 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] [2018-11-23 14:16:57,671 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION]=== [2018-11-23 14:16:57,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:16:57,672 INFO L82 PathProgramCache]: Analyzing trace with hash 366587277, now seen corresponding path program 1 times [2018-11-23 14:16:57,672 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 14:16:57,672 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 14:16:57,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:16:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:16:57,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:16:57,781 INFO L478 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 11 [2018-11-23 14:16:57,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-23 14:16:57,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:57,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:57,796 INFO L478 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 11 [2018-11-23 14:16:57,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-23 14:16:57,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:57,799 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:57,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:57,807 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:16 [2018-11-23 14:16:57,844 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:16:57,846 INFO L478 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 8 treesize of output 7 [2018-11-23 14:16:57,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:57,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:57,860 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:16:57,862 INFO L478 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 8 treesize of output 7 [2018-11-23 14:16:57,862 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:57,864 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:57,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:57,870 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-23 14:16:57,896 INFO L478 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 11 [2018-11-23 14:16:57,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-23 14:16:57,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:57,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:57,904 INFO L478 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 11 [2018-11-23 14:16:57,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-23 14:16:57,906 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:57,907 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:57,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:57,909 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 14:16:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:16:57,928 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:16:57,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:16:57,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 14:16:57,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 14:16:57,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 14:16:57,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-23 14:16:57,935 INFO L87 Difference]: Start difference. First operand 117 states and 135 transitions. Second operand 12 states. [2018-11-23 14:16:58,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:16:58,852 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2018-11-23 14:16:58,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 14:16:58,853 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-11-23 14:16:58,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:16:58,853 INFO L225 Difference]: With dead ends: 156 [2018-11-23 14:16:58,853 INFO L226 Difference]: Without dead ends: 156 [2018-11-23 14:16:58,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2018-11-23 14:16:58,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-23 14:16:58,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2018-11-23 14:16:58,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-23 14:16:58,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 146 transitions. [2018-11-23 14:16:58,857 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 146 transitions. Word has length 25 [2018-11-23 14:16:58,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:16:58,857 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 146 transitions. [2018-11-23 14:16:58,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 14:16:58,857 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 146 transitions. [2018-11-23 14:16:58,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 14:16:58,857 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:16:58,858 INFO L402 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] [2018-11-23 14:16:58,858 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION]=== [2018-11-23 14:16:58,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:16:58,858 INFO L82 PathProgramCache]: Analyzing trace with hash 57160690, now seen corresponding path program 1 times [2018-11-23 14:16:58,858 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 14:16:58,858 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 14:16:58,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:16:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:16:58,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:16:58,937 INFO L478 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 [2018-11-23 14:16:58,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:58,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:58,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 14:16:58,950 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:16:58,953 INFO L478 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 8 treesize of output 7 [2018-11-23 14:16:58,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:58,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:58,965 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:16:58,967 INFO L478 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 8 treesize of output 7 [2018-11-23 14:16:58,967 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:58,969 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:58,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:58,975 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2018-11-23 14:16:58,991 INFO L478 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 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 14:16:58,995 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:16:58,998 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 14:16:58,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,023 INFO L478 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 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 14:16:59,026 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:16:59,028 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 14:16:59,028 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,032 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,037 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:63, output treesize:25 [2018-11-23 14:16:59,040 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:16:59,041 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:16:59,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 14:16:59,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:25 [2018-11-23 14:16:59,081 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-23 14:16:59,084 INFO L478 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 16 treesize of output 1 [2018-11-23 14:16:59,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,116 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-23 14:16:59,118 INFO L478 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 16 treesize of output 1 [2018-11-23 14:16:59,118 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,122 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,130 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:63, output treesize:25 [2018-11-23 14:16:59,140 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 14:16:59,144 INFO L478 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 8 treesize of output 7 [2018-11-23 14:16:59,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,188 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 14:16:59,191 INFO L478 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 8 treesize of output 7 [2018-11-23 14:16:59,191 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,197 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,209 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:41 [2018-11-23 14:16:59,323 INFO L478 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 49 treesize of output 39 [2018-11-23 14:16:59,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 26 treesize of output 17 [2018-11-23 14:16:59,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-23 14:16:59,336 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,350 INFO L478 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 31 treesize of output 22 [2018-11-23 14:16:59,352 INFO L478 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 6 treesize of output 4 [2018-11-23 14:16:59,353 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-23 14:16:59,357 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,358 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,361 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:68, output treesize:7 [2018-11-23 14:16:59,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:16:59,393 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 14:16:59,746 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-11-23 14:16:59,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,762 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,780 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,781 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,798 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,798 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 14:16:59,819 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:00,075 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:00,082 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:00,083 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:00,093 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:00,094 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:00,104 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:00,341 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:00,355 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:00,355 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:00,370 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:00,370 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:00,384 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:00,526 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:00,535 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:00,535 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:00,541 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:00,541 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:00,552 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:00,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-11-23 14:17:00,652 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 4 variables, input treesize:113, output treesize:109 [2018-11-23 14:17:00,908 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-23 14:17:17,168 WARN L180 SmtUtils]: Spent 16.13 s on a formula simplification that was a NOOP. DAG size: 72 [2018-11-23 14:17:18,496 WARN L180 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 148 DAG size of output: 134 [2018-11-23 14:17:18,497 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:18,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:19,549 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:19,560 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:20,493 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:20,497 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:21,327 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:21,336 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:22,045 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:22,063 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:22,064 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:22,080 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:22,081 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:22,099 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:22,764 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:22,772 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:22,773 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:22,785 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:22,785 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:22,795 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:23,341 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:23,357 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:23,803 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:23,814 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:24,184 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:24,200 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:24,201 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:24,233 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:24,234 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:24,254 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:24,455 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:24,463 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:24,463 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:24,471 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:24,471 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:24,478 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:24,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 10 dim-2 vars, End of recursive call: 12 dim-0 vars, and 8 xjuncts. [2018-11-23 14:17:24,572 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 18 variables, input treesize:315, output treesize:170 [2018-11-23 14:17:26,956 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 70 [2018-11-23 14:17:26,962 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 14:17:26,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:27,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 14:17:27,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 12 variables, input treesize:126, output treesize:26 [2018-11-23 14:17:27,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:17:27,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:17:27,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 20 [2018-11-23 14:17:27,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 14:17:27,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 14:17:27,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=323, Unknown=5, NotChecked=0, Total=380 [2018-11-23 14:17:27,072 INFO L87 Difference]: Start difference. First operand 128 states and 146 transitions. Second operand 20 states. [2018-11-23 14:17:29,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:29,224 INFO L93 Difference]: Finished difference Result 166 states and 186 transitions. [2018-11-23 14:17:29,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 14:17:29,225 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2018-11-23 14:17:29,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:29,225 INFO L225 Difference]: With dead ends: 166 [2018-11-23 14:17:29,225 INFO L226 Difference]: Without dead ends: 166 [2018-11-23 14:17:29,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=129, Invalid=736, Unknown=5, NotChecked=0, Total=870 [2018-11-23 14:17:29,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-23 14:17:29,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 141. [2018-11-23 14:17:29,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-23 14:17:29,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 160 transitions. [2018-11-23 14:17:29,228 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 160 transitions. Word has length 26 [2018-11-23 14:17:29,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:29,229 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 160 transitions. [2018-11-23 14:17:29,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 14:17:29,229 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2018-11-23 14:17:29,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 14:17:29,229 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:29,229 INFO L402 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] [2018-11-23 14:17:29,230 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION]=== [2018-11-23 14:17:29,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:29,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1946186724, now seen corresponding path program 1 times [2018-11-23 14:17:29,230 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 14:17:29,230 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 14:17:29,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:29,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:29,323 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:17:29,325 INFO L478 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 8 treesize of output 7 [2018-11-23 14:17:29,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:29,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:29,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:29,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-23 14:17:29,352 INFO L478 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 12 [2018-11-23 14:17:29,353 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-23 14:17:29,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:29,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:29,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:29,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-23 14:17:29,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 14:17:29,367 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:17:29,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:17:29,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 14:17:29,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 14:17:29,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 14:17:29,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 14:17:29,369 INFO L87 Difference]: Start difference. First operand 141 states and 160 transitions. Second operand 8 states. [2018-11-23 14:17:29,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:29,956 INFO L93 Difference]: Finished difference Result 169 states and 187 transitions. [2018-11-23 14:17:29,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 14:17:29,956 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-23 14:17:29,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:29,957 INFO L225 Difference]: With dead ends: 169 [2018-11-23 14:17:29,957 INFO L226 Difference]: Without dead ends: 169 [2018-11-23 14:17:29,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2018-11-23 14:17:29,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-23 14:17:29,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 141. [2018-11-23 14:17:29,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-23 14:17:29,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 158 transitions. [2018-11-23 14:17:29,960 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 158 transitions. Word has length 28 [2018-11-23 14:17:29,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:29,960 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 158 transitions. [2018-11-23 14:17:29,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 14:17:29,960 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 158 transitions. [2018-11-23 14:17:29,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 14:17:29,961 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:29,961 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:29,961 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr42ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION]=== [2018-11-23 14:17:29,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:29,962 INFO L82 PathProgramCache]: Analyzing trace with hash 263124089, now seen corresponding path program 2 times [2018-11-23 14:17:29,962 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 14:17:29,962 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6ecd4c7-96e3-4a2e-b954-aea9109e41ad/bin-2019/uautomizer/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 14:17:29,974 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 14:17:30,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 14:17:30,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 14:17:30,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:30,062 INFO L478 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 [2018-11-23 14:17:30,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:30,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:30,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 14:17:30,091 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:17:30,092 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:17:30,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 14:17:30,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:30,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:30,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2018-11-23 14:17:30,122 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:17:30,124 INFO L478 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 8 treesize of output 7 [2018-11-23 14:17:30,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:30,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:30,148 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:17:30,150 INFO L478 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 8 treesize of output 7 [2018-11-23 14:17:30,150 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:30,153 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:30,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:30,165 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-11-23 14:17:30,231 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:17:30,247 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-11-23 14:17:30,251 INFO L478 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 16 treesize of output 1 [2018-11-23 14:17:30,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:30,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:30,289 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 39 [2018-11-23 14:17:30,291 INFO L478 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 20 treesize of output 19 [2018-11-23 14:17:30,292 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:30,298 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:30,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:30,308 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:29 [2018-11-23 14:17:30,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-11-23 14:17:30,337 INFO L478 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 16 treesize of output 15 [2018-11-23 14:17:30,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:30,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:30,367 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-11-23 14:17:30,369 INFO L478 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 16 treesize of output 15 [2018-11-23 14:17:30,369 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:30,377 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:30,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:30,386 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:49 [2018-11-23 14:17:30,510 INFO L478 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 68 treesize of output 54 [2018-11-23 14:17:30,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 46 treesize of output 33 [2018-11-23 14:17:30,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:30,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-23 14:17:30,523 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:30,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:30,539 INFO L478 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 31 treesize of output 22 [2018-11-23 14:17:30,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 3 [2018-11-23 14:17:30,541 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:30,546 INFO L478 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 6 treesize of output 4 [2018-11-23 14:17:30,546 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:30,547 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:30,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:30,550 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:76, output treesize:7 [2018-11-23 14:17:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:17:30,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 14:17:31,417 WARN L180 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2018-11-23 14:17:31,418 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:31,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:31,455 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:31,497 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:31,928 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:31,965 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:31,966 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:32,014 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:32,227 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:32,258 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:32,259 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:32,283 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:32,597 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:32,622 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:32,622 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:32,643 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:17:32,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-11-23 14:17:32,857 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 4 variables, input treesize:161, output treesize:289 [2018-11-23 14:17:35,168 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-11-23 14:17:35,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 113 [2018-11-23 14:17:35,907 INFO L478 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 9 treesize of output 8 [2018-11-23 14:17:35,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:36,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 90 [2018-11-23 14:17:36,205 INFO L478 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 2 case distinctions, treesize of input 75 treesize of output 85 [2018-11-23 14:17:36,229 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:17:36,240 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:17:36,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 100 [2018-11-23 14:17:36,273 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-23 14:17:36,450 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:17:36,450 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:17:36,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 95 [2018-11-23 14:17:36,451 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:36,630 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 14:17:36,909 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 79 [2018-11-23 14:17:36,914 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:17:36,915 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:17:36,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 33 [2018-11-23 14:17:36,915 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:36,961 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:17:37,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 92 [2018-11-23 14:17:37,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 82 treesize of output 76 [2018-11-23 14:17:37,335 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:37,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 76 treesize of output 70 [2018-11-23 14:17:37,587 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:37,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 57 [2018-11-23 14:17:37,851 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:38,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 79 treesize of output 73 [2018-11-23 14:17:38,107 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:38,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 66 [2018-11-23 14:17:38,434 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:38,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 76 treesize of output 87 [2018-11-23 14:17:38,754 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-11-23 14:17:39,053 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 49 [2018-11-23 14:17:39,054 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:39,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 69 [2018-11-23 14:17:39,316 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 4 xjuncts. [2018-11-23 14:17:39,457 INFO L267 ElimStorePlain]: Start of recursive call 10: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 14:17:40,143 INFO L478 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 91 [2018-11-23 14:17:40,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 73 treesize of output 67 [2018-11-23 14:17:40,150 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 14:17:40,971 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 14:17:40,971 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: nested self-update not yet implemented: (store v_prenex_104 (bvadd |main_#t~malloc2.offset| (_ bv4 32)) v_DerPreprocessor_106) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:219) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:208) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.convert(DerPreprocessor.java:191) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:211) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 14:17:40,974 INFO L168 Benchmark]: Toolchain (without parser) took 194792.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.2 MB). Free memory was 943.3 MB in the beginning and 801.5 MB in the end (delta: 141.7 MB). Peak memory consumption was 360.9 MB. Max. memory is 11.5 GB. [2018-11-23 14:17:40,975 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:17:40,975 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.62 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 921.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-23 14:17:40,975 INFO L168 Benchmark]: Boogie Preprocessor took 87.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 921.8 MB in the beginning and 1.1 GB in the end (delta: -185.7 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-11-23 14:17:40,976 INFO L168 Benchmark]: RCFGBuilder took 628.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.4 MB). Peak memory consumption was 59.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:17:40,976 INFO L168 Benchmark]: TraceAbstraction took 193712.96 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 99.1 MB). Free memory was 1.0 GB in the beginning and 801.5 MB in the end (delta: 246.6 MB). Peak memory consumption was 345.6 MB. Max. memory is 11.5 GB. [2018-11-23 14:17:40,977 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 360.62 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 921.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 87.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 921.8 MB in the beginning and 1.1 GB in the end (delta: -185.7 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 628.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.4 MB). Peak memory consumption was 59.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 193712.96 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 99.1 MB). Free memory was 1.0 GB in the beginning and 801.5 MB in the end (delta: 246.6 MB). Peak memory consumption was 345.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: nested self-update not yet implemented: (store v_prenex_104 (bvadd |main_#t~malloc2.offset| (_ bv4 32)) v_DerPreprocessor_106) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: nested self-update not yet implemented: (store v_prenex_104 (bvadd |main_#t~malloc2.offset| (_ bv4 32)) v_DerPreprocessor_106): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...