./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/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 b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/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 b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 17:39:32,564 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 17:39:32,565 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 17:39:32,571 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 17:39:32,571 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 17:39:32,572 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 17:39:32,573 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 17:39:32,573 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 17:39:32,574 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 17:39:32,575 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 17:39:32,575 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 17:39:32,575 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 17:39:32,576 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 17:39:32,576 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 17:39:32,577 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 17:39:32,577 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 17:39:32,578 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 17:39:32,578 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 17:39:32,579 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 17:39:32,580 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 17:39:32,581 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 17:39:32,581 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 17:39:32,582 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 17:39:32,582 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 17:39:32,583 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 17:39:32,583 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 17:39:32,584 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 17:39:32,584 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 17:39:32,584 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 17:39:32,585 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 17:39:32,585 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 17:39:32,586 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 17:39:32,586 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 17:39:32,586 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 17:39:32,586 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 17:39:32,587 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 17:39:32,587 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-01 17:39:32,594 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 17:39:32,594 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 17:39:32,594 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 17:39:32,595 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 17:39:32,595 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 17:39:32,595 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 17:39:32,595 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 17:39:32,595 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 17:39:32,596 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 17:39:32,596 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 17:39:32,596 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 17:39:32,596 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 17:39:32,596 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 17:39:32,596 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-01 17:39:32,596 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-01 17:39:32,596 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-01 17:39:32,597 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 17:39:32,597 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 17:39:32,597 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 17:39:32,597 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 17:39:32,597 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 17:39:32,597 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 17:39:32,597 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 17:39:32,597 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 17:39:32,598 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 17:39:32,598 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 17:39:32,598 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 17:39:32,598 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 17:39:32,598 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_c4dd2371-baed-47b9-9379-641e42802172/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 -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2018-12-01 17:39:32,615 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 17:39:32,622 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 17:39:32,624 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 17:39:32,625 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 17:39:32,625 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 17:39:32,626 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-12-01 17:39:32,660 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/data/ef70cbd5b/c6f3894fc51a454f9559a3d9426317c3/FLAGbf5e19a7c [2018-12-01 17:39:33,110 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 17:39:33,110 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-12-01 17:39:33,116 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/data/ef70cbd5b/c6f3894fc51a454f9559a3d9426317c3/FLAGbf5e19a7c [2018-12-01 17:39:33,124 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/data/ef70cbd5b/c6f3894fc51a454f9559a3d9426317c3 [2018-12-01 17:39:33,126 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 17:39:33,127 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-01 17:39:33,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 17:39:33,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 17:39:33,130 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 17:39:33,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:39:33" (1/1) ... [2018-12-01 17:39:33,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a04c23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:33, skipping insertion in model container [2018-12-01 17:39:33,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:39:33" (1/1) ... [2018-12-01 17:39:33,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 17:39:33,157 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 17:39:33,328 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 17:39:33,370 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 17:39:33,400 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 17:39:33,427 INFO L195 MainTranslator]: Completed translation [2018-12-01 17:39:33,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:33 WrapperNode [2018-12-01 17:39:33,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 17:39:33,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 17:39:33,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 17:39:33,428 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 17:39:33,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:33" (1/1) ... [2018-12-01 17:39:33,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:33" (1/1) ... [2018-12-01 17:39:33,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:33" (1/1) ... [2018-12-01 17:39:33,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:33" (1/1) ... [2018-12-01 17:39:33,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:33" (1/1) ... [2018-12-01 17:39:33,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:33" (1/1) ... [2018-12-01 17:39:33,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:33" (1/1) ... [2018-12-01 17:39:33,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 17:39:33,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 17:39:33,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 17:39:33,471 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 17:39:33,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/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-12-01 17:39:33,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 17:39:33,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 17:39:33,506 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 17:39:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-01 17:39:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-01 17:39:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-01 17:39:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-01 17:39:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-01 17:39:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-01 17:39:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-01 17:39:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-01 17:39:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-01 17:39:33,507 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-01 17:39:33,507 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-01 17:39:33,507 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-01 17:39:33,507 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-01 17:39:33,507 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-01 17:39:33,507 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-01 17:39:33,507 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-01 17:39:33,507 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-01 17:39:33,507 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-01 17:39:33,507 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-01 17:39:33,507 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-01 17:39:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-01 17:39:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-01 17:39:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-01 17:39:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-01 17:39:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-01 17:39:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-01 17:39:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-01 17:39:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-01 17:39:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-01 17:39:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-01 17:39:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-01 17:39:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-01 17:39:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-01 17:39:33,508 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-01 17:39:33,509 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-01 17:39:33,509 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-01 17:39:33,509 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-01 17:39:33,509 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-01 17:39:33,509 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-01 17:39:33,509 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-01 17:39:33,509 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-01 17:39:33,509 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-01 17:39:33,509 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-01 17:39:33,510 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-01 17:39:33,510 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-01 17:39:33,510 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-01 17:39:33,510 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-01 17:39:33,510 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-01 17:39:33,510 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-01 17:39:33,510 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-01 17:39:33,510 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-01 17:39:33,511 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-01 17:39:33,511 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-01 17:39:33,511 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-01 17:39:33,511 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-01 17:39:33,511 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-01 17:39:33,511 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-01 17:39:33,511 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-01 17:39:33,511 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-12-01 17:39:33,511 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-01 17:39:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-01 17:39:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-12-01 17:39:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-01 17:39:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-01 17:39:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-12-01 17:39:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-01 17:39:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-01 17:39:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-01 17:39:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-01 17:39:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-01 17:39:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-01 17:39:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-01 17:39:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-01 17:39:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-01 17:39:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-01 17:39:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-01 17:39:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-01 17:39:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-01 17:39:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-01 17:39:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-01 17:39:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-01 17:39:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-01 17:39:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-01 17:39:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-01 17:39:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-01 17:39:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-01 17:39:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-01 17:39:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-01 17:39:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-01 17:39:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-01 17:39:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-01 17:39:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-01 17:39:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-01 17:39:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-01 17:39:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-01 17:39:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-01 17:39:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-01 17:39:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-01 17:39:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-01 17:39:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-01 17:39:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-01 17:39:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-01 17:39:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-01 17:39:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-01 17:39:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-01 17:39:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 17:39:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 17:39:33,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-01 17:39:33,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 17:39:33,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-01 17:39:33,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 17:39:33,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 17:39:33,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 17:39:33,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 17:39:33,843 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 17:39:33,843 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-01 17:39:33,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:39:33 BoogieIcfgContainer [2018-12-01 17:39:33,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 17:39:33,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 17:39:33,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 17:39:33,846 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 17:39:33,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 05:39:33" (1/3) ... [2018-12-01 17:39:33,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b69569a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 05:39:33, skipping insertion in model container [2018-12-01 17:39:33,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:33" (2/3) ... [2018-12-01 17:39:33,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b69569a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 05:39:33, skipping insertion in model container [2018-12-01 17:39:33,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:39:33" (3/3) ... [2018-12-01 17:39:33,848 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-12-01 17:39:33,854 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 17:39:33,859 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-12-01 17:39:33,867 INFO L257 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2018-12-01 17:39:33,882 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 17:39:33,882 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 17:39:33,882 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-01 17:39:33,882 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 17:39:33,882 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 17:39:33,882 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 17:39:33,882 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 17:39:33,882 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 17:39:33,882 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 17:39:33,892 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2018-12-01 17:39:33,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-01 17:39:33,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:33,898 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:33,899 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION]=== [2018-12-01 17:39:33,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:33,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1288008576, now seen corresponding path program 1 times [2018-12-01 17:39:33,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:33,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:33,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:33,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:33,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:33,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:33,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:33,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 17:39:33,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 17:39:34,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 17:39:34,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 17:39:34,003 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 3 states. [2018-12-01 17:39:34,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:34,128 INFO L93 Difference]: Finished difference Result 171 states and 178 transitions. [2018-12-01 17:39:34,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 17:39:34,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-01 17:39:34,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:34,136 INFO L225 Difference]: With dead ends: 171 [2018-12-01 17:39:34,136 INFO L226 Difference]: Without dead ends: 167 [2018-12-01 17:39:34,138 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-12-01 17:39:34,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-01 17:39:34,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 143. [2018-12-01 17:39:34,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-01 17:39:34,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 148 transitions. [2018-12-01 17:39:34,166 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 148 transitions. Word has length 7 [2018-12-01 17:39:34,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:34,167 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 148 transitions. [2018-12-01 17:39:34,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 17:39:34,167 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 148 transitions. [2018-12-01 17:39:34,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-01 17:39:34,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:34,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:34,167 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION]=== [2018-12-01 17:39:34,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:34,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1288008577, now seen corresponding path program 1 times [2018-12-01 17:39:34,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:34,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:34,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:34,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:34,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:34,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:34,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:34,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 17:39:34,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 17:39:34,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 17:39:34,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 17:39:34,195 INFO L87 Difference]: Start difference. First operand 143 states and 148 transitions. Second operand 3 states. [2018-12-01 17:39:34,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:34,278 INFO L93 Difference]: Finished difference Result 140 states and 145 transitions. [2018-12-01 17:39:34,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 17:39:34,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-01 17:39:34,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:34,280 INFO L225 Difference]: With dead ends: 140 [2018-12-01 17:39:34,280 INFO L226 Difference]: Without dead ends: 140 [2018-12-01 17:39:34,280 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-12-01 17:39:34,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-01 17:39:34,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-12-01 17:39:34,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-01 17:39:34,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 145 transitions. [2018-12-01 17:39:34,287 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 145 transitions. Word has length 7 [2018-12-01 17:39:34,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:34,288 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 145 transitions. [2018-12-01 17:39:34,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 17:39:34,288 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 145 transitions. [2018-12-01 17:39:34,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 17:39:34,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:34,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:34,288 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION]=== [2018-12-01 17:39:34,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:34,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1110148732, now seen corresponding path program 1 times [2018-12-01 17:39:34,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:34,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:34,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:34,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:34,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:34,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:34,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:34,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 17:39:34,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 17:39:34,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 17:39:34,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 17:39:34,322 INFO L87 Difference]: Start difference. First operand 140 states and 145 transitions. Second operand 3 states. [2018-12-01 17:39:34,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:34,389 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2018-12-01 17:39:34,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 17:39:34,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-01 17:39:34,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:34,390 INFO L225 Difference]: With dead ends: 139 [2018-12-01 17:39:34,390 INFO L226 Difference]: Without dead ends: 139 [2018-12-01 17:39:34,390 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-12-01 17:39:34,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-01 17:39:34,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-12-01 17:39:34,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-01 17:39:34,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2018-12-01 17:39:34,397 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 11 [2018-12-01 17:39:34,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:34,397 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2018-12-01 17:39:34,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 17:39:34,397 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2018-12-01 17:39:34,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 17:39:34,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:34,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:34,398 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION]=== [2018-12-01 17:39:34,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:34,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1110148731, now seen corresponding path program 1 times [2018-12-01 17:39:34,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:34,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:34,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:34,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:34,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:34,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:34,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:34,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 17:39:34,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 17:39:34,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 17:39:34,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 17:39:34,431 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand 3 states. [2018-12-01 17:39:34,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:34,498 INFO L93 Difference]: Finished difference Result 148 states and 154 transitions. [2018-12-01 17:39:34,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 17:39:34,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-01 17:39:34,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:34,499 INFO L225 Difference]: With dead ends: 148 [2018-12-01 17:39:34,499 INFO L226 Difference]: Without dead ends: 148 [2018-12-01 17:39:34,500 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-12-01 17:39:34,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-01 17:39:34,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 139. [2018-12-01 17:39:34,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-01 17:39:34,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 146 transitions. [2018-12-01 17:39:34,504 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 146 transitions. Word has length 11 [2018-12-01 17:39:34,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:34,504 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 146 transitions. [2018-12-01 17:39:34,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 17:39:34,504 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 146 transitions. [2018-12-01 17:39:34,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-01 17:39:34,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:34,504 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:34,505 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION]=== [2018-12-01 17:39:34,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:34,505 INFO L82 PathProgramCache]: Analyzing trace with hash 252296525, now seen corresponding path program 1 times [2018-12-01 17:39:34,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:34,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:34,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:34,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:34,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:34,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:34,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:34,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 17:39:34,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 17:39:34,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 17:39:34,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 17:39:34,546 INFO L87 Difference]: Start difference. First operand 139 states and 146 transitions. Second operand 4 states. [2018-12-01 17:39:34,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:34,660 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-12-01 17:39:34,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 17:39:34,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-01 17:39:34,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:34,661 INFO L225 Difference]: With dead ends: 140 [2018-12-01 17:39:34,661 INFO L226 Difference]: Without dead ends: 140 [2018-12-01 17:39:34,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-12-01 17:39:34,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-01 17:39:34,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 126. [2018-12-01 17:39:34,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-01 17:39:34,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-12-01 17:39:34,665 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 17 [2018-12-01 17:39:34,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:34,666 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-12-01 17:39:34,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 17:39:34,666 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-12-01 17:39:34,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-01 17:39:34,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:34,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:34,666 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION]=== [2018-12-01 17:39:34,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:34,667 INFO L82 PathProgramCache]: Analyzing trace with hash 252296526, now seen corresponding path program 1 times [2018-12-01 17:39:34,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:34,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:34,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:34,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:34,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:34,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:34,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:34,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 17:39:34,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 17:39:34,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 17:39:34,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 17:39:34,722 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 6 states. [2018-12-01 17:39:34,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:34,892 INFO L93 Difference]: Finished difference Result 160 states and 170 transitions. [2018-12-01 17:39:34,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 17:39:34,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-12-01 17:39:34,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:34,894 INFO L225 Difference]: With dead ends: 160 [2018-12-01 17:39:34,894 INFO L226 Difference]: Without dead ends: 160 [2018-12-01 17:39:34,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-01 17:39:34,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-01 17:39:34,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 135. [2018-12-01 17:39:34,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-01 17:39:34,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2018-12-01 17:39:34,898 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 17 [2018-12-01 17:39:34,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:34,898 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2018-12-01 17:39:34,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 17:39:34,898 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2018-12-01 17:39:34,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-01 17:39:34,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:34,898 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-12-01 17:39:34,899 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION]=== [2018-12-01 17:39:34,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:34,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1938792144, now seen corresponding path program 1 times [2018-12-01 17:39:34,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:34,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:34,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:34,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:34,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:34,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:34,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 17:39:34,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 17:39:34,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 17:39:34,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 17:39:34,938 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand 5 states. [2018-12-01 17:39:35,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:35,086 INFO L93 Difference]: Finished difference Result 177 states and 193 transitions. [2018-12-01 17:39:35,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 17:39:35,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-01 17:39:35,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:35,087 INFO L225 Difference]: With dead ends: 177 [2018-12-01 17:39:35,087 INFO L226 Difference]: Without dead ends: 177 [2018-12-01 17:39:35,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-01 17:39:35,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-01 17:39:35,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 134. [2018-12-01 17:39:35,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-01 17:39:35,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2018-12-01 17:39:35,092 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 19 [2018-12-01 17:39:35,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:35,092 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2018-12-01 17:39:35,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 17:39:35,092 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2018-12-01 17:39:35,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-01 17:39:35,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:35,093 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-12-01 17:39:35,093 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION]=== [2018-12-01 17:39:35,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:35,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1938792145, now seen corresponding path program 1 times [2018-12-01 17:39:35,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:35,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:35,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:35,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:35,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:35,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:35,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:35,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 17:39:35,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 17:39:35,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 17:39:35,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 17:39:35,141 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand 5 states. [2018-12-01 17:39:35,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:35,327 INFO L93 Difference]: Finished difference Result 198 states and 215 transitions. [2018-12-01 17:39:35,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 17:39:35,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-01 17:39:35,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:35,328 INFO L225 Difference]: With dead ends: 198 [2018-12-01 17:39:35,328 INFO L226 Difference]: Without dead ends: 198 [2018-12-01 17:39:35,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-01 17:39:35,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-01 17:39:35,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 133. [2018-12-01 17:39:35,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-01 17:39:35,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2018-12-01 17:39:35,332 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 19 [2018-12-01 17:39:35,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:35,333 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2018-12-01 17:39:35,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 17:39:35,333 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2018-12-01 17:39:35,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 17:39:35,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:35,333 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-12-01 17:39:35,334 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION]=== [2018-12-01 17:39:35,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:35,334 INFO L82 PathProgramCache]: Analyzing trace with hash -771138030, now seen corresponding path program 1 times [2018-12-01 17:39:35,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:35,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:35,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:35,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:35,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:35,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:35,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:35,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-01 17:39:35,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 17:39:35,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 17:39:35,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-01 17:39:35,401 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand 9 states. [2018-12-01 17:39:35,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:35,654 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2018-12-01 17:39:35,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 17:39:35,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-12-01 17:39:35,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:35,655 INFO L225 Difference]: With dead ends: 145 [2018-12-01 17:39:35,655 INFO L226 Difference]: Without dead ends: 145 [2018-12-01 17:39:35,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-12-01 17:39:35,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-01 17:39:35,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2018-12-01 17:39:35,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-01 17:39:35,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2018-12-01 17:39:35,658 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 23 [2018-12-01 17:39:35,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:35,658 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2018-12-01 17:39:35,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 17:39:35,659 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2018-12-01 17:39:35,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-01 17:39:35,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:35,659 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-12-01 17:39:35,660 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION]=== [2018-12-01 17:39:35,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:35,660 INFO L82 PathProgramCache]: Analyzing trace with hash -771138029, now seen corresponding path program 1 times [2018-12-01 17:39:35,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:35,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:35,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:35,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:35,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:35,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:35,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:35,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-01 17:39:35,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-01 17:39:35,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 17:39:35,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-01 17:39:35,765 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand 10 states. [2018-12-01 17:39:36,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:36,180 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2018-12-01 17:39:36,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-01 17:39:36,181 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-12-01 17:39:36,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:36,181 INFO L225 Difference]: With dead ends: 156 [2018-12-01 17:39:36,181 INFO L226 Difference]: Without dead ends: 156 [2018-12-01 17:39:36,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-12-01 17:39:36,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-12-01 17:39:36,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 134. [2018-12-01 17:39:36,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-01 17:39:36,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2018-12-01 17:39:36,185 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 23 [2018-12-01 17:39:36,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:36,185 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2018-12-01 17:39:36,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-01 17:39:36,186 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2018-12-01 17:39:36,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-01 17:39:36,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:36,186 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-12-01 17:39:36,187 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION]=== [2018-12-01 17:39:36,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:36,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1856557850, now seen corresponding path program 1 times [2018-12-01 17:39:36,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:36,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:36,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:36,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:36,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:36,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:36,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:36,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 17:39:36,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 17:39:36,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 17:39:36,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 17:39:36,219 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand 6 states. [2018-12-01 17:39:36,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:36,345 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2018-12-01 17:39:36,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 17:39:36,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-01 17:39:36,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:36,346 INFO L225 Difference]: With dead ends: 159 [2018-12-01 17:39:36,346 INFO L226 Difference]: Without dead ends: 159 [2018-12-01 17:39:36,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-12-01 17:39:36,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-01 17:39:36,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2018-12-01 17:39:36,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-01 17:39:36,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2018-12-01 17:39:36,349 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 26 [2018-12-01 17:39:36,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:36,349 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2018-12-01 17:39:36,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 17:39:36,349 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2018-12-01 17:39:36,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-01 17:39:36,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:36,350 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] [2018-12-01 17:39:36,350 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION]=== [2018-12-01 17:39:36,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:36,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1909518208, now seen corresponding path program 1 times [2018-12-01 17:39:36,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:36,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:36,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:36,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:36,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:36,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:36,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:39:36,399 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/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-12-01 17:39:36,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:36,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:36,480 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-12-01 17:39:36,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:36,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:36,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-12-01 17:39:36,497 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-12-01 17:39:36,499 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-12-01 17:39:36,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:36,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:36,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:36,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-12-01 17:39:36,521 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 21 treesize of output 16 [2018-12-01 17:39:36,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:36,524 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 16 treesize of output 23 [2018-12-01 17:39:36,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:36,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:36,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:36,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-12-01 17:39:36,551 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 36 treesize of output 29 [2018-12-01 17:39:36,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:36,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:36,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:36,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-12-01 17:39:36,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:36,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:36,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:36,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:33 [2018-12-01 17:39:36,608 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 36 treesize of output 26 [2018-12-01 17:39:36,611 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 26 treesize of output 10 [2018-12-01 17:39:36,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:36,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:36,622 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-12-01 17:39:36,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:15 [2018-12-01 17:39:36,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:36,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:39:36,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 15 [2018-12-01 17:39:36,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-01 17:39:36,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-01 17:39:36,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-12-01 17:39:36,682 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand 15 states. [2018-12-01 17:39:37,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:37,494 INFO L93 Difference]: Finished difference Result 201 states and 214 transitions. [2018-12-01 17:39:37,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-01 17:39:37,494 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-12-01 17:39:37,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:37,495 INFO L225 Difference]: With dead ends: 201 [2018-12-01 17:39:37,495 INFO L226 Difference]: Without dead ends: 201 [2018-12-01 17:39:37,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=637, Unknown=0, NotChecked=0, Total=870 [2018-12-01 17:39:37,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-01 17:39:37,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 148. [2018-12-01 17:39:37,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-01 17:39:37,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2018-12-01 17:39:37,499 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 29 [2018-12-01 17:39:37,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:37,499 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2018-12-01 17:39:37,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-01 17:39:37,499 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2018-12-01 17:39:37,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-01 17:39:37,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:37,500 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] [2018-12-01 17:39:37,500 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION]=== [2018-12-01 17:39:37,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:37,500 INFO L82 PathProgramCache]: Analyzing trace with hash -778956281, now seen corresponding path program 1 times [2018-12-01 17:39:37,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:37,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:37,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:37,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:37,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:37,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:37,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:37,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 17:39:37,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 17:39:37,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 17:39:37,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 17:39:37,528 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. Second operand 5 states. [2018-12-01 17:39:37,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:37,661 INFO L93 Difference]: Finished difference Result 212 states and 229 transitions. [2018-12-01 17:39:37,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 17:39:37,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-01 17:39:37,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:37,662 INFO L225 Difference]: With dead ends: 212 [2018-12-01 17:39:37,662 INFO L226 Difference]: Without dead ends: 212 [2018-12-01 17:39:37,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-01 17:39:37,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-01 17:39:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 147. [2018-12-01 17:39:37,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-01 17:39:37,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2018-12-01 17:39:37,664 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 30 [2018-12-01 17:39:37,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:37,664 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2018-12-01 17:39:37,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 17:39:37,664 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2018-12-01 17:39:37,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-01 17:39:37,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:37,665 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] [2018-12-01 17:39:37,665 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION]=== [2018-12-01 17:39:37,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:37,665 INFO L82 PathProgramCache]: Analyzing trace with hash -778956280, now seen corresponding path program 1 times [2018-12-01 17:39:37,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:37,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:37,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:37,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:37,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:37,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:37,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:37,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 17:39:37,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 17:39:37,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 17:39:37,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 17:39:37,697 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand 5 states. [2018-12-01 17:39:37,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:37,843 INFO L93 Difference]: Finished difference Result 233 states and 252 transitions. [2018-12-01 17:39:37,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 17:39:37,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-01 17:39:37,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:37,844 INFO L225 Difference]: With dead ends: 233 [2018-12-01 17:39:37,844 INFO L226 Difference]: Without dead ends: 233 [2018-12-01 17:39:37,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-01 17:39:37,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-12-01 17:39:37,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 146. [2018-12-01 17:39:37,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-01 17:39:37,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2018-12-01 17:39:37,846 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 30 [2018-12-01 17:39:37,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:37,847 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2018-12-01 17:39:37,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 17:39:37,847 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2018-12-01 17:39:37,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-01 17:39:37,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:37,847 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] [2018-12-01 17:39:37,847 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION]=== [2018-12-01 17:39:37,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:37,848 INFO L82 PathProgramCache]: Analyzing trace with hash -2118711400, now seen corresponding path program 1 times [2018-12-01 17:39:37,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:37,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:37,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:37,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:37,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:37,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:37,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:37,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 17:39:37,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 17:39:37,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 17:39:37,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 17:39:37,890 INFO L87 Difference]: Start difference. First operand 146 states and 157 transitions. Second operand 5 states. [2018-12-01 17:39:37,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:37,967 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2018-12-01 17:39:37,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 17:39:37,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-01 17:39:37,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:37,967 INFO L225 Difference]: With dead ends: 149 [2018-12-01 17:39:37,967 INFO L226 Difference]: Without dead ends: 149 [2018-12-01 17:39:37,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 17:39:37,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-01 17:39:37,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2018-12-01 17:39:37,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-01 17:39:37,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2018-12-01 17:39:37,969 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 30 [2018-12-01 17:39:37,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:37,969 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2018-12-01 17:39:37,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 17:39:37,970 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2018-12-01 17:39:37,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-01 17:39:37,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:37,970 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] [2018-12-01 17:39:37,970 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION]=== [2018-12-01 17:39:37,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:37,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1095967582, now seen corresponding path program 1 times [2018-12-01 17:39:37,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:37,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:37,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:37,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:37,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:37,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 17:39:37,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:37,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 17:39:37,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 17:39:37,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 17:39:37,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 17:39:37,999 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand 6 states. [2018-12-01 17:39:38,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:38,108 INFO L93 Difference]: Finished difference Result 158 states and 166 transitions. [2018-12-01 17:39:38,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 17:39:38,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-12-01 17:39:38,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:38,109 INFO L225 Difference]: With dead ends: 158 [2018-12-01 17:39:38,109 INFO L226 Difference]: Without dead ends: 158 [2018-12-01 17:39:38,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-01 17:39:38,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-01 17:39:38,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 145. [2018-12-01 17:39:38,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-01 17:39:38,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 153 transitions. [2018-12-01 17:39:38,111 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 153 transitions. Word has length 31 [2018-12-01 17:39:38,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:38,111 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 153 transitions. [2018-12-01 17:39:38,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 17:39:38,112 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2018-12-01 17:39:38,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-01 17:39:38,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:38,112 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] [2018-12-01 17:39:38,112 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION]=== [2018-12-01 17:39:38,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:38,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1230015159, now seen corresponding path program 1 times [2018-12-01 17:39:38,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:38,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:38,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:38,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:38,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:38,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:38,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:38,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-01 17:39:38,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-01 17:39:38,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-01 17:39:38,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-12-01 17:39:38,202 INFO L87 Difference]: Start difference. First operand 145 states and 153 transitions. Second operand 12 states. [2018-12-01 17:39:38,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:38,494 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2018-12-01 17:39:38,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-01 17:39:38,494 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-12-01 17:39:38,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:38,495 INFO L225 Difference]: With dead ends: 144 [2018-12-01 17:39:38,495 INFO L226 Difference]: Without dead ends: 144 [2018-12-01 17:39:38,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-12-01 17:39:38,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-12-01 17:39:38,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-12-01 17:39:38,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-01 17:39:38,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2018-12-01 17:39:38,497 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 34 [2018-12-01 17:39:38,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:38,497 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2018-12-01 17:39:38,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-01 17:39:38,497 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2018-12-01 17:39:38,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-01 17:39:38,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:38,498 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] [2018-12-01 17:39:38,498 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION]=== [2018-12-01 17:39:38,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:38,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1230015158, now seen corresponding path program 1 times [2018-12-01 17:39:38,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:38,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:38,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:38,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:38,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:38,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:38,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:38,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-01 17:39:38,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 17:39:38,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 17:39:38,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-01 17:39:38,590 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 9 states. [2018-12-01 17:39:38,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:38,877 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-12-01 17:39:38,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 17:39:38,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-12-01 17:39:38,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:38,877 INFO L225 Difference]: With dead ends: 140 [2018-12-01 17:39:38,878 INFO L226 Difference]: Without dead ends: 140 [2018-12-01 17:39:38,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-12-01 17:39:38,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-01 17:39:38,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2018-12-01 17:39:38,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-01 17:39:38,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-12-01 17:39:38,879 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 34 [2018-12-01 17:39:38,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:38,879 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-12-01 17:39:38,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 17:39:38,879 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-12-01 17:39:38,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-01 17:39:38,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:38,880 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, 1] [2018-12-01 17:39:38,880 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION]=== [2018-12-01 17:39:38,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:38,880 INFO L82 PathProgramCache]: Analyzing trace with hash 701473530, now seen corresponding path program 1 times [2018-12-01 17:39:38,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:38,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:38,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:38,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:38,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:38,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:38,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:39:38,924 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/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-12-01 17:39:38,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:38,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:38,949 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-12-01 17:39:38,950 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-12-01 17:39:38,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:38,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:38,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:38,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-01 17:39:38,955 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-12-01 17:39:38,956 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 3 [2018-12-01 17:39:38,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:38,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:38,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:38,958 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-01 17:39:38,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 17:39:38,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 17:39:38,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2018-12-01 17:39:38,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 17:39:38,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 17:39:38,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-01 17:39:38,980 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 9 states. [2018-12-01 17:39:39,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:39,167 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2018-12-01 17:39:39,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 17:39:39,167 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-12-01 17:39:39,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:39,168 INFO L225 Difference]: With dead ends: 143 [2018-12-01 17:39:39,168 INFO L226 Difference]: Without dead ends: 143 [2018-12-01 17:39:39,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-12-01 17:39:39,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-01 17:39:39,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 119. [2018-12-01 17:39:39,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-01 17:39:39,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 125 transitions. [2018-12-01 17:39:39,170 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 125 transitions. Word has length 36 [2018-12-01 17:39:39,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:39,170 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 125 transitions. [2018-12-01 17:39:39,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 17:39:39,170 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2018-12-01 17:39:39,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-01 17:39:39,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:39,171 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, 1, 1, 1] [2018-12-01 17:39:39,171 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION]=== [2018-12-01 17:39:39,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:39,171 INFO L82 PathProgramCache]: Analyzing trace with hash -401458596, now seen corresponding path program 1 times [2018-12-01 17:39:39,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:39,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:39,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:39,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:39,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:39,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:39,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 17:39:39,276 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/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-12-01 17:39:39,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:39,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:39,343 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-12-01 17:39:39,345 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-12-01 17:39:39,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:39,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:39,358 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-12-01 17:39:39,360 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-12-01 17:39:39,360 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:39,361 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:39,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:39,364 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:10 [2018-12-01 17:39:39,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:39,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:39:39,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2018-12-01 17:39:39,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-01 17:39:39,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-01 17:39:39,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-12-01 17:39:39,428 INFO L87 Difference]: Start difference. First operand 119 states and 125 transitions. Second operand 14 states. [2018-12-01 17:39:39,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:39,778 INFO L93 Difference]: Finished difference Result 148 states and 155 transitions. [2018-12-01 17:39:39,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-01 17:39:39,779 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-12-01 17:39:39,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:39,779 INFO L225 Difference]: With dead ends: 148 [2018-12-01 17:39:39,779 INFO L226 Difference]: Without dead ends: 148 [2018-12-01 17:39:39,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2018-12-01 17:39:39,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-01 17:39:39,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 129. [2018-12-01 17:39:39,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-01 17:39:39,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 136 transitions. [2018-12-01 17:39:39,781 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 136 transitions. Word has length 37 [2018-12-01 17:39:39,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:39,781 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 136 transitions. [2018-12-01 17:39:39,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-01 17:39:39,781 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2018-12-01 17:39:39,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-01 17:39:39,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:39,781 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, 1, 1, 1] [2018-12-01 17:39:39,782 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION]=== [2018-12-01 17:39:39,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:39,782 INFO L82 PathProgramCache]: Analyzing trace with hash 439684856, now seen corresponding path program 1 times [2018-12-01 17:39:39,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:39:39,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:39:39,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:39,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:39,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:39:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:39:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:39:39,804 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-01 17:39:39,814 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-01 17:39:39,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 05:39:39 BoogieIcfgContainer [2018-12-01 17:39:39,824 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 17:39:39,824 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 17:39:39,824 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 17:39:39,824 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 17:39:39,824 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:39:33" (3/4) ... [2018-12-01 17:39:39,827 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 17:39:39,827 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 17:39:39,827 INFO L168 Benchmark]: Toolchain (without parser) took 6700.84 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 265.8 MB). Free memory was 951.7 MB in the beginning and 980.4 MB in the end (delta: -28.7 MB). Peak memory consumption was 237.1 MB. Max. memory is 11.5 GB. [2018-12-01 17:39:39,828 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:39:39,828 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -131.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-01 17:39:39,829 INFO L168 Benchmark]: Boogie Preprocessor took 42.77 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:39:39,829 INFO L168 Benchmark]: RCFGBuilder took 372.59 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: 73.1 MB). Peak memory consumption was 73.1 MB. Max. memory is 11.5 GB. [2018-12-01 17:39:39,829 INFO L168 Benchmark]: TraceAbstraction took 5979.63 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 165.7 MB). Free memory was 1.0 GB in the beginning and 980.4 MB in the end (delta: 29.7 MB). Peak memory consumption was 195.4 MB. Max. memory is 11.5 GB. [2018-12-01 17:39:39,829 INFO L168 Benchmark]: Witness Printer took 2.72 ms. Allocated memory is still 1.3 GB. Free memory is still 980.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:39:39,831 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 300.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -131.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.77 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 372.59 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: 73.1 MB). Peak memory consumption was 73.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5979.63 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 165.7 MB). Free memory was 1.0 GB in the beginning and 980.4 MB in the end (delta: 29.7 MB). Peak memory consumption was 195.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.72 ms. Allocated memory is still 1.3 GB. Free memory is still 980.4 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: [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); VAL [malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L988] null->next = ((void*)0) VAL [malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L989] null->prev = ((void*)0) VAL [malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L990] null->colour = BLACK VAL [malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L993] list->next = null VAL [list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L994] list->prev = null VAL [list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L995] list->colour = BLACK VAL [list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L997] struct TSLL* end = list; VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1031] EXPR end->colour VAL [end={19:0}, end->colour=1, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE null != end VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1034] EXPR end->colour VAL [end={19:0}, end->colour=1, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next VAL [end={19:0}, end->next={20:0}, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1041] end = end->next [L1032] COND FALSE !(null != end) VAL [end={20:0}, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1045] COND TRUE null != list VAL [end={20:0}, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1047] EXPR list->colour VAL [end={20:0}, list={19:0}, list->colour=1, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1047] COND FALSE !(RED == list->colour) [L1056] EXPR list->next VAL [end={20:0}, list={19:0}, list->next={20:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1056] end = list->next [L1057] free(list) VAL [end={20:0}, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1057] free(list) [L1058] list = end VAL [end={20:0}, list={20:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1045] COND FALSE !(null != list) VAL [end={20:0}, list={20:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1062] return 0; VAL [\result=0, end={20:0}, list={20:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 149 locations, 67 error locations. UNSAFE Result, 5.9s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1675 SDtfs, 3225 SDslu, 3503 SDs, 0 SdLazy, 5632 SolverSat, 309 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 301 GetRequests, 111 SyntacticMatches, 13 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=0, 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, 20 MinimizatonAttempts, 527 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 611 NumberOfCodeBlocks, 611 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 550 ConstructedInterpolants, 3 QuantifiedInterpolants, 107179 SizeOfPredicates, 27 NumberOfNonLiveVariables, 480 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 23 InterpolantComputations, 18 PerfectInterpolantSequences, 5/13 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-635dfa2 [2018-12-01 17:39:41,086 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 17:39:41,087 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 17:39:41,093 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 17:39:41,093 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 17:39:41,094 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 17:39:41,094 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 17:39:41,095 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 17:39:41,096 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 17:39:41,096 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 17:39:41,097 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 17:39:41,097 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 17:39:41,097 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 17:39:41,098 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 17:39:41,098 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 17:39:41,099 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 17:39:41,099 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 17:39:41,100 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 17:39:41,101 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 17:39:41,102 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 17:39:41,102 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 17:39:41,103 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 17:39:41,104 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 17:39:41,104 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 17:39:41,104 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 17:39:41,105 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 17:39:41,105 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 17:39:41,106 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 17:39:41,106 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 17:39:41,107 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 17:39:41,107 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 17:39:41,107 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 17:39:41,107 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 17:39:41,107 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 17:39:41,108 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 17:39:41,108 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 17:39:41,108 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-12-01 17:39:41,116 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 17:39:41,116 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 17:39:41,116 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 17:39:41,117 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 17:39:41,117 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 17:39:41,117 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 17:39:41,117 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 17:39:41,117 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 17:39:41,117 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 17:39:41,117 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 17:39:41,117 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 17:39:41,118 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 17:39:41,118 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 17:39:41,118 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-01 17:39:41,118 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-01 17:39:41,118 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-01 17:39:41,118 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 17:39:41,118 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-01 17:39:41,118 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-01 17:39:41,118 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 17:39:41,118 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 17:39:41,118 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 17:39:41,119 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 17:39:41,119 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 17:39:41,119 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 17:39:41,119 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 17:39:41,119 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 17:39:41,119 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 17:39:41,119 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-01 17:39:41,119 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 17:39:41,119 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-01 17:39:41,119 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_c4dd2371-baed-47b9-9379-641e42802172/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 -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2018-12-01 17:39:41,137 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 17:39:41,144 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 17:39:41,146 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 17:39:41,147 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 17:39:41,148 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 17:39:41,148 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-12-01 17:39:41,183 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/data/09bde3a00/f5653bd9251f496da6edabe15d5adb16/FLAG5e523dbea [2018-12-01 17:39:41,551 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 17:39:41,551 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-12-01 17:39:41,560 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/data/09bde3a00/f5653bd9251f496da6edabe15d5adb16/FLAG5e523dbea [2018-12-01 17:39:41,568 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/data/09bde3a00/f5653bd9251f496da6edabe15d5adb16 [2018-12-01 17:39:41,570 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 17:39:41,571 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-01 17:39:41,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 17:39:41,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 17:39:41,574 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 17:39:41,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:39:41" (1/1) ... [2018-12-01 17:39:41,576 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@197102f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:41, skipping insertion in model container [2018-12-01 17:39:41,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:39:41" (1/1) ... [2018-12-01 17:39:41,580 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 17:39:41,600 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 17:39:41,755 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 17:39:41,762 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 17:39:41,790 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 17:39:41,844 INFO L195 MainTranslator]: Completed translation [2018-12-01 17:39:41,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:41 WrapperNode [2018-12-01 17:39:41,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 17:39:41,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 17:39:41,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 17:39:41,845 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 17:39:41,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:41" (1/1) ... [2018-12-01 17:39:41,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:41" (1/1) ... [2018-12-01 17:39:41,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:41" (1/1) ... [2018-12-01 17:39:41,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:41" (1/1) ... [2018-12-01 17:39:41,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:41" (1/1) ... [2018-12-01 17:39:41,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:41" (1/1) ... [2018-12-01 17:39:41,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:41" (1/1) ... [2018-12-01 17:39:41,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 17:39:41,881 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 17:39:41,881 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 17:39:41,881 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 17:39:41,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/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-12-01 17:39:41,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 17:39:41,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 17:39:41,912 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 17:39:41,912 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-01 17:39:41,912 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-01 17:39:41,912 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-01 17:39:41,912 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-01 17:39:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-01 17:39:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-01 17:39:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-01 17:39:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-01 17:39:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-01 17:39:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-01 17:39:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-01 17:39:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-01 17:39:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-01 17:39:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-01 17:39:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-01 17:39:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-01 17:39:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-01 17:39:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-01 17:39:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-01 17:39:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-01 17:39:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-01 17:39:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-01 17:39:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-01 17:39:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-01 17:39:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-01 17:39:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-01 17:39:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-01 17:39:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-01 17:39:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-01 17:39:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-01 17:39:41,914 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-01 17:39:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-01 17:39:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-01 17:39:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-01 17:39:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-01 17:39:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-01 17:39:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-01 17:39:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-01 17:39:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-01 17:39:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-01 17:39:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-01 17:39:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-01 17:39:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-01 17:39:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-01 17:39:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-01 17:39:41,915 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-01 17:39:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-01 17:39:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-01 17:39:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-01 17:39:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-01 17:39:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-01 17:39:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-01 17:39:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-01 17:39:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-01 17:39:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-01 17:39:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-01 17:39:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-01 17:39:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-01 17:39:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-12-01 17:39:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-01 17:39:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-01 17:39:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-12-01 17:39:41,917 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-01 17:39:41,917 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-01 17:39:41,917 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-12-01 17:39:41,917 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-01 17:39:41,917 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-01 17:39:41,917 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-01 17:39:41,917 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-01 17:39:41,917 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-01 17:39:41,917 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-01 17:39:41,917 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-01 17:39:41,917 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-01 17:39:41,917 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-01 17:39:41,917 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-01 17:39:41,917 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-01 17:39:41,917 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-01 17:39:41,917 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-01 17:39:41,918 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-01 17:39:41,918 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-01 17:39:41,918 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-01 17:39:41,918 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-01 17:39:41,918 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-01 17:39:41,918 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-01 17:39:41,918 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-01 17:39:41,918 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-01 17:39:41,918 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-01 17:39:41,918 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-01 17:39:41,918 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-01 17:39:41,918 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-01 17:39:41,918 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-01 17:39:41,918 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-01 17:39:41,918 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-01 17:39:41,918 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-01 17:39:41,919 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-01 17:39:41,919 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-01 17:39:41,919 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-01 17:39:41,919 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-01 17:39:41,919 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-01 17:39:41,919 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-01 17:39:41,919 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-01 17:39:41,919 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-01 17:39:41,919 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-01 17:39:41,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-01 17:39:41,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-01 17:39:41,919 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 17:39:41,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 17:39:41,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-01 17:39:41,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-01 17:39:41,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-01 17:39:41,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-01 17:39:41,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 17:39:41,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 17:39:41,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 17:39:42,403 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 17:39:42,404 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-01 17:39:42,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:39:42 BoogieIcfgContainer [2018-12-01 17:39:42,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 17:39:42,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 17:39:42,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 17:39:42,407 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 17:39:42,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 05:39:41" (1/3) ... [2018-12-01 17:39:42,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9dad47a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 05:39:42, skipping insertion in model container [2018-12-01 17:39:42,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:39:41" (2/3) ... [2018-12-01 17:39:42,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9dad47a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 05:39:42, skipping insertion in model container [2018-12-01 17:39:42,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:39:42" (3/3) ... [2018-12-01 17:39:42,410 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-12-01 17:39:42,419 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 17:39:42,426 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-12-01 17:39:42,438 INFO L257 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2018-12-01 17:39:42,454 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 17:39:42,455 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 17:39:42,455 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-01 17:39:42,455 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 17:39:42,455 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 17:39:42,455 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 17:39:42,455 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 17:39:42,455 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 17:39:42,456 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 17:39:42,468 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2018-12-01 17:39:42,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-01 17:39:42,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:42,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:42,476 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-01 17:39:42,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:42,480 INFO L82 PathProgramCache]: Analyzing trace with hash -487060290, now seen corresponding path program 1 times [2018-12-01 17:39:42,482 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 17:39:42,482 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 17:39:42,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:42,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:42,553 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-12-01 17:39:42,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:42,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:42,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-01 17:39:42,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:42,565 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 17:39:42,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:42,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 17:39:42,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 17:39:42,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 17:39:42,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 17:39:42,580 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 3 states. [2018-12-01 17:39:42,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:42,850 INFO L93 Difference]: Finished difference Result 169 states and 176 transitions. [2018-12-01 17:39:42,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 17:39:42,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-01 17:39:42,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:42,860 INFO L225 Difference]: With dead ends: 169 [2018-12-01 17:39:42,861 INFO L226 Difference]: Without dead ends: 165 [2018-12-01 17:39:42,862 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-12-01 17:39:42,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-01 17:39:42,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 141. [2018-12-01 17:39:42,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-01 17:39:42,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 146 transitions. [2018-12-01 17:39:42,889 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 146 transitions. Word has length 7 [2018-12-01 17:39:42,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:42,890 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 146 transitions. [2018-12-01 17:39:42,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 17:39:42,890 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 146 transitions. [2018-12-01 17:39:42,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-01 17:39:42,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:42,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:42,890 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-01 17:39:42,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:42,891 INFO L82 PathProgramCache]: Analyzing trace with hash -487060289, now seen corresponding path program 1 times [2018-12-01 17:39:42,891 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 17:39:42,891 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 17:39:42,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:42,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:42,929 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-12-01 17:39:42,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:42,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:42,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 17:39:42,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:42,939 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 17:39:42,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:42,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 17:39:42,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 17:39:42,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 17:39:42,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 17:39:42,941 INFO L87 Difference]: Start difference. First operand 141 states and 146 transitions. Second operand 3 states. [2018-12-01 17:39:43,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:43,166 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2018-12-01 17:39:43,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 17:39:43,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-01 17:39:43,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:43,168 INFO L225 Difference]: With dead ends: 138 [2018-12-01 17:39:43,168 INFO L226 Difference]: Without dead ends: 138 [2018-12-01 17:39:43,169 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-12-01 17:39:43,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-01 17:39:43,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-12-01 17:39:43,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-01 17:39:43,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2018-12-01 17:39:43,176 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 7 [2018-12-01 17:39:43,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:43,177 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2018-12-01 17:39:43,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 17:39:43,177 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2018-12-01 17:39:43,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 17:39:43,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:43,177 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:43,178 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-01 17:39:43,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:43,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1518093250, now seen corresponding path program 1 times [2018-12-01 17:39:43,178 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 17:39:43,178 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 17:39:43,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:43,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:43,231 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-12-01 17:39:43,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:43,236 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-12-01 17:39:43,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-12-01 17:39:43,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:43,244 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 17:39:43,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:43,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 17:39:43,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 17:39:43,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 17:39:43,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 17:39:43,246 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand 4 states. [2018-12-01 17:39:43,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:43,454 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2018-12-01 17:39:43,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 17:39:43,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-01 17:39:43,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:43,455 INFO L225 Difference]: With dead ends: 137 [2018-12-01 17:39:43,455 INFO L226 Difference]: Without dead ends: 137 [2018-12-01 17:39:43,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 17:39:43,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-01 17:39:43,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2018-12-01 17:39:43,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-01 17:39:43,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2018-12-01 17:39:43,460 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 11 [2018-12-01 17:39:43,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:43,460 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2018-12-01 17:39:43,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 17:39:43,460 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2018-12-01 17:39:43,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 17:39:43,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:43,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:43,461 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-01 17:39:43,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:43,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1518093251, now seen corresponding path program 1 times [2018-12-01 17:39:43,461 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 17:39:43,461 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 17:39:43,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:43,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:43,516 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-12-01 17:39:43,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:43,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:43,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 17:39:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:43,529 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 17:39:43,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:43,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 17:39:43,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 17:39:43,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 17:39:43,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 17:39:43,531 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand 3 states. [2018-12-01 17:39:43,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:43,791 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2018-12-01 17:39:43,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 17:39:43,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-01 17:39:43,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:43,792 INFO L225 Difference]: With dead ends: 146 [2018-12-01 17:39:43,792 INFO L226 Difference]: Without dead ends: 146 [2018-12-01 17:39:43,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-12-01 17:39:43,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-01 17:39:43,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 137. [2018-12-01 17:39:43,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-01 17:39:43,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-12-01 17:39:43,796 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 11 [2018-12-01 17:39:43,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:43,796 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-12-01 17:39:43,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 17:39:43,796 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-12-01 17:39:43,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-01 17:39:43,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:43,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:43,797 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-01 17:39:43,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:43,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1912036980, now seen corresponding path program 1 times [2018-12-01 17:39:43,798 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 17:39:43,798 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 17:39:43,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:43,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:43,878 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-12-01 17:39:43,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:43,885 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-12-01 17:39:43,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-12-01 17:39:43,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:43,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:43,912 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-12-01 17:39:43,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:43,921 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-12-01 17:39:43,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2018-12-01 17:39:43,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:43,934 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 17:39:43,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:43,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 17:39:43,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 17:39:43,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 17:39:43,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-01 17:39:43,936 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 6 states. [2018-12-01 17:39:44,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:44,332 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-12-01 17:39:44,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 17:39:44,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-12-01 17:39:44,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:44,333 INFO L225 Difference]: With dead ends: 138 [2018-12-01 17:39:44,333 INFO L226 Difference]: Without dead ends: 138 [2018-12-01 17:39:44,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-12-01 17:39:44,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-01 17:39:44,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 124. [2018-12-01 17:39:44,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-01 17:39:44,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2018-12-01 17:39:44,337 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 16 [2018-12-01 17:39:44,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:44,337 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2018-12-01 17:39:44,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 17:39:44,337 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2018-12-01 17:39:44,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-01 17:39:44,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:44,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:44,338 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-01 17:39:44,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:44,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1912036981, now seen corresponding path program 1 times [2018-12-01 17:39:44,338 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 17:39:44,338 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 17:39:44,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:44,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:44,430 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-12-01 17:39:44,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:44,437 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-12-01 17:39:44,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:44,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:44,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-01 17:39:44,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:44,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:44,482 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-12-01 17:39:44,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:44,494 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-12-01 17:39:44,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:44,502 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-12-01 17:39:44,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-12-01 17:39:44,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:44,518 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 17:39:44,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:44,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 17:39:44,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 17:39:44,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 17:39:44,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 17:39:44,521 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand 5 states. [2018-12-01 17:39:45,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:45,151 INFO L93 Difference]: Finished difference Result 153 states and 163 transitions. [2018-12-01 17:39:45,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 17:39:45,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-01 17:39:45,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:45,153 INFO L225 Difference]: With dead ends: 153 [2018-12-01 17:39:45,153 INFO L226 Difference]: Without dead ends: 153 [2018-12-01 17:39:45,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-01 17:39:45,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-01 17:39:45,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 132. [2018-12-01 17:39:45,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-01 17:39:45,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2018-12-01 17:39:45,157 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 16 [2018-12-01 17:39:45,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:45,157 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2018-12-01 17:39:45,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 17:39:45,158 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2018-12-01 17:39:45,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-01 17:39:45,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:45,158 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:45,159 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-01 17:39:45,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:45,159 INFO L82 PathProgramCache]: Analyzing trace with hash -778464745, now seen corresponding path program 1 times [2018-12-01 17:39:45,159 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 17:39:45,159 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 17:39:45,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:45,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:45,238 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-12-01 17:39:45,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:45,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:45,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-01 17:39:45,246 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-12-01 17:39:45,248 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-12-01 17:39:45,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:45,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:45,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:45,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-12-01 17:39:45,261 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-12-01 17:39:45,263 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-12-01 17:39:45,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:45,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:45,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:45,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2018-12-01 17:39:45,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:45,272 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 17:39:45,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:45,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 17:39:45,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 17:39:45,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 17:39:45,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 17:39:45,275 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand 5 states. [2018-12-01 17:39:45,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:45,770 INFO L93 Difference]: Finished difference Result 174 states and 190 transitions. [2018-12-01 17:39:45,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 17:39:45,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-01 17:39:45,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:45,771 INFO L225 Difference]: With dead ends: 174 [2018-12-01 17:39:45,771 INFO L226 Difference]: Without dead ends: 174 [2018-12-01 17:39:45,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-01 17:39:45,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-01 17:39:45,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 131. [2018-12-01 17:39:45,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-01 17:39:45,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2018-12-01 17:39:45,776 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 18 [2018-12-01 17:39:45,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:45,776 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2018-12-01 17:39:45,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 17:39:45,776 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2018-12-01 17:39:45,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-01 17:39:45,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:45,776 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:39:45,776 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-01 17:39:45,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:45,777 INFO L82 PathProgramCache]: Analyzing trace with hash -778464744, now seen corresponding path program 1 times [2018-12-01 17:39:45,777 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 17:39:45,777 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 17:39:45,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:45,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:45,850 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-12-01 17:39:45,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:45,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:45,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 17:39:45,866 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-12-01 17:39:45,867 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-12-01 17:39:45,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:45,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:45,882 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-12-01 17:39:45,884 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-12-01 17:39:45,884 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:45,886 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:45,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:45,893 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-12-01 17:39:45,903 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-12-01 17:39:45,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-12-01 17:39:45,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:45,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:45,916 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-12-01 17:39:45,918 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-12-01 17:39:45,918 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:45,920 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:45,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:45,925 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-12-01 17:39:45,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:45,933 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 17:39:45,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:45,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 17:39:45,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 17:39:45,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 17:39:45,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 17:39:45,936 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand 5 states. [2018-12-01 17:39:46,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:46,546 INFO L93 Difference]: Finished difference Result 195 states and 212 transitions. [2018-12-01 17:39:46,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 17:39:46,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-01 17:39:46,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:46,547 INFO L225 Difference]: With dead ends: 195 [2018-12-01 17:39:46,547 INFO L226 Difference]: Without dead ends: 195 [2018-12-01 17:39:46,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-01 17:39:46,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-01 17:39:46,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 130. [2018-12-01 17:39:46,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-01 17:39:46,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2018-12-01 17:39:46,550 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 18 [2018-12-01 17:39:46,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:46,550 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2018-12-01 17:39:46,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 17:39:46,550 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2018-12-01 17:39:46,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 17:39:46,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:46,550 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-12-01 17:39:46,551 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-01 17:39:46,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:46,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1741282714, now seen corresponding path program 1 times [2018-12-01 17:39:46,551 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 17:39:46,551 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 17:39:46,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:46,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:46,667 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-12-01 17:39:46,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:46,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:46,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-01 17:39:46,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:46,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:46,681 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-12-01 17:39:46,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:46,689 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 6 treesize of output 5 [2018-12-01 17:39:46,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:46,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:46,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-12-01 17:39:46,709 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-12-01 17:39:46,712 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-12-01 17:39:46,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:46,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:46,730 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-12-01 17:39:46,733 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-12-01 17:39:46,733 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:46,735 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:46,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:46,743 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-12-01 17:39:46,798 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 29 treesize of output 30 [2018-12-01 17:39:46,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 14 treesize of output 13 [2018-12-01 17:39:46,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:46,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:46,841 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 52 treesize of output 48 [2018-12-01 17:39:46,844 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 14 treesize of output 13 [2018-12-01 17:39:46,844 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:46,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:46,871 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-12-01 17:39:46,871 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-12-01 17:39:46,916 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 28 treesize of output 26 [2018-12-01 17:39:46,920 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 7 treesize of output 1 [2018-12-01 17:39:46,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:46,934 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-12-01 17:39:46,934 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:46,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:46,960 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-12-01 17:39:46,963 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 7 treesize of output 1 [2018-12-01 17:39:46,963 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:46,975 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-12-01 17:39:46,975 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:46,980 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:46,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:46,986 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-12-01 17:39:47,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:47,046 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 17:39:47,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:47,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-01 17:39:47,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-01 17:39:47,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 17:39:47,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-01 17:39:47,052 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand 10 states. [2018-12-01 17:39:48,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:48,639 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2018-12-01 17:39:48,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-01 17:39:48,640 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-12-01 17:39:48,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:48,641 INFO L225 Difference]: With dead ends: 153 [2018-12-01 17:39:48,641 INFO L226 Difference]: Without dead ends: 153 [2018-12-01 17:39:48,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2018-12-01 17:39:48,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-01 17:39:48,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 132. [2018-12-01 17:39:48,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-01 17:39:48,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2018-12-01 17:39:48,644 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 22 [2018-12-01 17:39:48,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:48,644 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2018-12-01 17:39:48,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-01 17:39:48,644 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2018-12-01 17:39:48,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 17:39:48,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:48,644 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-12-01 17:39:48,645 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-01 17:39:48,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:48,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1741282713, now seen corresponding path program 1 times [2018-12-01 17:39:48,645 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 17:39:48,645 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 17:39:48,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:48,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:48,741 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-12-01 17:39:48,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:48,748 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-12-01 17:39:48,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-12-01 17:39:48,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:48,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:48,766 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-12-01 17:39:48,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:48,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:48,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-01 17:39:48,787 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-12-01 17:39:48,790 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-12-01 17:39:48,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:48,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:48,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:48,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-12-01 17:39:48,849 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 41 treesize of output 37 [2018-12-01 17:39:48,852 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 14 treesize of output 13 [2018-12-01 17:39:48,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:48,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:48,874 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-12-01 17:39:48,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-12-01 17:39:48,910 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 40 treesize of output 28 [2018-12-01 17:39:48,913 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 7 treesize of output 1 [2018-12-01 17:39:48,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:48,921 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-12-01 17:39:48,922 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:48,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:48,931 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-12-01 17:39:48,931 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-12-01 17:39:48,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:48,963 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 17:39:48,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:48,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-01 17:39:48,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-01 17:39:48,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-01 17:39:48,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-01 17:39:48,966 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand 11 states. [2018-12-01 17:39:50,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:50,093 INFO L93 Difference]: Finished difference Result 168 states and 182 transitions. [2018-12-01 17:39:50,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 17:39:50,094 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-12-01 17:39:50,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:50,094 INFO L225 Difference]: With dead ends: 168 [2018-12-01 17:39:50,094 INFO L226 Difference]: Without dead ends: 168 [2018-12-01 17:39:50,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2018-12-01 17:39:50,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-12-01 17:39:50,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 131. [2018-12-01 17:39:50,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-01 17:39:50,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2018-12-01 17:39:50,097 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 22 [2018-12-01 17:39:50,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:50,097 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2018-12-01 17:39:50,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-01 17:39:50,097 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2018-12-01 17:39:50,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-01 17:39:50,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:50,098 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-12-01 17:39:50,098 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-01 17:39:50,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:50,099 INFO L82 PathProgramCache]: Analyzing trace with hash 913766270, now seen corresponding path program 1 times [2018-12-01 17:39:50,099 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 17:39:50,099 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 17:39:50,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:50,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:50,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:50,144 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 17:39:50,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:50,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 17:39:50,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 17:39:50,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 17:39:50,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 17:39:50,145 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand 3 states. [2018-12-01 17:39:50,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:50,317 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2018-12-01 17:39:50,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 17:39:50,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-01 17:39:50,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:50,318 INFO L225 Difference]: With dead ends: 139 [2018-12-01 17:39:50,318 INFO L226 Difference]: Without dead ends: 139 [2018-12-01 17:39:50,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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-12-01 17:39:50,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-01 17:39:50,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 131. [2018-12-01 17:39:50,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-01 17:39:50,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2018-12-01 17:39:50,320 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 25 [2018-12-01 17:39:50,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:50,320 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2018-12-01 17:39:50,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 17:39:50,321 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2018-12-01 17:39:50,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-01 17:39:50,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:50,321 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-12-01 17:39:50,321 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-01 17:39:50,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:50,322 INFO L82 PathProgramCache]: Analyzing trace with hash 543815206, now seen corresponding path program 1 times [2018-12-01 17:39:50,322 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 17:39:50,322 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 17:39:50,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:50,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:50,414 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-12-01 17:39:50,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:50,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:50,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-01 17:39:50,421 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-12-01 17:39:50,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:50,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:50,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-01 17:39:50,443 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-12-01 17:39:50,444 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-12-01 17:39:50,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:50,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:50,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:50,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-01 17:39:50,466 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 20 [2018-12-01 17:39:50,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:50,470 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 29 [2018-12-01 17:39:50,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:50,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:50,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:50,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-12-01 17:39:50,501 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 44 treesize of output 35 [2018-12-01 17:39:50,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:50,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:50,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:50,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 45 [2018-12-01 17:39:50,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:50,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:50,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:50,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:33 [2018-12-01 17:39:50,566 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 28 treesize of output 20 [2018-12-01 17:39:50,568 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-12-01 17:39:50,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:50,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:50,574 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-12-01 17:39:50,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:11 [2018-12-01 17:39:50,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:50,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-01 17:39:50,626 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 17:39:50,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 17:39:50,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 17:39:50,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:16 [2018-12-01 17:39:50,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:50,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:39:50,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2018-12-01 17:39:50,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-01 17:39:50,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-01 17:39:50,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-12-01 17:39:50,670 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand 11 states. [2018-12-01 17:39:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:51,839 INFO L93 Difference]: Finished difference Result 186 states and 200 transitions. [2018-12-01 17:39:51,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 17:39:51,839 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-12-01 17:39:51,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:51,840 INFO L225 Difference]: With dead ends: 186 [2018-12-01 17:39:51,841 INFO L226 Difference]: Without dead ends: 186 [2018-12-01 17:39:51,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2018-12-01 17:39:51,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-01 17:39:51,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 145. [2018-12-01 17:39:51,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-01 17:39:51,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2018-12-01 17:39:51,843 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 28 [2018-12-01 17:39:51,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:51,844 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2018-12-01 17:39:51,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-01 17:39:51,844 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2018-12-01 17:39:51,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-01 17:39:51,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:51,844 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-12-01 17:39:51,844 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-01 17:39:51,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:51,845 INFO L82 PathProgramCache]: Analyzing trace with hash 543815207, now seen corresponding path program 1 times [2018-12-01 17:39:51,845 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 17:39:51,845 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 17:39:51,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:51,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:51,955 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-12-01 17:39:51,957 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-12-01 17:39:51,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:51,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:51,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-12-01 17:39:51,976 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-12-01 17:39:51,976 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:51,978 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:51,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:51,985 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-12-01 17:39:52,003 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 21 treesize of output 16 [2018-12-01 17:39:52,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:52,009 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 16 treesize of output 23 [2018-12-01 17:39:52,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:52,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:52,043 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 21 treesize of output 16 [2018-12-01 17:39:52,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:52,046 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 16 treesize of output 23 [2018-12-01 17:39:52,046 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:52,054 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:52,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:52,067 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-12-01 17:39:52,098 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 36 treesize of output 29 [2018-12-01 17:39:52,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:52,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:52,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:52,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-12-01 17:39:52,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:52,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:52,170 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 36 treesize of output 29 [2018-12-01 17:39:52,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:52,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:52,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:52,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-12-01 17:39:52,183 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:52,191 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:52,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:52,211 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:39 [2018-12-01 17:39:52,243 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 22 treesize of output 16 [2018-12-01 17:39:52,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-12-01 17:39:52,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:52,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:52,274 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 22 treesize of output 16 [2018-12-01 17:39:52,277 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-01 17:39:52,277 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:52,280 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:52,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:52,290 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:10 [2018-12-01 17:39:52,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:52,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-01 17:39:52,400 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 17:39:52,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 17:39:52,475 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:52,478 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:52,510 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 17:39:52,520 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 17:39:52,539 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:52,541 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:52,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-01 17:39:52,547 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:97, output treesize:25 [2018-12-01 17:39:52,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:52,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:39:52,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2018-12-01 17:39:52,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-01 17:39:52,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-01 17:39:52,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-12-01 17:39:52,579 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand 13 states. [2018-12-01 17:39:53,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:53,878 INFO L93 Difference]: Finished difference Result 186 states and 199 transitions. [2018-12-01 17:39:53,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 17:39:53,878 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-12-01 17:39:53,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:53,879 INFO L225 Difference]: With dead ends: 186 [2018-12-01 17:39:53,879 INFO L226 Difference]: Without dead ends: 186 [2018-12-01 17:39:53,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2018-12-01 17:39:53,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-01 17:39:53,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 144. [2018-12-01 17:39:53,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-01 17:39:53,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2018-12-01 17:39:53,882 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 28 [2018-12-01 17:39:53,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:53,882 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2018-12-01 17:39:53,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-01 17:39:53,882 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2018-12-01 17:39:53,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-01 17:39:53,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:53,883 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] [2018-12-01 17:39:53,883 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-01 17:39:53,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:53,883 INFO L82 PathProgramCache]: Analyzing trace with hash 967974238, now seen corresponding path program 1 times [2018-12-01 17:39:53,884 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 17:39:53,884 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 17:39:53,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:54,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:54,005 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-12-01 17:39:54,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:54,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:54,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-01 17:39:54,014 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-12-01 17:39:54,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 8 treesize of output 7 [2018-12-01 17:39:54,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:54,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:54,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:54,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-12-01 17:39:54,040 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-12-01 17:39:54,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, 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-12-01 17:39:54,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:54,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:54,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:54,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-01 17:39:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:54,050 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 17:39:54,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:54,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 17:39:54,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 17:39:54,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 17:39:54,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 17:39:54,053 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand 5 states. [2018-12-01 17:39:54,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:54,600 INFO L93 Difference]: Finished difference Result 206 states and 223 transitions. [2018-12-01 17:39:54,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 17:39:54,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-12-01 17:39:54,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:54,601 INFO L225 Difference]: With dead ends: 206 [2018-12-01 17:39:54,601 INFO L226 Difference]: Without dead ends: 206 [2018-12-01 17:39:54,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-01 17:39:54,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-01 17:39:54,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 143. [2018-12-01 17:39:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-01 17:39:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2018-12-01 17:39:54,604 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 28 [2018-12-01 17:39:54,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:54,604 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2018-12-01 17:39:54,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 17:39:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2018-12-01 17:39:54,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-01 17:39:54,604 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:54,604 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] [2018-12-01 17:39:54,605 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-01 17:39:54,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:54,605 INFO L82 PathProgramCache]: Analyzing trace with hash 967974239, now seen corresponding path program 1 times [2018-12-01 17:39:54,605 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 17:39:54,605 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 17:39:54,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:54,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:54,708 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-12-01 17:39:54,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:54,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:54,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-01 17:39:54,724 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-12-01 17:39:54,726 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-12-01 17:39:54,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:54,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:54,739 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-12-01 17:39:54,741 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-12-01 17:39:54,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:54,743 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:54,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:54,749 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-12-01 17:39:54,758 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-12-01 17:39:54,760 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-12-01 17:39:54,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:54,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:54,771 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-12-01 17:39:54,772 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-12-01 17:39:54,772 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:54,774 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:54,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:54,778 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-12-01 17:39:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:54,785 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 17:39:54,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:54,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 17:39:54,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 17:39:54,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 17:39:54,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 17:39:54,789 INFO L87 Difference]: Start difference. First operand 143 states and 154 transitions. Second operand 5 states. [2018-12-01 17:39:55,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:55,402 INFO L93 Difference]: Finished difference Result 227 states and 246 transitions. [2018-12-01 17:39:55,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 17:39:55,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-12-01 17:39:55,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:55,404 INFO L225 Difference]: With dead ends: 227 [2018-12-01 17:39:55,404 INFO L226 Difference]: Without dead ends: 227 [2018-12-01 17:39:55,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-01 17:39:55,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-12-01 17:39:55,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 142. [2018-12-01 17:39:55,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-01 17:39:55,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2018-12-01 17:39:55,407 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 28 [2018-12-01 17:39:55,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:55,407 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2018-12-01 17:39:55,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 17:39:55,407 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2018-12-01 17:39:55,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-01 17:39:55,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:55,408 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] [2018-12-01 17:39:55,408 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-01 17:39:55,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:55,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1505831504, now seen corresponding path program 1 times [2018-12-01 17:39:55,408 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 17:39:55,408 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 17:39:55,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:55,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:55,463 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-12-01 17:39:55,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, 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 3 [2018-12-01 17:39:55,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:55,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:55,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:55,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-01 17:39:55,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:55,475 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 17:39:55,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:55,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 17:39:55,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 17:39:55,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 17:39:55,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 17:39:55,477 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 5 states. [2018-12-01 17:39:55,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:55,868 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-12-01 17:39:55,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 17:39:55,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-12-01 17:39:55,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:55,869 INFO L225 Difference]: With dead ends: 145 [2018-12-01 17:39:55,869 INFO L226 Difference]: Without dead ends: 145 [2018-12-01 17:39:55,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 17:39:55,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-01 17:39:55,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2018-12-01 17:39:55,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-01 17:39:55,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2018-12-01 17:39:55,871 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 29 [2018-12-01 17:39:55,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:55,871 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2018-12-01 17:39:55,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 17:39:55,872 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2018-12-01 17:39:55,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-01 17:39:55,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:55,872 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] [2018-12-01 17:39:55,872 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-01 17:39:55,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:55,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1379592124, now seen corresponding path program 1 times [2018-12-01 17:39:55,872 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 17:39:55,872 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 17:39:55,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:55,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:55,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 6 treesize of output 5 [2018-12-01 17:39:55,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:55,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:55,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-01 17:39:55,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:55,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:55,952 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-12-01 17:39:55,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:55,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:55,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-01 17:39:55,962 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 7 treesize of output 5 [2018-12-01 17:39:55,963 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-12-01 17:39:55,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:55,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:55,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:55,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:12, output treesize:4 [2018-12-01 17:39:55,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 17:39:55,966 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 17:39:55,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:55,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 17:39:55,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 17:39:55,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 17:39:55,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 17:39:55,968 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand 4 states. [2018-12-01 17:39:56,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:39:56,156 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2018-12-01 17:39:56,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 17:39:56,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-12-01 17:39:56,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:39:56,158 INFO L225 Difference]: With dead ends: 170 [2018-12-01 17:39:56,158 INFO L226 Difference]: Without dead ends: 170 [2018-12-01 17:39:56,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-12-01 17:39:56,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-01 17:39:56,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 141. [2018-12-01 17:39:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-01 17:39:56,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2018-12-01 17:39:56,160 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 30 [2018-12-01 17:39:56,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:39:56,161 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2018-12-01 17:39:56,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 17:39:56,161 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2018-12-01 17:39:56,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-01 17:39:56,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:39:56,161 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] [2018-12-01 17:39:56,162 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-01 17:39:56,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:39:56,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1365570400, now seen corresponding path program 1 times [2018-12-01 17:39:56,162 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 17:39:56,162 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 17:39:56,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:39:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:39:56,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:39:56,314 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-12-01 17:39:56,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:56,317 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-12-01 17:39:56,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-12-01 17:39:56,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:56,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:56,336 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-12-01 17:39:56,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:56,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:56,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-01 17:39:56,356 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-12-01 17:39:56,358 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-12-01 17:39:56,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:56,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:56,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:56,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-12-01 17:39:56,419 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 41 treesize of output 37 [2018-12-01 17:39:56,423 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 14 treesize of output 13 [2018-12-01 17:39:56,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:56,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:56,444 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-12-01 17:39:56,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-12-01 17:39:56,477 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 40 treesize of output 28 [2018-12-01 17:39:56,480 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-12-01 17:39:56,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:56,489 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 7 treesize of output 1 [2018-12-01 17:39:56,489 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:56,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:56,498 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-12-01 17:39:56,498 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-12-01 17:39:56,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:39:56,533 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 17:39:56,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 23 treesize of output 36 [2018-12-01 17:39:56,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:56,546 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-12-01 17:39:56,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:30 [2018-12-01 17:39:56,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-01 17:39:56,583 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 8 treesize of output 7 [2018-12-01 17:39:56,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:56,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:56,602 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-12-01 17:39:56,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:42 [2018-12-01 17:39:56,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-12-01 17:39:56,704 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 14 treesize of output 13 [2018-12-01 17:39:56,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:56,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:56,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 17:39:56,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-12-01 17:39:56,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, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2018-12-01 17:39:56,803 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 25 treesize of output 14 [2018-12-01 17:39:56,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:56,819 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 7 treesize of output 1 [2018-12-01 17:39:56,819 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 17:39:56,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:39:56,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-01 17:39:56,836 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:62, output treesize:30 [2018-12-01 17:39:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:39:57,003 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 17:39:57,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:39:57,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-01 17:39:57,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-01 17:39:57,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-01 17:39:57,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-12-01 17:39:57,006 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 17 states. [2018-12-01 17:40:01,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:40:01,710 INFO L93 Difference]: Finished difference Result 172 states and 182 transitions. [2018-12-01 17:40:01,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-01 17:40:01,710 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-12-01 17:40:01,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:40:01,711 INFO L225 Difference]: With dead ends: 172 [2018-12-01 17:40:01,711 INFO L226 Difference]: Without dead ends: 172 [2018-12-01 17:40:01,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=386, Invalid=1020, Unknown=0, NotChecked=0, Total=1406 [2018-12-01 17:40:01,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-01 17:40:01,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 140. [2018-12-01 17:40:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-01 17:40:01,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2018-12-01 17:40:01,713 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 32 [2018-12-01 17:40:01,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:40:01,713 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2018-12-01 17:40:01,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-01 17:40:01,713 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2018-12-01 17:40:01,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-01 17:40:01,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:40:01,713 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] [2018-12-01 17:40:01,713 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-01 17:40:01,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:40:01,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1365570399, now seen corresponding path program 1 times [2018-12-01 17:40:01,714 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 17:40:01,714 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 17:40:01,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:40:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:40:01,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:40:01,928 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-12-01 17:40:01,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:40:01,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:40:01,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-01 17:40:01,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:40:01,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:40:01,938 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-12-01 17:40:01,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:40:01,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:40:01,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-01 17:40:01,959 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-12-01 17:40:01,961 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-12-01 17:40:01,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:40:01,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:40:01,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:40:01,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-12-01 17:40:02,014 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 41 treesize of output 37 [2018-12-01 17:40:02,018 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 14 treesize of output 13 [2018-12-01 17:40:02,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:40:02,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:40:02,048 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-12-01 17:40:02,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-12-01 17:40:02,080 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 40 treesize of output 28 [2018-12-01 17:40:02,083 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 7 treesize of output 1 [2018-12-01 17:40:02,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:40:02,090 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-12-01 17:40:02,091 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 17:40:02,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:40:02,100 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-12-01 17:40:02,100 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-12-01 17:40:02,136 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-12-01 17:40:02,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-01 17:40:02,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 17:40:02,147 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 17:40:02,148 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 17 treesize of output 13 [2018-12-01 17:40:02,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:40:02,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:40:02,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:13 [2018-12-01 17:40:02,182 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-12-01 17:40:02,184 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-12-01 17:40:02,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:40:02,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:40:02,202 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-12-01 17:40:02,204 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-12-01 17:40:02,204 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:40:02,206 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:40:02,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:40:02,215 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-12-01 17:40:02,284 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 60 treesize of output 56 [2018-12-01 17:40:02,288 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 14 treesize of output 13 [2018-12-01 17:40:02,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:40:02,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:40:02,332 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 29 treesize of output 30 [2018-12-01 17:40:02,335 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 14 treesize of output 13 [2018-12-01 17:40:02,335 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:40:02,344 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:40:02,360 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-12-01 17:40:02,360 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-12-01 17:40:02,408 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 28 treesize of output 26 [2018-12-01 17:40:02,411 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 7 treesize of output 1 [2018-12-01 17:40:02,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:40:02,423 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-12-01 17:40:02,423 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 17:40:02,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:40:02,446 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-12-01 17:40:02,450 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 7 treesize of output 1 [2018-12-01 17:40:02,450 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 17:40:02,458 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-12-01 17:40:02,458 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 17:40:02,464 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:40:02,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:40:02,470 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-12-01 17:40:02,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:40:02,513 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 17:40:02,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:40:02,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-01 17:40:02,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-01 17:40:02,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-01 17:40:02,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-12-01 17:40:02,517 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 16 states. [2018-12-01 17:40:04,007 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-12-01 17:40:04,303 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2018-12-01 17:40:05,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:40:05,336 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2018-12-01 17:40:05,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-01 17:40:05,337 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-12-01 17:40:05,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:40:05,338 INFO L225 Difference]: With dead ends: 145 [2018-12-01 17:40:05,338 INFO L226 Difference]: Without dead ends: 145 [2018-12-01 17:40:05,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=318, Invalid=1088, Unknown=0, NotChecked=0, Total=1406 [2018-12-01 17:40:05,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-01 17:40:05,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 119. [2018-12-01 17:40:05,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-01 17:40:05,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-12-01 17:40:05,340 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 32 [2018-12-01 17:40:05,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:40:05,341 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-12-01 17:40:05,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-01 17:40:05,341 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-12-01 17:40:05,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-01 17:40:05,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:40:05,341 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-12-01 17:40:05,342 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-01 17:40:05,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:40:05,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1026314670, now seen corresponding path program 1 times [2018-12-01 17:40:05,342 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 17:40:05,342 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 17:40:05,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:40:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:40:05,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:40:05,424 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-12-01 17:40:05,426 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-12-01 17:40:05,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:40:05,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:40:05,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:40:05,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-01 17:40:05,436 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-12-01 17:40:05,438 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 3 [2018-12-01 17:40:05,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:40:05,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:40:05,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:40:05,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-01 17:40:05,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 17:40:05,445 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-01 17:40:05,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:40:05,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 17:40:05,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 17:40:05,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 17:40:05,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 17:40:05,447 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 4 states. [2018-12-01 17:40:05,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:40:05,639 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2018-12-01 17:40:05,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 17:40:05,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-01 17:40:05,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:40:05,641 INFO L225 Difference]: With dead ends: 127 [2018-12-01 17:40:05,641 INFO L226 Difference]: Without dead ends: 127 [2018-12-01 17:40:05,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 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-12-01 17:40:05,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-01 17:40:05,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2018-12-01 17:40:05,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-01 17:40:05,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-12-01 17:40:05,643 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 35 [2018-12-01 17:40:05,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:40:05,643 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-12-01 17:40:05,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 17:40:05,643 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-12-01 17:40:05,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-01 17:40:05,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:40:05,644 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, 1, 1] [2018-12-01 17:40:05,644 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-01 17:40:05,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:40:05,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1871682050, now seen corresponding path program 1 times [2018-12-01 17:40:05,644 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 17:40:05,644 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 17:40:05,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:40:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:40:05,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:40:05,735 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 19 treesize of output 16 [2018-12-01 17:40:05,738 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-12-01 17:40:05,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:40:05,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:40:05,749 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 19 treesize of output 16 [2018-12-01 17:40:05,750 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-12-01 17:40:05,750 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:40:05,751 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:40:05,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:40:05,752 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:3 [2018-12-01 17:40:05,809 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-12-01 17:40:05,811 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-12-01 17:40:05,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 17:40:05,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:40:05,821 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-12-01 17:40:05,822 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-12-01 17:40:05,822 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 17:40:05,824 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:40:05,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 17:40:05,828 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-12-01 17:40:05,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:40:05,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-01 17:40:05,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:40:05,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 17:40:05,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2018-12-01 17:40:05,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-01 17:40:05,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-01 17:40:05,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-12-01 17:40:05,963 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 14 states. [2018-12-01 17:40:07,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:40:07,338 INFO L93 Difference]: Finished difference Result 173 states and 183 transitions. [2018-12-01 17:40:07,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-01 17:40:07,338 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2018-12-01 17:40:07,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:40:07,339 INFO L225 Difference]: With dead ends: 173 [2018-12-01 17:40:07,339 INFO L226 Difference]: Without dead ends: 173 [2018-12-01 17:40:07,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-12-01 17:40:07,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-01 17:40:07,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 132. [2018-12-01 17:40:07,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-01 17:40:07,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2018-12-01 17:40:07,341 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 36 [2018-12-01 17:40:07,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:40:07,341 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2018-12-01 17:40:07,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-01 17:40:07,341 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2018-12-01 17:40:07,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-01 17:40:07,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:40:07,342 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, 1, 1] [2018-12-01 17:40:07,342 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION]=== [2018-12-01 17:40:07,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:40:07,342 INFO L82 PathProgramCache]: Analyzing trace with hash -2107399152, now seen corresponding path program 1 times [2018-12-01 17:40:07,342 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-01 17:40:07,342 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4dd2371-baed-47b9-9379-641e42802172/bin-2019/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-01 17:40:07,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:40:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:40:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:40:07,590 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-01 17:40:07,600 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-01 17:40:07,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 05:40:07 BoogieIcfgContainer [2018-12-01 17:40:07,611 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 17:40:07,611 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 17:40:07,611 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 17:40:07,611 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 17:40:07,612 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:39:42" (3/4) ... [2018-12-01 17:40:07,614 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 17:40:07,614 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 17:40:07,614 INFO L168 Benchmark]: Toolchain (without parser) took 26044.01 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 324.0 MB). Free memory was 938.0 MB in the beginning and 811.8 MB in the end (delta: 126.3 MB). Peak memory consumption was 450.3 MB. Max. memory is 11.5 GB. [2018-12-01 17:40:07,615 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:40:07,615 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -203.4 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2018-12-01 17:40:07,615 INFO L168 Benchmark]: Boogie Preprocessor took 36.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-01 17:40:07,615 INFO L168 Benchmark]: RCFGBuilder took 522.78 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: 78.0 MB). Peak memory consumption was 78.0 MB. Max. memory is 11.5 GB. [2018-12-01 17:40:07,615 INFO L168 Benchmark]: TraceAbstraction took 25206.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 811.8 MB in the end (delta: 245.0 MB). Peak memory consumption was 421.2 MB. Max. memory is 11.5 GB. [2018-12-01 17:40:07,615 INFO L168 Benchmark]: Witness Printer took 2.71 ms. Allocated memory is still 1.4 GB. Free memory is still 811.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:40:07,616 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 272.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -203.4 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 522.78 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: 78.0 MB). Peak memory consumption was 78.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25206.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 811.8 MB in the end (delta: 245.0 MB). Peak memory consumption was 421.2 MB. Max. memory is 11.5 GB. * Witness Printer took 2.71 ms. Allocated memory is still 1.4 GB. Free memory is still 811.8 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: [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L988] null->next = ((void*)0) VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L989] null->prev = ((void*)0) VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L990] null->colour = BLACK VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L993] list->next = null VAL [list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L994] list->prev = null VAL [list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L995] list->colour = BLACK VAL [list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L997] struct TSLL* end = list; VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1031] EXPR end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE null != end VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1034] EXPR end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next VAL [end={-2:0}, end->next={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1041] end = end->next [L1032] COND FALSE !(null != end) VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1045] COND TRUE null != list VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1047] EXPR list->colour VAL [end={1:0}, list={-2:0}, list->colour=1, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1047] COND FALSE !(RED == list->colour) [L1056] EXPR list->next VAL [end={1:0}, list={-2:0}, list->next={1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1056] end = list->next [L1057] free(list) VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1057] free(list) [L1058] list = end VAL [end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1045] COND FALSE !(null != list) VAL [end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1062] return 0; VAL [\result=0, end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 147 locations, 67 error locations. UNSAFE Result, 25.1s OverallTime, 22 OverallIterations, 2 TraceHistogramMax, 19.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1692 SDtfs, 3398 SDslu, 3328 SDs, 0 SdLazy, 5718 SolverSat, 348 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 12.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 654 GetRequests, 433 SyntacticMatches, 8 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=0, 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, 21 MinimizatonAttempts, 614 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 516 NumberOfCodeBlocks, 516 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 547 ConstructedInterpolants, 35 QuantifiedInterpolants, 122347 SizeOfPredicates, 149 NumberOfNonLiveVariables, 2271 ConjunctsInSsa, 199 ConjunctsInUnsatCore, 24 InterpolantComputations, 18 PerfectInterpolantSequences, 6/16 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...