./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4994e986-feb5-4b3b-92ed-b65081f3f5f9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4994e986-feb5-4b3b-92ed-b65081f3f5f9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4994e986-feb5-4b3b-92ed-b65081f3f5f9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4994e986-feb5-4b3b-92ed-b65081f3f5f9/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4994e986-feb5-4b3b-92ed-b65081f3f5f9/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4994e986-feb5-4b3b-92ed-b65081f3f5f9/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 1f270b702de634d3ad2ee5a400388c6410a4cf10 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 08:35:48,626 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:35:48,627 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:35:48,634 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:35:48,635 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:35:48,635 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:35:48,636 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:35:48,637 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:35:48,638 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:35:48,639 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:35:48,639 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:35:48,639 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:35:48,640 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:35:48,641 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:35:48,642 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:35:48,642 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:35:48,643 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:35:48,643 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:35:48,644 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:35:48,645 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:35:48,646 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:35:48,647 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:35:48,648 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:35:48,648 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:35:48,648 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:35:48,649 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:35:48,650 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:35:48,650 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:35:48,651 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:35:48,651 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:35:48,652 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:35:48,652 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:35:48,652 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:35:48,652 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:35:48,653 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:35:48,654 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:35:48,654 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4994e986-feb5-4b3b-92ed-b65081f3f5f9/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-18 08:35:48,661 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:35:48,662 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:35:48,662 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:35:48,663 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:35:48,663 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 08:35:48,663 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:35:48,663 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 08:35:48,663 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 08:35:48,663 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:35:48,663 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 08:35:48,663 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:35:48,664 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-18 08:35:48,664 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-18 08:35:48,664 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-18 08:35:48,664 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 08:35:48,664 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 08:35:48,664 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:35:48,664 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:35:48,664 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:35:48,665 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 08:35:48,669 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 08:35:48,669 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 08:35:48,669 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:35:48,669 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 08:35:48,669 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 08:35:48,669 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 08:35:48,669 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_4994e986-feb5-4b3b-92ed-b65081f3f5f9/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 -> 1f270b702de634d3ad2ee5a400388c6410a4cf10 [2018-11-18 08:35:48,691 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:35:48,699 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:35:48,701 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:35:48,702 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:35:48,702 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:35:48,703 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4994e986-feb5-4b3b-92ed-b65081f3f5f9/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-18 08:35:48,738 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4994e986-feb5-4b3b-92ed-b65081f3f5f9/bin-2019/uautomizer/data/b6216385c/2f5905de8a2e48b2b0d962eb5794d267/FLAG8a06b8f01 [2018-11-18 08:35:49,183 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:35:49,183 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4994e986-feb5-4b3b-92ed-b65081f3f5f9/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-18 08:35:49,194 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4994e986-feb5-4b3b-92ed-b65081f3f5f9/bin-2019/uautomizer/data/b6216385c/2f5905de8a2e48b2b0d962eb5794d267/FLAG8a06b8f01 [2018-11-18 08:35:49,204 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4994e986-feb5-4b3b-92ed-b65081f3f5f9/bin-2019/uautomizer/data/b6216385c/2f5905de8a2e48b2b0d962eb5794d267 [2018-11-18 08:35:49,206 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:35:49,207 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 08:35:49,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:35:49,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:35:49,210 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:35:49,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:35:49" (1/1) ... [2018-11-18 08:35:49,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@249d3f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:49, skipping insertion in model container [2018-11-18 08:35:49,213 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:35:49" (1/1) ... [2018-11-18 08:35:49,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:35:49,248 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:35:49,442 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:35:49,449 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:35:49,482 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:35:49,561 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:35:49,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:49 WrapperNode [2018-11-18 08:35:49,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:35:49,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:35:49,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:35:49,562 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:35:49,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:49" (1/1) ... [2018-11-18 08:35:49,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:49" (1/1) ... [2018-11-18 08:35:49,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:49" (1/1) ... [2018-11-18 08:35:49,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:49" (1/1) ... [2018-11-18 08:35:49,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:49" (1/1) ... [2018-11-18 08:35:49,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:49" (1/1) ... [2018-11-18 08:35:49,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:49" (1/1) ... [2018-11-18 08:35:49,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:35:49,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:35:49,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:35:49,604 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:35:49,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4994e986-feb5-4b3b-92ed-b65081f3f5f9/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 08:35:49,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 08:35:49,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:35:49,639 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 08:35:49,639 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-18 08:35:49,639 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-18 08:35:49,639 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-18 08:35:49,639 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-18 08:35:49,639 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-18 08:35:49,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-18 08:35:49,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-18 08:35:49,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-18 08:35:49,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-18 08:35:49,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-18 08:35:49,640 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-18 08:35:49,640 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-18 08:35:49,640 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-18 08:35:49,640 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-18 08:35:49,640 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-18 08:35:49,640 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-18 08:35:49,640 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-18 08:35:49,640 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-18 08:35:49,641 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-18 08:35:49,641 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-18 08:35:49,641 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-18 08:35:49,641 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-18 08:35:49,641 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-18 08:35:49,641 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-18 08:35:49,641 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-18 08:35:49,641 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-18 08:35:49,641 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-18 08:35:49,641 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-18 08:35:49,641 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-18 08:35:49,641 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-18 08:35:49,642 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-18 08:35:49,642 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-18 08:35:49,642 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-18 08:35:49,642 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-18 08:35:49,642 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-18 08:35:49,642 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-18 08:35:49,642 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-18 08:35:49,642 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-18 08:35:49,642 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-18 08:35:49,642 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-18 08:35:49,642 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-18 08:35:49,643 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-18 08:35:49,643 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-18 08:35:49,643 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-18 08:35:49,643 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-18 08:35:49,643 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-18 08:35:49,643 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-18 08:35:49,643 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-18 08:35:49,643 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-18 08:35:49,643 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-18 08:35:49,643 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 08:35:49,643 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 08:35:49,644 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 08:35:49,644 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-18 08:35:49,644 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-18 08:35:49,644 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-18 08:35:49,644 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-18 08:35:49,644 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-18 08:35:49,644 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-18 08:35:49,644 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-18 08:35:49,644 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-18 08:35:49,644 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-18 08:35:49,645 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-18 08:35:49,645 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 08:35:49,645 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-18 08:35:49,645 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-18 08:35:49,645 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-18 08:35:49,645 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-18 08:35:49,645 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-18 08:35:49,645 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-18 08:35:49,645 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-18 08:35:49,645 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-18 08:35:49,646 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-18 08:35:49,646 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-18 08:35:49,646 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-18 08:35:49,646 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-18 08:35:49,646 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-18 08:35:49,646 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-18 08:35:49,646 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-18 08:35:49,646 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-18 08:35:49,646 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-18 08:35:49,646 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-18 08:35:49,646 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-18 08:35:49,647 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-18 08:35:49,647 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-18 08:35:49,647 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-18 08:35:49,647 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-18 08:35:49,647 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-18 08:35:49,647 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-18 08:35:49,647 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-18 08:35:49,647 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-18 08:35:49,647 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-18 08:35:49,647 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-18 08:35:49,647 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-18 08:35:49,648 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-18 08:35:49,648 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-18 08:35:49,648 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-18 08:35:49,648 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-18 08:35:49,648 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-18 08:35:49,648 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-18 08:35:49,648 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-18 08:35:49,648 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-18 08:35:49,648 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-18 08:35:49,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 08:35:49,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 08:35:49,649 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 08:35:49,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 08:35:49,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 08:35:49,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 08:35:49,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 08:35:49,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 08:35:49,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 08:35:49,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 08:35:49,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:35:49,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 08:35:50,039 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:35:50,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:35:50 BoogieIcfgContainer [2018-11-18 08:35:50,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:35:50,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 08:35:50,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 08:35:50,043 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 08:35:50,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:35:49" (1/3) ... [2018-11-18 08:35:50,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a7fb8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:35:50, skipping insertion in model container [2018-11-18 08:35:50,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:49" (2/3) ... [2018-11-18 08:35:50,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a7fb8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:35:50, skipping insertion in model container [2018-11-18 08:35:50,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:35:50" (3/3) ... [2018-11-18 08:35:50,045 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-18 08:35:50,051 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 08:35:50,058 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 59 error locations. [2018-11-18 08:35:50,068 INFO L257 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2018-11-18 08:35:50,085 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:35:50,085 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 08:35:50,085 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-18 08:35:50,085 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 08:35:50,086 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:35:50,086 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:35:50,086 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 08:35:50,086 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:35:50,086 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 08:35:50,099 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2018-11-18 08:35:50,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 08:35:50,106 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:50,107 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:50,109 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2018-11-18 08:35:50,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:50,114 INFO L82 PathProgramCache]: Analyzing trace with hash 320379712, now seen corresponding path program 1 times [2018-11-18 08:35:50,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:50,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:50,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:50,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:50,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:50,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:50,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 08:35:50,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:50,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:50,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:50,237 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 3 states. [2018-11-18 08:35:50,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:50,395 INFO L93 Difference]: Finished difference Result 136 states and 142 transitions. [2018-11-18 08:35:50,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:50,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-18 08:35:50,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:50,406 INFO L225 Difference]: With dead ends: 136 [2018-11-18 08:35:50,406 INFO L226 Difference]: Without dead ends: 132 [2018-11-18 08:35:50,407 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:50,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-18 08:35:50,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2018-11-18 08:35:50,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-18 08:35:50,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 135 transitions. [2018-11-18 08:35:50,446 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 135 transitions. Word has length 7 [2018-11-18 08:35:50,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:50,447 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 135 transitions. [2018-11-18 08:35:50,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:50,447 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2018-11-18 08:35:50,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 08:35:50,447 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:50,447 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:50,448 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2018-11-18 08:35:50,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:50,448 INFO L82 PathProgramCache]: Analyzing trace with hash 320379713, now seen corresponding path program 1 times [2018-11-18 08:35:50,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:50,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:50,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:50,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:50,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:50,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:50,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 08:35:50,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 08:35:50,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 08:35:50,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:50,483 INFO L87 Difference]: Start difference. First operand 128 states and 135 transitions. Second operand 3 states. [2018-11-18 08:35:50,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:50,594 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2018-11-18 08:35:50,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 08:35:50,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-18 08:35:50,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:50,596 INFO L225 Difference]: With dead ends: 141 [2018-11-18 08:35:50,596 INFO L226 Difference]: Without dead ends: 141 [2018-11-18 08:35:50,596 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 08:35:50,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-18 08:35:50,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 132. [2018-11-18 08:35:50,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-18 08:35:50,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2018-11-18 08:35:50,604 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 7 [2018-11-18 08:35:50,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:50,604 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2018-11-18 08:35:50,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 08:35:50,604 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2018-11-18 08:35:50,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 08:35:50,605 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:50,605 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:50,605 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2018-11-18 08:35:50,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:50,606 INFO L82 PathProgramCache]: Analyzing trace with hash -168904850, now seen corresponding path program 1 times [2018-11-18 08:35:50,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:50,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:50,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:50,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:50,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:50,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:50,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:50,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:50,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:35:50,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:35:50,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:35:50,655 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand 4 states. [2018-11-18 08:35:50,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:50,796 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-11-18 08:35:50,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 08:35:50,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-18 08:35:50,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:50,798 INFO L225 Difference]: With dead ends: 140 [2018-11-18 08:35:50,798 INFO L226 Difference]: Without dead ends: 140 [2018-11-18 08:35:50,798 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:35:50,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-18 08:35:50,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 124. [2018-11-18 08:35:50,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-18 08:35:50,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-11-18 08:35:50,804 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 14 [2018-11-18 08:35:50,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:50,804 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-11-18 08:35:50,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:35:50,805 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-11-18 08:35:50,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 08:35:50,805 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:50,805 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:50,806 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2018-11-18 08:35:50,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:50,806 INFO L82 PathProgramCache]: Analyzing trace with hash -168904849, now seen corresponding path program 1 times [2018-11-18 08:35:50,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:50,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:50,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:50,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:50,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:50,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:50,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 08:35:50,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:35:50,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:35:50,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:35:50,866 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 4 states. [2018-11-18 08:35:50,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:50,991 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2018-11-18 08:35:50,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:35:50,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-18 08:35:50,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:50,992 INFO L225 Difference]: With dead ends: 164 [2018-11-18 08:35:50,992 INFO L226 Difference]: Without dead ends: 164 [2018-11-18 08:35:50,993 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:35:50,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-18 08:35:50,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 138. [2018-11-18 08:35:50,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-18 08:35:50,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 151 transitions. [2018-11-18 08:35:50,999 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 151 transitions. Word has length 14 [2018-11-18 08:35:51,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:51,000 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 151 transitions. [2018-11-18 08:35:51,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:35:51,000 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 151 transitions. [2018-11-18 08:35:51,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 08:35:51,001 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:51,001 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:51,001 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2018-11-18 08:35:51,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:51,001 INFO L82 PathProgramCache]: Analyzing trace with hash 891196306, now seen corresponding path program 1 times [2018-11-18 08:35:51,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:51,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:51,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:51,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:51,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:51,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:51,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:51,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:35:51,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 08:35:51,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:35:51,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:35:51,061 INFO L87 Difference]: Start difference. First operand 138 states and 151 transitions. Second operand 5 states. [2018-11-18 08:35:51,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:51,233 INFO L93 Difference]: Finished difference Result 217 states and 237 transitions. [2018-11-18 08:35:51,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 08:35:51,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-18 08:35:51,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:51,234 INFO L225 Difference]: With dead ends: 217 [2018-11-18 08:35:51,234 INFO L226 Difference]: Without dead ends: 217 [2018-11-18 08:35:51,234 INFO L604 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-11-18 08:35:51,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-18 08:35:51,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 137. [2018-11-18 08:35:51,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-18 08:35:51,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2018-11-18 08:35:51,240 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 16 [2018-11-18 08:35:51,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:51,241 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2018-11-18 08:35:51,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 08:35:51,241 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2018-11-18 08:35:51,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 08:35:51,241 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:51,241 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:51,242 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2018-11-18 08:35:51,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:51,242 INFO L82 PathProgramCache]: Analyzing trace with hash 891196305, now seen corresponding path program 1 times [2018-11-18 08:35:51,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:51,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:51,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:51,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:51,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:51,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:51,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:51,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:35:51,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 08:35:51,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:35:51,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:35:51,279 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand 5 states. [2018-11-18 08:35:51,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:51,422 INFO L93 Difference]: Finished difference Result 193 states and 210 transitions. [2018-11-18 08:35:51,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 08:35:51,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-18 08:35:51,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:51,423 INFO L225 Difference]: With dead ends: 193 [2018-11-18 08:35:51,423 INFO L226 Difference]: Without dead ends: 193 [2018-11-18 08:35:51,424 INFO L604 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-11-18 08:35:51,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-18 08:35:51,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 136. [2018-11-18 08:35:51,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-18 08:35:51,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-11-18 08:35:51,429 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 16 [2018-11-18 08:35:51,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:51,429 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-11-18 08:35:51,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 08:35:51,429 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-11-18 08:35:51,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 08:35:51,430 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:51,430 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:51,430 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2018-11-18 08:35:51,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:51,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1785081837, now seen corresponding path program 1 times [2018-11-18 08:35:51,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:51,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:51,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:51,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:51,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:51,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:51,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:51,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 08:35:51,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 08:35:51,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 08:35:51,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 08:35:51,543 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 9 states. [2018-11-18 08:35:51,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:51,794 INFO L93 Difference]: Finished difference Result 150 states and 160 transitions. [2018-11-18 08:35:51,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 08:35:51,794 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-11-18 08:35:51,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:51,797 INFO L225 Difference]: With dead ends: 150 [2018-11-18 08:35:51,798 INFO L226 Difference]: Without dead ends: 150 [2018-11-18 08:35:51,798 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-11-18 08:35:51,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-18 08:35:51,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 135. [2018-11-18 08:35:51,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-18 08:35:51,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2018-11-18 08:35:51,804 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 20 [2018-11-18 08:35:51,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:51,804 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2018-11-18 08:35:51,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 08:35:51,804 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2018-11-18 08:35:51,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 08:35:51,806 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:51,806 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:51,806 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2018-11-18 08:35:51,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:51,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1785081836, now seen corresponding path program 1 times [2018-11-18 08:35:51,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:51,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:51,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:51,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:51,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:51,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:51,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:51,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 08:35:51,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 08:35:51,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 08:35:51,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-18 08:35:51,914 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand 10 states. [2018-11-18 08:35:52,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:52,265 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2018-11-18 08:35:52,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 08:35:52,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-18 08:35:52,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:52,266 INFO L225 Difference]: With dead ends: 154 [2018-11-18 08:35:52,266 INFO L226 Difference]: Without dead ends: 154 [2018-11-18 08:35:52,266 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 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-11-18 08:35:52,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-18 08:35:52,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 129. [2018-11-18 08:35:52,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-18 08:35:52,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2018-11-18 08:35:52,269 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 20 [2018-11-18 08:35:52,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:52,269 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2018-11-18 08:35:52,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 08:35:52,269 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2018-11-18 08:35:52,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 08:35:52,270 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:52,270 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:52,270 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2018-11-18 08:35:52,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:52,271 INFO L82 PathProgramCache]: Analyzing trace with hash -984583680, now seen corresponding path program 1 times [2018-11-18 08:35:52,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:52,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:52,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:52,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:52,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:52,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:52,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:52,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:35:52,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 08:35:52,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 08:35:52,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 08:35:52,310 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand 4 states. [2018-11-18 08:35:52,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:52,376 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2018-11-18 08:35:52,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 08:35:52,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-18 08:35:52,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:52,378 INFO L225 Difference]: With dead ends: 147 [2018-11-18 08:35:52,378 INFO L226 Difference]: Without dead ends: 147 [2018-11-18 08:35:52,378 INFO L604 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-11-18 08:35:52,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-18 08:35:52,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 129. [2018-11-18 08:35:52,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-18 08:35:52,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2018-11-18 08:35:52,380 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 27 [2018-11-18 08:35:52,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:52,381 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2018-11-18 08:35:52,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 08:35:52,381 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2018-11-18 08:35:52,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 08:35:52,381 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:52,381 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:52,382 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2018-11-18 08:35:52,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:52,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1377317827, now seen corresponding path program 1 times [2018-11-18 08:35:52,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:52,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:52,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:52,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:52,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:52,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:52,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:52,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:35:52,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 08:35:52,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:35:52,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:35:52,426 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand 5 states. [2018-11-18 08:35:52,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:52,610 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2018-11-18 08:35:52,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 08:35:52,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-18 08:35:52,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:52,612 INFO L225 Difference]: With dead ends: 197 [2018-11-18 08:35:52,612 INFO L226 Difference]: Without dead ends: 197 [2018-11-18 08:35:52,612 INFO L604 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-11-18 08:35:52,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-18 08:35:52,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 128. [2018-11-18 08:35:52,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-18 08:35:52,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2018-11-18 08:35:52,615 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 27 [2018-11-18 08:35:52,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:52,616 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2018-11-18 08:35:52,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 08:35:52,616 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-11-18 08:35:52,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 08:35:52,616 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:52,618 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:52,618 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2018-11-18 08:35:52,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:52,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1377317826, now seen corresponding path program 1 times [2018-11-18 08:35:52,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:52,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:52,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:52,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:52,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:52,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:52,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 08:35:52,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 08:35:52,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:35:52,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:35:52,672 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 5 states. [2018-11-18 08:35:52,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:52,884 INFO L93 Difference]: Finished difference Result 222 states and 239 transitions. [2018-11-18 08:35:52,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 08:35:52,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-18 08:35:52,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:52,885 INFO L225 Difference]: With dead ends: 222 [2018-11-18 08:35:52,885 INFO L226 Difference]: Without dead ends: 222 [2018-11-18 08:35:52,885 INFO L604 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-11-18 08:35:52,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-11-18 08:35:52,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 127. [2018-11-18 08:35:52,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-18 08:35:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2018-11-18 08:35:52,889 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 27 [2018-11-18 08:35:52,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:52,889 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2018-11-18 08:35:52,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 08:35:52,889 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2018-11-18 08:35:52,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 08:35:52,889 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:52,890 INFO L375 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-11-18 08:35:52,890 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2018-11-18 08:35:52,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:52,890 INFO L82 PathProgramCache]: Analyzing trace with hash -443969435, now seen corresponding path program 1 times [2018-11-18 08:35:52,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:52,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:52,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:52,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:52,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:52,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:52,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:52,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:35:52,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 08:35:52,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:35:52,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:35:52,963 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand 5 states. [2018-11-18 08:35:53,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:53,074 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2018-11-18 08:35:53,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 08:35:53,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-18 08:35:53,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:53,075 INFO L225 Difference]: With dead ends: 137 [2018-11-18 08:35:53,075 INFO L226 Difference]: Without dead ends: 137 [2018-11-18 08:35:53,076 INFO L604 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-11-18 08:35:53,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-18 08:35:53,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 126. [2018-11-18 08:35:53,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-18 08:35:53,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2018-11-18 08:35:53,079 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 28 [2018-11-18 08:35:53,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:53,079 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2018-11-18 08:35:53,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 08:35:53,083 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2018-11-18 08:35:53,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 08:35:53,084 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:53,084 INFO L375 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-11-18 08:35:53,084 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2018-11-18 08:35:53,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:53,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1601377729, now seen corresponding path program 1 times [2018-11-18 08:35:53,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:53,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:53,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:53,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:53,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:53,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:53,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 08:35:53,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 08:35:53,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 08:35:53,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-18 08:35:53,158 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 8 states. [2018-11-18 08:35:53,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:53,375 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-11-18 08:35:53,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 08:35:53,376 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-11-18 08:35:53,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:53,377 INFO L225 Difference]: With dead ends: 131 [2018-11-18 08:35:53,377 INFO L226 Difference]: Without dead ends: 131 [2018-11-18 08:35:53,377 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-18 08:35:53,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-18 08:35:53,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 125. [2018-11-18 08:35:53,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-18 08:35:53,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2018-11-18 08:35:53,380 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 31 [2018-11-18 08:35:53,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:53,380 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2018-11-18 08:35:53,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 08:35:53,380 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2018-11-18 08:35:53,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 08:35:53,383 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:53,383 INFO L375 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-11-18 08:35:53,383 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2018-11-18 08:35:53,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:53,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1601377728, now seen corresponding path program 1 times [2018-11-18 08:35:53,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:53,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:53,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:53,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:53,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:53,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:53,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:53,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 08:35:53,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 08:35:53,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 08:35:53,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 08:35:53,495 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand 9 states. [2018-11-18 08:35:53,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:53,755 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-11-18 08:35:53,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 08:35:53,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-18 08:35:53,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:53,756 INFO L225 Difference]: With dead ends: 128 [2018-11-18 08:35:53,756 INFO L226 Difference]: Without dead ends: 128 [2018-11-18 08:35:53,756 INFO L604 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-11-18 08:35:53,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-18 08:35:53,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 112. [2018-11-18 08:35:53,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-18 08:35:53,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-11-18 08:35:53,759 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 31 [2018-11-18 08:35:53,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:53,759 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-11-18 08:35:53,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 08:35:53,759 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-11-18 08:35:53,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 08:35:53,761 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:53,761 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:53,761 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2018-11-18 08:35:53,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:53,762 INFO L82 PathProgramCache]: Analyzing trace with hash 663401767, now seen corresponding path program 1 times [2018-11-18 08:35:53,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:53,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:53,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:53,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:53,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:53,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:53,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 08:35:53,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 08:35:53,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 08:35:53,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 08:35:53,839 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 5 states. [2018-11-18 08:35:53,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:53,937 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2018-11-18 08:35:53,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 08:35:53,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-18 08:35:53,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:53,938 INFO L225 Difference]: With dead ends: 131 [2018-11-18 08:35:53,938 INFO L226 Difference]: Without dead ends: 116 [2018-11-18 08:35:53,938 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 08:35:53,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-18 08:35:53,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2018-11-18 08:35:53,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-18 08:35:53,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2018-11-18 08:35:53,941 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 34 [2018-11-18 08:35:53,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:53,941 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2018-11-18 08:35:53,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 08:35:53,941 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2018-11-18 08:35:53,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 08:35:53,942 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:53,942 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:53,942 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2018-11-18 08:35:53,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:53,943 INFO L82 PathProgramCache]: Analyzing trace with hash 792176949, now seen corresponding path program 1 times [2018-11-18 08:35:53,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:53,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:53,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:53,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:53,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:54,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:54,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:35:54,205 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4994e986-feb5-4b3b-92ed-b65081f3f5f9/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:35:54,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:54,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:54,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 08:35:54,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:54,312 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:54,312 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:54,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 08:35:54,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:54,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:54,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-18 08:35:54,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 08:35:54,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 08:35:54,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:54,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:54,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 08:35:54,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 08:35:54,386 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:54,389 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:54,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:54,398 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-11-18 08:35:54,463 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:54,466 INFO L477 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 64 [2018-11-18 08:35:54,470 INFO L477 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-11-18 08:35:54,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:54,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:54,490 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:54,493 INFO L477 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-11-18 08:35:54,495 INFO L477 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-11-18 08:35:54,496 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:54,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:54,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:35:54,507 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-11-18 08:35:54,614 INFO L477 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 82 treesize of output 72 [2018-11-18 08:35:54,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-11-18 08:35:54,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 08:35:54,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:35:54,661 INFO L477 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 73 treesize of output 60 [2018-11-18 08:35:54,665 INFO L477 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 20 treesize of output 17 [2018-11-18 08:35:54,665 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:54,672 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:54,677 INFO L477 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 81 treesize of output 68 [2018-11-18 08:35:54,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-11-18 08:35:54,686 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-18 08:35:54,700 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:35:54,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-18 08:35:54,721 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:89, output treesize:121 [2018-11-18 08:35:54,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-11-18 08:35:54,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-11-18 08:35:54,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:54,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 08:35:54,832 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:54,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:54,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-18 08:35:54,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 08:35:54,846 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:54,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 08:35:54,851 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:54,852 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:54,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:54,856 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-11-18 08:35:54,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:54,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:35:54,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 28 [2018-11-18 08:35:54,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-18 08:35:54,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-18 08:35:54,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2018-11-18 08:35:54,937 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand 29 states. [2018-11-18 08:35:56,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:56,241 INFO L93 Difference]: Finished difference Result 237 states and 254 transitions. [2018-11-18 08:35:56,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-18 08:35:56,241 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 47 [2018-11-18 08:35:56,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:56,242 INFO L225 Difference]: With dead ends: 237 [2018-11-18 08:35:56,242 INFO L226 Difference]: Without dead ends: 237 [2018-11-18 08:35:56,243 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=470, Invalid=2178, Unknown=4, NotChecked=0, Total=2652 [2018-11-18 08:35:56,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-11-18 08:35:56,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 151. [2018-11-18 08:35:56,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-18 08:35:56,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2018-11-18 08:35:56,247 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 47 [2018-11-18 08:35:56,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:56,247 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2018-11-18 08:35:56,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-18 08:35:56,247 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2018-11-18 08:35:56,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 08:35:56,248 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:56,248 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:56,248 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2018-11-18 08:35:56,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:56,249 INFO L82 PathProgramCache]: Analyzing trace with hash 792176948, now seen corresponding path program 1 times [2018-11-18 08:35:56,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:56,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:56,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:56,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:56,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:56,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:56,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:35:56,409 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4994e986-feb5-4b3b-92ed-b65081f3f5f9/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:35:56,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:56,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:56,468 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:56,468 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:56,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-18 08:35:56,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:56,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:56,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-11-18 08:35:56,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 08:35:56,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 08:35:56,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:56,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:56,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:56,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-11-18 08:35:56,530 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:56,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43 [2018-11-18 08:35:56,535 INFO L477 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-11-18 08:35:56,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:56,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:56,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:35:56,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-11-18 08:35:56,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-11-18 08:35:56,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-11-18 08:35:56,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 08:35:56,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:35:56,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-18 08:35:56,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:82 [2018-11-18 08:35:56,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-11-18 08:35:56,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-18 08:35:56,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:56,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 08:35:56,744 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:56,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:56,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:35:56,751 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-11-18 08:35:56,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:56,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:35:56,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2018-11-18 08:35:56,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-18 08:35:56,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-18 08:35:56,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2018-11-18 08:35:56,805 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand 25 states. [2018-11-18 08:35:57,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:57,797 INFO L93 Difference]: Finished difference Result 221 states and 235 transitions. [2018-11-18 08:35:57,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-18 08:35:57,797 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2018-11-18 08:35:57,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:35:57,798 INFO L225 Difference]: With dead ends: 221 [2018-11-18 08:35:57,798 INFO L226 Difference]: Without dead ends: 221 [2018-11-18 08:35:57,798 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=571, Invalid=1869, Unknown=10, NotChecked=0, Total=2450 [2018-11-18 08:35:57,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-11-18 08:35:57,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 151. [2018-11-18 08:35:57,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-18 08:35:57,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2018-11-18 08:35:57,800 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 47 [2018-11-18 08:35:57,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:35:57,801 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2018-11-18 08:35:57,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-18 08:35:57,801 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2018-11-18 08:35:57,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 08:35:57,802 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:35:57,802 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:57,802 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2018-11-18 08:35:57,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:57,802 INFO L82 PathProgramCache]: Analyzing trace with hash 206005430, now seen corresponding path program 1 times [2018-11-18 08:35:57,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:57,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:57,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:57,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:57,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:58,440 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:58,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:35:58,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4994e986-feb5-4b3b-92ed-b65081f3f5f9/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:35:58,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:58,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:58,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 08:35:58,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:58,502 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:58,503 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:58,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 08:35:58,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:58,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:58,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-18 08:35:58,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 08:35:58,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 08:35:58,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:58,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:58,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 08:35:58,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 08:35:58,540 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:58,541 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:58,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:58,548 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-11-18 08:35:58,591 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:58,594 INFO L477 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-11-18 08:35:58,596 INFO L477 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-11-18 08:35:58,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:58,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:58,609 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:35:58,611 INFO L477 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 56 [2018-11-18 08:35:58,613 INFO L477 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-11-18 08:35:58,613 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:58,618 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:58,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:35:58,625 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-11-18 08:35:58,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2018-11-18 08:35:58,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-11-18 08:35:58,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 08:35:58,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:35:58,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 75 [2018-11-18 08:35:58,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 08:35:58,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-18 08:35:58,781 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:35:58,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67 [2018-11-18 08:35:58,789 INFO L477 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 16 treesize of output 13 [2018-11-18 08:35:58,790 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:58,797 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:58,826 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 2 xjuncts. [2018-11-18 08:35:58,827 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:83, output treesize:129 [2018-11-18 08:35:58,878 INFO L477 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 3 [2018-11-18 08:35:58,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:58,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-11-18 08:35:58,892 INFO L477 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-11-18 08:35:58,892 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:58,897 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:58,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:35:58,905 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:82, output treesize:57 [2018-11-18 08:35:58,980 INFO L477 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 51 treesize of output 37 [2018-11-18 08:35:58,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 08:35:58,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:58,988 INFO L477 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 32 treesize of output 21 [2018-11-18 08:35:58,988 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:58,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:58,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-18 08:35:59,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 08:35:59,001 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:59,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 08:35:59,005 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:59,006 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:59,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:35:59,011 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:71, output treesize:19 [2018-11-18 08:35:59,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-18 08:35:59,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-11-18 08:35:59,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 08:35:59,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:35:59,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:35:59,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-11-18 08:35:59,175 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:59,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:35:59,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 38 [2018-11-18 08:35:59,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-18 08:35:59,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-18 08:35:59,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1290, Unknown=0, NotChecked=0, Total=1406 [2018-11-18 08:35:59,201 INFO L87 Difference]: Start difference. First operand 151 states and 162 transitions. Second operand 38 states. [2018-11-18 08:36:01,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:36:01,594 INFO L93 Difference]: Finished difference Result 222 states and 235 transitions. [2018-11-18 08:36:01,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-18 08:36:01,594 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 51 [2018-11-18 08:36:01,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:36:01,595 INFO L225 Difference]: With dead ends: 222 [2018-11-18 08:36:01,595 INFO L226 Difference]: Without dead ends: 221 [2018-11-18 08:36:01,596 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=607, Invalid=3680, Unknown=3, NotChecked=0, Total=4290 [2018-11-18 08:36:01,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-11-18 08:36:01,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 148. [2018-11-18 08:36:01,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-18 08:36:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2018-11-18 08:36:01,599 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 51 [2018-11-18 08:36:01,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:36:01,599 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2018-11-18 08:36:01,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-18 08:36:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2018-11-18 08:36:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 08:36:01,600 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:36:01,600 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:36:01,600 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2018-11-18 08:36:01,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:36:01,601 INFO L82 PathProgramCache]: Analyzing trace with hash -152470231, now seen corresponding path program 1 times [2018-11-18 08:36:01,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:36:01,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:36:01,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:36:01,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:36:01,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:36:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:36:01,644 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 08:36:01,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:36:01,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 08:36:01,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 08:36:01,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 08:36:01,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 08:36:01,645 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand 6 states. [2018-11-18 08:36:01,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:36:01,745 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-11-18 08:36:01,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 08:36:01,745 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-11-18 08:36:01,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:36:01,746 INFO L225 Difference]: With dead ends: 116 [2018-11-18 08:36:01,746 INFO L226 Difference]: Without dead ends: 116 [2018-11-18 08:36:01,746 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-18 08:36:01,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-18 08:36:01,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2018-11-18 08:36:01,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-18 08:36:01,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2018-11-18 08:36:01,749 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 55 [2018-11-18 08:36:01,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:36:01,749 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2018-11-18 08:36:01,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 08:36:01,749 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2018-11-18 08:36:01,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 08:36:01,750 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:36:01,750 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:36:01,750 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2018-11-18 08:36:01,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:36:01,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1830599194, now seen corresponding path program 1 times [2018-11-18 08:36:01,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:36:01,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:36:01,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:36:01,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:36:01,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:36:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:36:02,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:36:02,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:36:02,109 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4994e986-feb5-4b3b-92ed-b65081f3f5f9/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:36:02,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:36:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:36:02,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:36:02,157 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:02,159 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:02,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 08:36:02,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:02,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:02,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-11-18 08:36:02,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 08:36:02,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 08:36:02,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:02,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:02,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 08:36:02,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 08:36:02,210 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:02,212 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:02,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:02,222 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-11-18 08:36:02,265 INFO L477 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 51 treesize of output 47 [2018-11-18 08:36:02,267 INFO L477 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-11-18 08:36:02,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:02,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:02,285 INFO L477 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-11-18 08:36:02,287 INFO L477 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-11-18 08:36:02,287 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:02,291 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:02,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:36:02,299 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-11-18 08:36:02,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2018-11-18 08:36:02,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 08:36:02,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 08:36:02,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:36:02,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2018-11-18 08:36:02,438 INFO L477 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 20 treesize of output 17 [2018-11-18 08:36:02,439 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:02,445 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:02,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 68 [2018-11-18 08:36:02,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-11-18 08:36:02,458 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-18 08:36:02,471 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:36:02,494 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 2 xjuncts. [2018-11-18 08:36:02,494 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:84, output treesize:137 [2018-11-18 08:36:02,577 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:02,578 INFO L477 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 21 [2018-11-18 08:36:02,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:02,592 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:02,593 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:02,594 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:02,594 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:02,595 INFO L477 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 16 treesize of output 13 [2018-11-18 08:36:02,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:02,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:02,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:68 [2018-11-18 08:36:02,637 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:02,640 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-11-18 08:36:02,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-18 08:36:02,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:02,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:02,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-11-18 08:36:02,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-11-18 08:36:02,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:02,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:02,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:02,683 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:62 [2018-11-18 08:36:02,740 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:02,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 94 [2018-11-18 08:36:02,748 INFO L477 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-11-18 08:36:02,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:02,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:02,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-18 08:36:02,777 INFO L477 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-11-18 08:36:02,777 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:02,782 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:02,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:36:02,793 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:104, output treesize:88 [2018-11-18 08:36:02,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 114 [2018-11-18 08:36:02,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 43 [2018-11-18 08:36:02,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 08:36:02,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:36:02,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 127 [2018-11-18 08:36:03,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 39 [2018-11-18 08:36:03,000 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-18 08:36:03,017 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:36:03,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 111 [2018-11-18 08:36:03,023 INFO L477 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 24 treesize of output 21 [2018-11-18 08:36:03,023 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:03,033 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:03,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-18 08:36:03,067 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:163, output treesize:241 [2018-11-18 08:36:03,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 61 [2018-11-18 08:36:03,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-11-18 08:36:03,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:03,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 08:36:03,209 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:03,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-11-18 08:36:03,218 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:36:03,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:36:03,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-18 08:36:03,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 08:36:03,239 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:03,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 08:36:03,244 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:03,245 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:03,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:36:03,253 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:115, output treesize:18 [2018-11-18 08:36:03,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:36:03,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:36:03,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 36 [2018-11-18 08:36:03,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-18 08:36:03,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-18 08:36:03,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1192, Unknown=0, NotChecked=0, Total=1332 [2018-11-18 08:36:03,353 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand 37 states. [2018-11-18 08:36:04,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:36:04,802 INFO L93 Difference]: Finished difference Result 217 states and 229 transitions. [2018-11-18 08:36:04,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-18 08:36:04,802 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 56 [2018-11-18 08:36:04,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:36:04,803 INFO L225 Difference]: With dead ends: 217 [2018-11-18 08:36:04,803 INFO L226 Difference]: Without dead ends: 217 [2018-11-18 08:36:04,803 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=443, Invalid=3463, Unknown=0, NotChecked=0, Total=3906 [2018-11-18 08:36:04,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-18 08:36:04,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 144. [2018-11-18 08:36:04,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-18 08:36:04,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2018-11-18 08:36:04,810 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 56 [2018-11-18 08:36:04,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:36:04,810 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2018-11-18 08:36:04,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-18 08:36:04,810 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-11-18 08:36:04,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 08:36:04,811 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:36:04,811 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:36:04,811 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2018-11-18 08:36:04,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:36:04,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1830599195, now seen corresponding path program 1 times [2018-11-18 08:36:04,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:36:04,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:36:04,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:36:04,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:36:04,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:36:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:36:05,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:36:05,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:36:05,039 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4994e986-feb5-4b3b-92ed-b65081f3f5f9/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:36:05,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:36:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:36:05,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:36:05,105 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:05,106 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:05,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 08:36:05,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:05,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:05,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-11-18 08:36:05,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 08:36:05,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 08:36:05,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:05,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:05,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:05,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-11-18 08:36:05,149 INFO L477 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 30 treesize of output 26 [2018-11-18 08:36:05,150 INFO L477 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-11-18 08:36:05,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:05,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:05,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:36:05,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-11-18 08:36:05,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-11-18 08:36:05,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 08:36:05,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 08:36:05,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:36:05,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 08:36:05,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:76 [2018-11-18 08:36:05,292 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:05,292 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:05,293 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:05,294 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:05,294 INFO L477 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 16 treesize of output 13 [2018-11-18 08:36:05,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:05,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:05,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:31 [2018-11-18 08:36:05,319 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:05,322 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-18 08:36:05,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-18 08:36:05,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:05,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:05,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:05,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:37 [2018-11-18 08:36:05,372 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:05,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 53 [2018-11-18 08:36:05,380 INFO L477 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-11-18 08:36:05,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:05,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:05,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:36:05,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-11-18 08:36:05,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 71 [2018-11-18 08:36:05,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 43 [2018-11-18 08:36:05,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 08:36:05,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:36:05,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-18 08:36:05,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:94, output treesize:144 [2018-11-18 08:36:05,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 43 [2018-11-18 08:36:05,588 INFO L477 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 27 treesize of output 16 [2018-11-18 08:36:05,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:05,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-18 08:36:05,595 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:05,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 08:36:05,599 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:05,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:05,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:05,604 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:68, output treesize:5 [2018-11-18 08:36:05,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:36:05,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:36:05,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 32 [2018-11-18 08:36:05,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-18 08:36:05,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-18 08:36:05,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=924, Unknown=0, NotChecked=0, Total=1056 [2018-11-18 08:36:05,638 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand 33 states. [2018-11-18 08:36:06,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:36:06,871 INFO L93 Difference]: Finished difference Result 223 states and 232 transitions. [2018-11-18 08:36:06,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-18 08:36:06,872 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 56 [2018-11-18 08:36:06,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:36:06,873 INFO L225 Difference]: With dead ends: 223 [2018-11-18 08:36:06,873 INFO L226 Difference]: Without dead ends: 223 [2018-11-18 08:36:06,874 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=498, Invalid=3036, Unknown=6, NotChecked=0, Total=3540 [2018-11-18 08:36:06,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-18 08:36:06,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 144. [2018-11-18 08:36:06,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-18 08:36:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2018-11-18 08:36:06,877 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 56 [2018-11-18 08:36:06,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:36:06,878 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2018-11-18 08:36:06,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-18 08:36:06,878 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2018-11-18 08:36:06,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-18 08:36:06,878 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:36:06,878 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:36:06,879 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2018-11-18 08:36:06,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:36:06,879 INFO L82 PathProgramCache]: Analyzing trace with hash -227391304, now seen corresponding path program 2 times [2018-11-18 08:36:06,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:36:06,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:36:06,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:36:06,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:36:06,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:36:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:36:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:36:07,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:36:07,152 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4994e986-feb5-4b3b-92ed-b65081f3f5f9/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:36:07,160 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 08:36:07,185 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 08:36:07,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:36:07,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:36:07,209 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:07,210 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:07,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 08:36:07,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:07,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:07,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-11-18 08:36:07,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 08:36:07,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 08:36:07,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:07,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:07,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 08:36:07,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 08:36:07,255 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:07,257 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:07,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:07,264 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-11-18 08:36:07,302 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:07,306 INFO L477 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 51 treesize of output 55 [2018-11-18 08:36:07,308 INFO L477 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-11-18 08:36:07,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:07,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:07,325 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:07,328 INFO L477 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-11-18 08:36:07,330 INFO L477 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-11-18 08:36:07,330 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:07,334 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:07,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:36:07,342 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-11-18 08:36:07,426 INFO L477 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 81 treesize of output 71 [2018-11-18 08:36:07,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 39 [2018-11-18 08:36:07,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 08:36:07,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:36:07,474 INFO L477 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 80 treesize of output 67 [2018-11-18 08:36:07,478 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:36:07,479 INFO L477 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 24 treesize of output 43 [2018-11-18 08:36:07,479 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:07,488 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:07,491 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:36:07,491 INFO L477 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 76 treesize of output 72 [2018-11-18 08:36:07,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 39 [2018-11-18 08:36:07,494 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:07,501 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:07,520 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 2 xjuncts. [2018-11-18 08:36:07,520 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:91, output treesize:125 [2018-11-18 08:36:07,684 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:36:07,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 69 [2018-11-18 08:36:07,688 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:36:07,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-11-18 08:36:07,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:07,697 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:36:07,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2018-11-18 08:36:07,698 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:36:07,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:36:07,712 INFO L477 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 37 treesize of output 29 [2018-11-18 08:36:07,714 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:36:07,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 08:36:07,715 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:07,721 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:36:07,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-18 08:36:07,722 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:07,725 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:07,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:07,730 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:82, output treesize:7 [2018-11-18 08:36:07,749 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:36:07,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:36:07,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 30 [2018-11-18 08:36:07,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-18 08:36:07,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-18 08:36:07,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=762, Unknown=2, NotChecked=0, Total=870 [2018-11-18 08:36:07,765 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 30 states. [2018-11-18 08:36:08,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:36:08,583 INFO L93 Difference]: Finished difference Result 163 states and 170 transitions. [2018-11-18 08:36:08,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 08:36:08,584 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 57 [2018-11-18 08:36:08,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:36:08,585 INFO L225 Difference]: With dead ends: 163 [2018-11-18 08:36:08,585 INFO L226 Difference]: Without dead ends: 138 [2018-11-18 08:36:08,586 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=310, Invalid=1758, Unknown=2, NotChecked=0, Total=2070 [2018-11-18 08:36:08,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-18 08:36:08,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 126. [2018-11-18 08:36:08,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-18 08:36:08,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 133 transitions. [2018-11-18 08:36:08,588 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 133 transitions. Word has length 57 [2018-11-18 08:36:08,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:36:08,588 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 133 transitions. [2018-11-18 08:36:08,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-18 08:36:08,589 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2018-11-18 08:36:08,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 08:36:08,589 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:36:08,589 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:36:08,589 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2018-11-18 08:36:08,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:36:08,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1115898087, now seen corresponding path program 1 times [2018-11-18 08:36:08,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:36:08,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:36:08,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:36:08,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:36:08,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:36:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:36:08,942 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:36:08,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:36:08,942 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4994e986-feb5-4b3b-92ed-b65081f3f5f9/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:36:08,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:36:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:36:08,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:36:08,981 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:08,985 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:08,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 08:36:08,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:08,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:08,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-11-18 08:36:09,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 08:36:09,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 08:36:09,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:09,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:09,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 08:36:09,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 08:36:09,025 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:09,027 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:09,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:09,032 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-11-18 08:36:09,083 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:09,086 INFO L477 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 51 treesize of output 55 [2018-11-18 08:36:09,088 INFO L477 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-11-18 08:36:09,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:09,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:09,104 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:09,108 INFO L477 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-11-18 08:36:09,109 INFO L477 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-11-18 08:36:09,110 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:09,114 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:09,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:36:09,122 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-11-18 08:36:09,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2018-11-18 08:36:09,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-11-18 08:36:09,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 08:36:09,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:36:09,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 91 [2018-11-18 08:36:09,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 51 [2018-11-18 08:36:09,275 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-18 08:36:09,291 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:36:09,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 73 [2018-11-18 08:36:09,300 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:36:09,301 INFO L477 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 20 treesize of output 21 [2018-11-18 08:36:09,302 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:09,313 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:09,343 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 2 xjuncts. [2018-11-18 08:36:09,343 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:88, output treesize:179 [2018-11-18 08:36:09,396 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:09,397 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:09,397 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:09,398 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:09,398 INFO L477 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 22 treesize of output 42 [2018-11-18 08:36:09,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:09,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:09,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:83 [2018-11-18 08:36:09,447 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:09,450 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-11-18 08:36:09,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2018-11-18 08:36:09,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:09,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:09,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2018-11-18 08:36:09,479 INFO L477 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 22 treesize of output 30 [2018-11-18 08:36:09,479 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:09,485 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:09,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:09,499 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:105, output treesize:81 [2018-11-18 08:36:09,570 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:09,571 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:09,571 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:09,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 120 [2018-11-18 08:36:09,578 INFO L477 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-11-18 08:36:09,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:09,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:09,603 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:09,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 62 [2018-11-18 08:36:09,607 INFO L477 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-11-18 08:36:09,607 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:09,614 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:09,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:36:09,625 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:123, output treesize:99 [2018-11-18 08:36:09,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 155 [2018-11-18 08:36:09,756 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:36:09,756 INFO L477 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 32 treesize of output 48 [2018-11-18 08:36:09,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:09,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:09,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 128 [2018-11-18 08:36:09,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 51 [2018-11-18 08:36:09,795 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-18 08:36:09,810 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:36:09,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-18 08:36:09,840 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:203, output treesize:289 [2018-11-18 08:36:09,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 93 [2018-11-18 08:36:09,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 08:36:09,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:09,992 INFO L477 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 75 treesize of output 60 [2018-11-18 08:36:09,992 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:09,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:10,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-18 08:36:10,009 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:135, output treesize:89 [2018-11-18 08:36:10,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 50 [2018-11-18 08:36:10,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-18 08:36:10,107 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:36:10,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 08:36:10,115 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:10,123 INFO L477 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-11-18 08:36:10,123 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:10,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:36:10,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 08:36:10,134 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:28 [2018-11-18 08:36:10,218 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:36:10,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:36:10,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 40 [2018-11-18 08:36:10,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-18 08:36:10,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-18 08:36:10,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1460, Unknown=1, NotChecked=0, Total=1640 [2018-11-18 08:36:10,236 INFO L87 Difference]: Start difference. First operand 126 states and 133 transitions. Second operand 41 states. [2018-11-18 08:36:12,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:36:12,628 INFO L93 Difference]: Finished difference Result 174 states and 181 transitions. [2018-11-18 08:36:12,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-18 08:36:12,628 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 60 [2018-11-18 08:36:12,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:36:12,629 INFO L225 Difference]: With dead ends: 174 [2018-11-18 08:36:12,629 INFO L226 Difference]: Without dead ends: 174 [2018-11-18 08:36:12,630 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1162 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=517, Invalid=3642, Unknown=1, NotChecked=0, Total=4160 [2018-11-18 08:36:12,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-18 08:36:12,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 128. [2018-11-18 08:36:12,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-18 08:36:12,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-11-18 08:36:12,633 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 60 [2018-11-18 08:36:12,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:36:12,633 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-11-18 08:36:12,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-18 08:36:12,633 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-11-18 08:36:12,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 08:36:12,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:36:12,634 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:36:12,634 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2018-11-18 08:36:12,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:36:12,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1115898088, now seen corresponding path program 1 times [2018-11-18 08:36:12,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:36:12,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:36:12,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:36:12,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:36:12,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:36:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:36:12,972 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:36:12,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:36:12,972 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4994e986-feb5-4b3b-92ed-b65081f3f5f9/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:36:12,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:36:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:36:12,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:36:13,004 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:13,005 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:13,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 08:36:13,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:13,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:13,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-11-18 08:36:13,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 08:36:13,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 08:36:13,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:13,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:13,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 08:36:13,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 08:36:13,028 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:13,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:13,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:13,036 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:20 [2018-11-18 08:36:13,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-11-18 08:36:13,063 INFO L477 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-11-18 08:36:13,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:13,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:13,074 INFO L477 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 43 treesize of output 39 [2018-11-18 08:36:13,075 INFO L477 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-11-18 08:36:13,076 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:13,079 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:13,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:36:13,085 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:62, output treesize:46 [2018-11-18 08:36:13,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2018-11-18 08:36:13,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 39 [2018-11-18 08:36:13,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 08:36:13,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:36:13,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 66 [2018-11-18 08:36:13,222 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:36:13,223 INFO L477 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 16 treesize of output 17 [2018-11-18 08:36:13,224 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:13,231 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:13,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 70 [2018-11-18 08:36:13,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-11-18 08:36:13,243 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-18 08:36:13,256 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:36:13,279 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 2 xjuncts. [2018-11-18 08:36:13,280 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:81, output treesize:141 [2018-11-18 08:36:13,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 08:36:13,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:13,342 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:13,343 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:13,343 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:13,344 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:13,344 INFO L477 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 16 treesize of output 13 [2018-11-18 08:36:13,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:13,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:13,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:65 [2018-11-18 08:36:13,385 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:13,388 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-11-18 08:36:13,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-11-18 08:36:13,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:13,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:13,407 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:36:13,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 56 [2018-11-18 08:36:13,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-18 08:36:13,411 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:13,416 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:13,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:13,423 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:84, output treesize:75 [2018-11-18 08:36:13,509 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:13,510 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:13,510 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:13,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 126 [2018-11-18 08:36:13,519 INFO L477 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-11-18 08:36:13,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:13,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:13,548 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:13,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 90 [2018-11-18 08:36:13,556 INFO L477 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-11-18 08:36:13,556 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:13,565 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:13,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:36:13,577 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:117, output treesize:97 [2018-11-18 08:36:13,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 171 [2018-11-18 08:36:13,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 51 [2018-11-18 08:36:13,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 08:36:13,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:36:13,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 122 [2018-11-18 08:36:13,807 INFO L477 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 32 treesize of output 25 [2018-11-18 08:36:13,808 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:13,818 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:13,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 138 [2018-11-18 08:36:13,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 51 [2018-11-18 08:36:13,835 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-18 08:36:13,854 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:36:13,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-18 08:36:13,891 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:197, output treesize:281 [2018-11-18 08:36:14,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 98 [2018-11-18 08:36:14,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 08:36:14,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:14,138 INFO L477 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 56 treesize of output 23 [2018-11-18 08:36:14,138 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:14,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-11-18 08:36:14,146 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:36:14,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:36:14,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2018-11-18 08:36:14,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 08:36:14,165 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:36:14,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 08:36:14,171 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:14,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 08:36:14,174 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:14,175 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:14,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:14,180 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:145, output treesize:9 [2018-11-18 08:36:14,197 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:36:14,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:36:14,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 35 [2018-11-18 08:36:14,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-18 08:36:14,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-18 08:36:14,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1142, Unknown=0, NotChecked=0, Total=1260 [2018-11-18 08:36:14,213 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 36 states. [2018-11-18 08:36:15,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:36:15,782 INFO L93 Difference]: Finished difference Result 169 states and 178 transitions. [2018-11-18 08:36:15,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-18 08:36:15,782 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 60 [2018-11-18 08:36:15,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:36:15,783 INFO L225 Difference]: With dead ends: 169 [2018-11-18 08:36:15,783 INFO L226 Difference]: Without dead ends: 169 [2018-11-18 08:36:15,783 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=320, Invalid=2870, Unknown=2, NotChecked=0, Total=3192 [2018-11-18 08:36:15,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-18 08:36:15,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 128. [2018-11-18 08:36:15,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-18 08:36:15,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 135 transitions. [2018-11-18 08:36:15,785 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 135 transitions. Word has length 60 [2018-11-18 08:36:15,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:36:15,785 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 135 transitions. [2018-11-18 08:36:15,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-18 08:36:15,785 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2018-11-18 08:36:15,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 08:36:15,785 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:36:15,785 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:36:15,785 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2018-11-18 08:36:15,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:36:15,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1118290969, now seen corresponding path program 3 times [2018-11-18 08:36:15,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:36:15,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:36:15,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:36:15,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:36:15,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:36:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:36:16,508 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:36:16,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:36:16,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4994e986-feb5-4b3b-92ed-b65081f3f5f9/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:36:16,514 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 08:36:16,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 08:36:16,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:36:16,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:36:16,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-11-18 08:36:16,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2018-11-18 08:36:16,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 08:36:16,659 INFO L477 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 19 [2018-11-18 08:36:16,659 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:16,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:36:16,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 59 [2018-11-18 08:36:16,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 48 [2018-11-18 08:36:16,698 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-18 08:36:16,715 INFO L477 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 38 treesize of output 41 [2018-11-18 08:36:16,716 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:16,723 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:16,725 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:36:16,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-11-18 08:36:16,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2018-11-18 08:36:16,727 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:16,731 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:16,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:36:16,744 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:50, output treesize:89 [2018-11-18 08:36:16,832 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:16,833 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:16,834 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:16,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 68 [2018-11-18 08:36:16,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:16,860 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:16,862 INFO L477 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 50 treesize of output 53 [2018-11-18 08:36:16,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:16,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2018-11-18 08:36:16,864 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:16,890 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:16,891 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:16,891 INFO L477 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 49 treesize of output 43 [2018-11-18 08:36:16,891 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:16,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:36:16,913 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:126, output treesize:115 [2018-11-18 08:36:16,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 99 [2018-11-18 08:36:16,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 86 [2018-11-18 08:36:16,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:17,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 93 [2018-11-18 08:36:17,071 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-18 08:36:17,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:36:17,181 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:36:17,181 INFO L477 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 70 treesize of output 62 [2018-11-18 08:36:17,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 21 [2018-11-18 08:36:17,183 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:17,192 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:17,196 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:36:17,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 81 [2018-11-18 08:36:17,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-18 08:36:17,206 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:17,216 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:17,260 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:36:17,260 INFO L477 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 62 treesize of output 62 [2018-11-18 08:36:17,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-18 08:36:17,262 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:17,272 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:17,311 INFO L477 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 51 treesize of output 46 [2018-11-18 08:36:17,313 INFO L477 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 14 [2018-11-18 08:36:17,313 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:17,320 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:17,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 08:36:17,353 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:159, output treesize:170 [2018-11-18 08:36:17,471 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:17,474 INFO L477 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 83 treesize of output 87 [2018-11-18 08:36:17,476 INFO L477 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-11-18 08:36:17,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:17,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:17,526 INFO L477 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 75 treesize of output 68 [2018-11-18 08:36:17,528 INFO L477 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-11-18 08:36:17,528 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:17,537 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:17,571 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:17,571 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:17,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 138 [2018-11-18 08:36:17,580 INFO L477 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-11-18 08:36:17,580 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:17,596 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:17,668 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:17,670 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:17,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 131 [2018-11-18 08:36:17,677 INFO L477 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-11-18 08:36:17,677 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:17,692 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:17,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 08:36:17,717 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:210, output treesize:174 [2018-11-18 08:36:17,943 INFO L477 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 99 treesize of output 89 [2018-11-18 08:36:17,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-11-18 08:36:17,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 08:36:17,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:36:18,034 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:36:18,035 INFO L477 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 83 treesize of output 75 [2018-11-18 08:36:18,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-18 08:36:18,037 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:18,045 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:18,049 INFO L477 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 91 treesize of output 78 [2018-11-18 08:36:18,051 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:36:18,051 INFO L477 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 20 treesize of output 28 [2018-11-18 08:36:18,051 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:18,061 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:18,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 167 [2018-11-18 08:36:18,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 51 [2018-11-18 08:36:18,128 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-18 08:36:18,149 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:36:18,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 172 [2018-11-18 08:36:18,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 51 [2018-11-18 08:36:18,240 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-18 08:36:18,258 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:36:18,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 152 [2018-11-18 08:36:18,269 INFO L477 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 32 treesize of output 25 [2018-11-18 08:36:18,270 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:18,282 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:18,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-11-18 08:36:18,350 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:314, output treesize:455 [2018-11-18 08:36:18,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 125 [2018-11-18 08:36:18,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 85 [2018-11-18 08:36:18,611 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:36:18,643 INFO L477 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 103 treesize of output 98 [2018-11-18 08:36:18,643 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:18,677 INFO L477 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 85 treesize of output 80 [2018-11-18 08:36:18,677 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:18,707 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:18,707 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:36:18,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 74 [2018-11-18 08:36:18,709 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:36:18,745 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:36:18,745 INFO L477 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 80 treesize of output 70 [2018-11-18 08:36:18,746 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:18,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 08:36:18,819 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:18,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 65 [2018-11-18 08:36:18,825 INFO L477 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 61 treesize of output 54 [2018-11-18 08:36:18,826 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:18,853 INFO L477 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 53 treesize of output 48 [2018-11-18 08:36:18,853 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:18,876 INFO L477 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 50 treesize of output 45 [2018-11-18 08:36:18,876 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:18,898 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:18,898 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:36:18,898 INFO L477 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 48 treesize of output 37 [2018-11-18 08:36:18,899 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:18,917 INFO L267 ElimStorePlain]: Start of recursive call 8: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:18,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 55 [2018-11-18 08:36:18,925 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:36:18,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-11-18 08:36:18,927 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:18,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 08:36:18,944 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:18,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 08:36:18,954 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:18,960 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:18,991 INFO L477 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 72 treesize of output 70 [2018-11-18 08:36:18,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 08:36:18,993 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:19,003 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:36:19,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-18 08:36:19,004 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:19,012 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:19,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2018-11-18 08:36:19,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 08:36:19,041 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:19,048 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:36:19,048 INFO L477 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 19 treesize of output 13 [2018-11-18 08:36:19,048 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:19,054 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:19,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-18 08:36:19,078 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 10 variables, input treesize:222, output treesize:67 [2018-11-18 08:36:19,224 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:36:19,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:36:19,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 36 [2018-11-18 08:36:19,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-18 08:36:19,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-18 08:36:19,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1191, Unknown=3, NotChecked=0, Total=1332 [2018-11-18 08:36:19,240 INFO L87 Difference]: Start difference. First operand 128 states and 135 transitions. Second operand 37 states. [2018-11-18 08:36:20,063 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 71 [2018-11-18 08:36:20,247 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 86 [2018-11-18 08:36:20,459 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 107 [2018-11-18 08:36:20,647 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 89 [2018-11-18 08:36:20,930 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 114 [2018-11-18 08:36:22,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:36:22,013 INFO L93 Difference]: Finished difference Result 204 states and 216 transitions. [2018-11-18 08:36:22,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-18 08:36:22,013 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 60 [2018-11-18 08:36:22,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:36:22,014 INFO L225 Difference]: With dead ends: 204 [2018-11-18 08:36:22,014 INFO L226 Difference]: Without dead ends: 204 [2018-11-18 08:36:22,015 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=404, Invalid=2673, Unknown=3, NotChecked=0, Total=3080 [2018-11-18 08:36:22,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-11-18 08:36:22,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 164. [2018-11-18 08:36:22,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-18 08:36:22,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2018-11-18 08:36:22,017 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 60 [2018-11-18 08:36:22,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:36:22,017 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2018-11-18 08:36:22,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-18 08:36:22,017 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2018-11-18 08:36:22,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 08:36:22,018 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:36:22,018 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:36:22,018 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2018-11-18 08:36:22,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:36:22,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1118290970, now seen corresponding path program 2 times [2018-11-18 08:36:22,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:36:22,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:36:22,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:36:22,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:36:22,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:36:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:36:22,572 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:36:22,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:36:22,572 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4994e986-feb5-4b3b-92ed-b65081f3f5f9/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:36:22,583 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 08:36:22,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 08:36:22,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:36:22,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:36:22,646 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:22,647 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:22,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-18 08:36:22,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:22,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:22,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-11-18 08:36:22,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 08:36:22,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 08:36:22,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:22,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:22,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:22,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-11-18 08:36:22,718 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:22,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43 [2018-11-18 08:36:22,722 INFO L477 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-11-18 08:36:22,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:22,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:22,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:36:22,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-11-18 08:36:22,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2018-11-18 08:36:22,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 08:36:22,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 08:36:22,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:36:22,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 08:36:22,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:90 [2018-11-18 08:36:22,874 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:22,875 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:22,875 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:22,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-18 08:36:22,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:22,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:22,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:38 [2018-11-18 08:36:22,904 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:22,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-11-18 08:36:22,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-18 08:36:22,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:22,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:22,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:22,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:44 [2018-11-18 08:36:22,961 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:36:22,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 65 [2018-11-18 08:36:22,966 INFO L477 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-11-18 08:36:22,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:22,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:22,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 08:36:22,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:57 [2018-11-18 08:36:23,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 71 [2018-11-18 08:36:23,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 43 [2018-11-18 08:36:23,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 08:36:23,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:36:23,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-18 08:36:23,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:97, output treesize:150 [2018-11-18 08:36:23,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 48 [2018-11-18 08:36:23,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 08:36:23,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:23,217 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 08:36:23,217 INFO L477 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 27 treesize of output 19 [2018-11-18 08:36:23,218 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:23,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-18 08:36:23,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 08:36:23,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:23,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:36:23,235 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:74, output treesize:5 [2018-11-18 08:36:23,264 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:36:23,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:36:23,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 40 [2018-11-18 08:36:23,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-18 08:36:23,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-18 08:36:23,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1390, Unknown=12, NotChecked=0, Total=1640 [2018-11-18 08:36:23,280 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand 41 states. [2018-11-18 08:36:25,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:36:25,418 INFO L93 Difference]: Finished difference Result 241 states and 252 transitions. [2018-11-18 08:36:25,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-18 08:36:25,419 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 60 [2018-11-18 08:36:25,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 08:36:25,420 INFO L225 Difference]: With dead ends: 241 [2018-11-18 08:36:25,420 INFO L226 Difference]: Without dead ends: 241 [2018-11-18 08:36:25,421 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1490 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1006, Invalid=4231, Unknown=19, NotChecked=0, Total=5256 [2018-11-18 08:36:25,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-11-18 08:36:25,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 164. [2018-11-18 08:36:25,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-18 08:36:25,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 174 transitions. [2018-11-18 08:36:25,424 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 174 transitions. Word has length 60 [2018-11-18 08:36:25,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 08:36:25,424 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 174 transitions. [2018-11-18 08:36:25,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-18 08:36:25,424 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2018-11-18 08:36:25,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 08:36:25,424 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 08:36:25,425 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:36:25,425 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION]=== [2018-11-18 08:36:25,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:36:25,425 INFO L82 PathProgramCache]: Analyzing trace with hash 673147207, now seen corresponding path program 1 times [2018-11-18 08:36:25,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:36:25,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:36:25,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:36:25,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:36:25,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:36:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:36:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:36:25,462 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 08:36:25,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:36:25 BoogieIcfgContainer [2018-11-18 08:36:25,492 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 08:36:25,494 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:36:25,494 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:36:25,494 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:36:25,494 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:35:50" (3/4) ... [2018-11-18 08:36:25,496 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 08:36:25,532 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4994e986-feb5-4b3b-92ed-b65081f3f5f9/bin-2019/uautomizer/witness.graphml [2018-11-18 08:36:25,532 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:36:25,533 INFO L168 Benchmark]: Toolchain (without parser) took 36325.66 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 459.3 MB). Free memory was 956.6 MB in the beginning and 890.9 MB in the end (delta: 65.6 MB). Peak memory consumption was 524.9 MB. Max. memory is 11.5 GB. [2018-11-18 08:36:25,533 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:36:25,533 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2018-11-18 08:36:25,533 INFO L168 Benchmark]: Boogie Preprocessor took 41.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-11-18 08:36:25,534 INFO L168 Benchmark]: RCFGBuilder took 436.42 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: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. [2018-11-18 08:36:25,534 INFO L168 Benchmark]: TraceAbstraction took 35452.74 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 329.3 MB). Free memory was 1.1 GB in the beginning and 903.2 MB in the end (delta: 153.7 MB). Peak memory consumption was 483.0 MB. Max. memory is 11.5 GB. [2018-11-18 08:36:25,534 INFO L168 Benchmark]: Witness Printer took 38.35 ms. Allocated memory is still 1.5 GB. Free memory was 903.2 MB in the beginning and 890.9 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. [2018-11-18 08:36:25,535 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 353.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 436.42 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: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35452.74 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 329.3 MB). Free memory was 1.1 GB in the beginning and 903.2 MB in the end (delta: 153.7 MB). Peak memory consumption was 483.0 MB. Max. memory is 11.5 GB. * Witness Printer took 38.35 ms. Allocated memory is still 1.5 GB. Free memory was 903.2 MB in the beginning and 890.9 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1040]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L994] EXPR, FCALL malloc(sizeof(SLL)) [L994] SLL* list = malloc(sizeof(SLL)); VAL [list={15:0}, malloc(sizeof(SLL))={15:0}] [L995] FCALL list->next = ((void*)0) VAL [list={15:0}, malloc(sizeof(SLL))={15:0}] [L996] FCALL list->prev = ((void*)0) VAL [list={15:0}, malloc(sizeof(SLL))={15:0}] [L997] FCALL list->colour = BLACK VAL [list={15:0}, malloc(sizeof(SLL))={15:0}] [L999] SLL* end = list; VAL [end={15:0}, list={15:0}, malloc(sizeof(SLL))={15:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={15:0}, list={15:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1005] FCALL end->next = malloc(sizeof(SLL)) VAL [end={15:0}, list={15:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1006] EXPR, FCALL end->next VAL [end={15:0}, end->next={14:0}, list={15:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1006] FCALL end->next->prev = end VAL [end={15:0}, end->next={14:0}, list={15:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1007] EXPR, FCALL end->next VAL [end={15:0}, end->next={14:0}, list={15:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1007] end = end->next [L1008] FCALL end->next = ((void*)0) VAL [end={14:0}, list={15:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1016] FCALL end->colour = RED VAL [end={14:0}, list={15:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1017] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={14:0}, list={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1017] FCALL end->next = malloc(sizeof(SLL)) VAL [end={14:0}, list={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1018] EXPR, FCALL end->next VAL [end={14:0}, end->next={16:0}, list={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1018] FCALL end->next->prev = end VAL [end={14:0}, end->next={16:0}, list={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1019] EXPR, FCALL end->next VAL [end={14:0}, end->next={16:0}, list={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1019] end = end->next [L1020] FCALL end->next = ((void*)0) VAL [end={16:0}, list={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1021] FCALL end->colour = BLACK VAL [end={16:0}, list={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1025] end = ((void*)0) [L1026] end = list VAL [end={15:0}, list={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1029] COND FALSE !(!(((void*)0) != end)) VAL [end={15:0}, list={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1029] COND FALSE !(0) VAL [end={15:0}, list={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1030] EXPR, FCALL end->colour VAL [end={15:0}, end->colour=1, list={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1030] COND FALSE !(!(BLACK == end->colour)) [L1030] COND FALSE !(0) VAL [end={15:0}, list={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1032] COND TRUE ((void*)0) != end VAL [end={15:0}, list={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1034] EXPR, FCALL end->colour VAL [end={15:0}, end->colour=1, list={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1034] COND FALSE !(RED == end->colour) [L1040] EXPR, FCALL end->next VAL [end={15:0}, end->next={14:0}, list={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1040] COND FALSE !(!(end->next)) [L1040] COND FALSE !(0) VAL [end={15:0}, list={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1041] EXPR, FCALL end->next VAL [end={15:0}, end->next={14:0}, list={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1041] end = end->next [L1032] COND TRUE ((void*)0) != end VAL [end={14:0}, list={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1034] EXPR, FCALL end->colour VAL [end={14:0}, end->colour=0, list={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1034] COND TRUE RED == end->colour [L1036] EXPR, FCALL end->next VAL [end={14:0}, end->next={16:0}, list={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1036] end = end->next [L1037] EXPR, FCALL end->next VAL [end={16:0}, end->next={0:0}, list={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1037] end = end->next [L1040] FCALL end->next - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 135 locations, 59 error locations. UNSAFE Result, 35.4s OverallTime, 27 OverallIterations, 3 TraceHistogramMax, 19.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1861 SDtfs, 7394 SDslu, 9908 SDs, 0 SdLazy, 16661 SolverSat, 1401 SolverUnsat, 21 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1124 GetRequests, 417 SyntacticMatches, 34 SemanticMatches, 673 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9227 ImplicationChecksByTransitivity, 17.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=25, 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.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 1053 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 14.3s InterpolantComputationTime, 1545 NumberOfCodeBlocks, 1545 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1446 ConstructedInterpolants, 293 QuantifiedInterpolants, 2427657 SizeOfPredicates, 187 NumberOfNonLiveVariables, 2196 ConjunctsInSsa, 498 ConjunctsInUnsatCore, 36 InterpolantComputations, 16 PerfectInterpolantSequences, 33/224 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...