./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_002cf4c3-2119-4872-a95c-21305de54600/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_002cf4c3-2119-4872-a95c-21305de54600/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_002cf4c3-2119-4872-a95c-21305de54600/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_002cf4c3-2119-4872-a95c-21305de54600/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_002cf4c3-2119-4872-a95c-21305de54600/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_002cf4c3-2119-4872-a95c-21305de54600/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-0cd3be1 [2018-11-28 11:23:13,339 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:23:13,341 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:23:13,351 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:23:13,352 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:23:13,352 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:23:13,354 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:23:13,355 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:23:13,356 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:23:13,357 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:23:13,358 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:23:13,358 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:23:13,359 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:23:13,360 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:23:13,361 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:23:13,361 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:23:13,362 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:23:13,364 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:23:13,365 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:23:13,367 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:23:13,368 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:23:13,369 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:23:13,371 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:23:13,371 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:23:13,371 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:23:13,372 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:23:13,373 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:23:13,373 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:23:13,374 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:23:13,375 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:23:13,375 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:23:13,376 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:23:13,376 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:23:13,376 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:23:13,377 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:23:13,377 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:23:13,378 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_002cf4c3-2119-4872-a95c-21305de54600/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 11:23:13,389 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:23:13,390 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:23:13,390 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:23:13,391 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:23:13,391 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:23:13,391 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:23:13,392 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:23:13,392 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:23:13,392 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:23:13,392 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:23:13,392 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:23:13,392 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:23:13,393 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:23:13,393 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 11:23:13,393 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 11:23:13,393 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 11:23:13,393 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:23:13,393 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:23:13,394 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:23:13,394 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:23:13,394 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:23:13,394 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:23:13,394 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:23:13,395 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:23:13,395 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:23:13,395 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:23:13,395 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:23:13,395 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:23:13,395 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_002cf4c3-2119-4872-a95c-21305de54600/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-28 11:23:13,429 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:23:13,440 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:23:13,443 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:23:13,445 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:23:13,445 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:23:13,446 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_002cf4c3-2119-4872-a95c-21305de54600/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-28 11:23:13,499 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_002cf4c3-2119-4872-a95c-21305de54600/bin-2019/uautomizer/data/bb3ea31a1/3055a25a5d224e6eb1e306c5e1325d29/FLAG5d7c0e44b [2018-11-28 11:23:13,904 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:23:13,904 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_002cf4c3-2119-4872-a95c-21305de54600/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-28 11:23:13,915 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_002cf4c3-2119-4872-a95c-21305de54600/bin-2019/uautomizer/data/bb3ea31a1/3055a25a5d224e6eb1e306c5e1325d29/FLAG5d7c0e44b [2018-11-28 11:23:13,925 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_002cf4c3-2119-4872-a95c-21305de54600/bin-2019/uautomizer/data/bb3ea31a1/3055a25a5d224e6eb1e306c5e1325d29 [2018-11-28 11:23:13,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:23:13,928 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 11:23:13,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:23:13,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:23:13,932 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:23:13,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:23:13" (1/1) ... [2018-11-28 11:23:13,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8662d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:13, skipping insertion in model container [2018-11-28 11:23:13,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:23:13" (1/1) ... [2018-11-28 11:23:13,943 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:23:13,972 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:23:14,191 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:23:14,248 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:23:14,281 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:23:14,318 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:23:14,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:14 WrapperNode [2018-11-28 11:23:14,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:23:14,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:23:14,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:23:14,319 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:23:14,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:14" (1/1) ... [2018-11-28 11:23:14,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:14" (1/1) ... [2018-11-28 11:23:14,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:14" (1/1) ... [2018-11-28 11:23:14,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:14" (1/1) ... [2018-11-28 11:23:14,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:14" (1/1) ... [2018-11-28 11:23:14,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:14" (1/1) ... [2018-11-28 11:23:14,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:14" (1/1) ... [2018-11-28 11:23:14,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:23:14,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:23:14,371 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:23:14,371 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:23:14,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_002cf4c3-2119-4872-a95c-21305de54600/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-28 11:23:14,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:23:14,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:23:14,422 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:23:14,423 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 11:23:14,423 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 11:23:14,423 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 11:23:14,423 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 11:23:14,423 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 11:23:14,423 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 11:23:14,423 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 11:23:14,423 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 11:23:14,424 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 11:23:14,424 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 11:23:14,424 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 11:23:14,424 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 11:23:14,424 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 11:23:14,424 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 11:23:14,424 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 11:23:14,425 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 11:23:14,425 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 11:23:14,425 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 11:23:14,425 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 11:23:14,425 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 11:23:14,425 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 11:23:14,425 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 11:23:14,425 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 11:23:14,425 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 11:23:14,425 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 11:23:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 11:23:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 11:23:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 11:23:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 11:23:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 11:23:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 11:23:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 11:23:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 11:23:14,427 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 11:23:14,427 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 11:23:14,427 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 11:23:14,427 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 11:23:14,427 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 11:23:14,427 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 11:23:14,428 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 11:23:14,428 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 11:23:14,428 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 11:23:14,428 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 11:23:14,428 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 11:23:14,428 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 11:23:14,428 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 11:23:14,429 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 11:23:14,429 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 11:23:14,429 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 11:23:14,429 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 11:23:14,429 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 11:23:14,429 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 11:23:14,430 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 11:23:14,430 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 11:23:14,430 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 11:23:14,430 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 11:23:14,430 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 11:23:14,430 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 11:23:14,430 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-28 11:23:14,430 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 11:23:14,431 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 11:23:14,431 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-28 11:23:14,431 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 11:23:14,431 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 11:23:14,431 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-28 11:23:14,431 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 11:23:14,431 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 11:23:14,432 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 11:23:14,432 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 11:23:14,432 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 11:23:14,432 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 11:23:14,432 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 11:23:14,432 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 11:23:14,432 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 11:23:14,432 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 11:23:14,433 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 11:23:14,433 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 11:23:14,433 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 11:23:14,433 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 11:23:14,433 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 11:23:14,433 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 11:23:14,433 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 11:23:14,433 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 11:23:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 11:23:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 11:23:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 11:23:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 11:23:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 11:23:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 11:23:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 11:23:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 11:23:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 11:23:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 11:23:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 11:23:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 11:23:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 11:23:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 11:23:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 11:23:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 11:23:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 11:23:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 11:23:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 11:23:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 11:23:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 11:23:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 11:23:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:23:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:23:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 11:23:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:23:14,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 11:23:14,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:23:14,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:23:14,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:23:14,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:23:14,909 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:23:14,909 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-28 11:23:14,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:14 BoogieIcfgContainer [2018-11-28 11:23:14,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:23:14,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:23:14,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:23:14,914 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:23:14,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:23:13" (1/3) ... [2018-11-28 11:23:14,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21777b68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:23:14, skipping insertion in model container [2018-11-28 11:23:14,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:14" (2/3) ... [2018-11-28 11:23:14,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21777b68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:23:14, skipping insertion in model container [2018-11-28 11:23:14,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:14" (3/3) ... [2018-11-28 11:23:14,917 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-28 11:23:14,924 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:23:14,931 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 59 error locations. [2018-11-28 11:23:14,944 INFO L257 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2018-11-28 11:23:14,963 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:23:14,964 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:23:14,964 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 11:23:14,964 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:23:14,964 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:23:14,964 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:23:14,964 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:23:14,965 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:23:14,965 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:23:14,982 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2018-11-28 11:23:14,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-28 11:23:14,991 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:14,991 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:14,993 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-28 11:23:14,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:14,998 INFO L82 PathProgramCache]: Analyzing trace with hash 922504407, now seen corresponding path program 1 times [2018-11-28 11:23:14,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:14,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:15,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:15,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:15,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:15,129 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-28 11:23:15,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:15,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:23:15,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:23:15,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:23:15,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:23:15,152 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 3 states. [2018-11-28 11:23:15,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:15,370 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2018-11-28 11:23:15,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:23:15,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-28 11:23:15,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:15,379 INFO L225 Difference]: With dead ends: 129 [2018-11-28 11:23:15,379 INFO L226 Difference]: Without dead ends: 125 [2018-11-28 11:23:15,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:23:15,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-28 11:23:15,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2018-11-28 11:23:15,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-28 11:23:15,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2018-11-28 11:23:15,415 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 7 [2018-11-28 11:23:15,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:15,416 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2018-11-28 11:23:15,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:23:15,416 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2018-11-28 11:23:15,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-28 11:23:15,416 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:15,417 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:15,417 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-28 11:23:15,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:15,417 INFO L82 PathProgramCache]: Analyzing trace with hash 922504408, now seen corresponding path program 1 times [2018-11-28 11:23:15,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:15,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:15,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:15,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:15,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:15,449 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-28 11:23:15,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:15,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:23:15,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:23:15,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:23:15,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:23:15,451 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 3 states. [2018-11-28 11:23:15,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:15,583 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2018-11-28 11:23:15,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:23:15,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-28 11:23:15,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:15,586 INFO L225 Difference]: With dead ends: 134 [2018-11-28 11:23:15,586 INFO L226 Difference]: Without dead ends: 134 [2018-11-28 11:23:15,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:23:15,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-28 11:23:15,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 125. [2018-11-28 11:23:15,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-28 11:23:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2018-11-28 11:23:15,596 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 7 [2018-11-28 11:23:15,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:15,596 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2018-11-28 11:23:15,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:23:15,596 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2018-11-28 11:23:15,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 11:23:15,597 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:15,597 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:15,597 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-28 11:23:15,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:15,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681824, now seen corresponding path program 1 times [2018-11-28 11:23:15,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:15,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:15,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:15,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:15,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:15,665 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-28 11:23:15,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:15,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:23:15,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:23:15,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:23:15,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:23:15,666 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 4 states. [2018-11-28 11:23:15,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:15,858 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-11-28 11:23:15,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:23:15,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-28 11:23:15,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:15,859 INFO L225 Difference]: With dead ends: 130 [2018-11-28 11:23:15,859 INFO L226 Difference]: Without dead ends: 130 [2018-11-28 11:23:15,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:23:15,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-28 11:23:15,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 115. [2018-11-28 11:23:15,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-28 11:23:15,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2018-11-28 11:23:15,865 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 13 [2018-11-28 11:23:15,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:15,866 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2018-11-28 11:23:15,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:23:15,866 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2018-11-28 11:23:15,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 11:23:15,867 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:15,867 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:15,867 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-28 11:23:15,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:15,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681823, now seen corresponding path program 1 times [2018-11-28 11:23:15,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:15,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:15,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:15,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:15,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:15,935 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-28 11:23:15,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:15,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:23:15,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:23:15,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:23:15,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:23:15,937 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand 4 states. [2018-11-28 11:23:16,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:16,078 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2018-11-28 11:23:16,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:23:16,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-28 11:23:16,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:16,079 INFO L225 Difference]: With dead ends: 152 [2018-11-28 11:23:16,079 INFO L226 Difference]: Without dead ends: 152 [2018-11-28 11:23:16,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:23:16,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-28 11:23:16,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 127. [2018-11-28 11:23:16,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-28 11:23:16,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 140 transitions. [2018-11-28 11:23:16,087 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 140 transitions. Word has length 13 [2018-11-28 11:23:16,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:16,087 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 140 transitions. [2018-11-28 11:23:16,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:23:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 140 transitions. [2018-11-28 11:23:16,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 11:23:16,088 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:16,088 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:16,088 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-28 11:23:16,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:16,088 INFO L82 PathProgramCache]: Analyzing trace with hash 502811171, now seen corresponding path program 1 times [2018-11-28 11:23:16,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:16,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:16,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:16,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:16,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:16,128 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-28 11:23:16,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:16,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:23:16,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:23:16,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:23:16,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:23:16,129 INFO L87 Difference]: Start difference. First operand 127 states and 140 transitions. Second operand 5 states. [2018-11-28 11:23:16,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:16,269 INFO L93 Difference]: Finished difference Result 175 states and 193 transitions. [2018-11-28 11:23:16,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:23:16,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-28 11:23:16,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:16,270 INFO L225 Difference]: With dead ends: 175 [2018-11-28 11:23:16,271 INFO L226 Difference]: Without dead ends: 175 [2018-11-28 11:23:16,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:23:16,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-28 11:23:16,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 126. [2018-11-28 11:23:16,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-28 11:23:16,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2018-11-28 11:23:16,275 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 15 [2018-11-28 11:23:16,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:16,275 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2018-11-28 11:23:16,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:23:16,275 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2018-11-28 11:23:16,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 11:23:16,275 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:16,275 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:16,276 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-28 11:23:16,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:16,276 INFO L82 PathProgramCache]: Analyzing trace with hash 502811172, now seen corresponding path program 1 times [2018-11-28 11:23:16,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:16,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:16,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:16,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:16,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:16,323 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-28 11:23:16,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:16,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:23:16,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:23:16,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:23:16,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:23:16,324 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 5 states. [2018-11-28 11:23:16,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:16,527 INFO L93 Difference]: Finished difference Result 196 states and 215 transitions. [2018-11-28 11:23:16,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:23:16,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-28 11:23:16,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:16,529 INFO L225 Difference]: With dead ends: 196 [2018-11-28 11:23:16,529 INFO L226 Difference]: Without dead ends: 196 [2018-11-28 11:23:16,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:23:16,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-11-28 11:23:16,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 125. [2018-11-28 11:23:16,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-28 11:23:16,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2018-11-28 11:23:16,534 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 15 [2018-11-28 11:23:16,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:16,535 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2018-11-28 11:23:16,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:23:16,535 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2018-11-28 11:23:16,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 11:23:16,535 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:16,535 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:16,536 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-28 11:23:16,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:16,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1991341413, now seen corresponding path program 1 times [2018-11-28 11:23:16,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:16,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:16,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:16,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:16,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:16,641 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-28 11:23:16,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:16,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 11:23:16,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 11:23:16,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 11:23:16,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:23:16,643 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand 9 states. [2018-11-28 11:23:17,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:17,025 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2018-11-28 11:23:17,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:23:17,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-11-28 11:23:17,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:17,026 INFO L225 Difference]: With dead ends: 138 [2018-11-28 11:23:17,026 INFO L226 Difference]: Without dead ends: 138 [2018-11-28 11:23:17,026 INFO L631 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-28 11:23:17,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-28 11:23:17,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 124. [2018-11-28 11:23:17,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-28 11:23:17,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2018-11-28 11:23:17,030 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 19 [2018-11-28 11:23:17,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:17,031 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2018-11-28 11:23:17,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 11:23:17,031 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2018-11-28 11:23:17,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 11:23:17,031 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:17,032 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:17,032 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-28 11:23:17,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:17,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1991341414, now seen corresponding path program 1 times [2018-11-28 11:23:17,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:17,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:17,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:17,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:17,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:17,152 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-28 11:23:17,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:17,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 11:23:17,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 11:23:17,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 11:23:17,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 11:23:17,153 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 10 states. [2018-11-28 11:23:17,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:17,594 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2018-11-28 11:23:17,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 11:23:17,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-11-28 11:23:17,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:17,595 INFO L225 Difference]: With dead ends: 141 [2018-11-28 11:23:17,595 INFO L226 Difference]: Without dead ends: 141 [2018-11-28 11:23:17,595 INFO L631 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-28 11:23:17,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-28 11:23:17,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 118. [2018-11-28 11:23:17,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-28 11:23:17,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2018-11-28 11:23:17,599 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 19 [2018-11-28 11:23:17,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:17,599 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2018-11-28 11:23:17,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 11:23:17,599 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2018-11-28 11:23:17,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 11:23:17,600 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:17,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:17,600 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-28 11:23:17,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:17,600 INFO L82 PathProgramCache]: Analyzing trace with hash 207481725, now seen corresponding path program 1 times [2018-11-28 11:23:17,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:17,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:17,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:17,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:17,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:17,633 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-28 11:23:17,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:17,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:23:17,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:23:17,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:23:17,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:23:17,635 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand 4 states. [2018-11-28 11:23:17,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:17,699 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2018-11-28 11:23:17,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:23:17,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-28 11:23:17,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:17,700 INFO L225 Difference]: With dead ends: 135 [2018-11-28 11:23:17,700 INFO L226 Difference]: Without dead ends: 135 [2018-11-28 11:23:17,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:23:17,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-28 11:23:17,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 118. [2018-11-28 11:23:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-28 11:23:17,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-11-28 11:23:17,703 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 22 [2018-11-28 11:23:17,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:17,703 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-11-28 11:23:17,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:23:17,703 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-11-28 11:23:17,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 11:23:17,704 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:17,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:17,705 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-28 11:23:17,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:17,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1832807181, now seen corresponding path program 1 times [2018-11-28 11:23:17,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:17,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:17,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:17,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:17,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:17,781 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-28 11:23:17,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:17,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:23:17,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:23:17,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:23:17,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:23:17,782 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 5 states. [2018-11-28 11:23:17,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:17,928 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2018-11-28 11:23:17,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:23:17,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-28 11:23:17,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:17,930 INFO L225 Difference]: With dead ends: 124 [2018-11-28 11:23:17,930 INFO L226 Difference]: Without dead ends: 124 [2018-11-28 11:23:17,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:23:17,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-28 11:23:17,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 117. [2018-11-28 11:23:17,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-28 11:23:17,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2018-11-28 11:23:17,935 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 24 [2018-11-28 11:23:17,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:17,935 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2018-11-28 11:23:17,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:23:17,935 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2018-11-28 11:23:17,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 11:23:17,936 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:17,936 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:17,936 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-28 11:23:17,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:17,937 INFO L82 PathProgramCache]: Analyzing trace with hash -430750966, now seen corresponding path program 1 times [2018-11-28 11:23:17,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:17,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:17,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:17,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:17,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:17,996 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-28 11:23:17,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:17,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:23:17,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:23:17,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:23:17,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:23:17,997 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 5 states. [2018-11-28 11:23:18,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:18,212 INFO L93 Difference]: Finished difference Result 175 states and 189 transitions. [2018-11-28 11:23:18,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:23:18,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-28 11:23:18,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:18,214 INFO L225 Difference]: With dead ends: 175 [2018-11-28 11:23:18,214 INFO L226 Difference]: Without dead ends: 175 [2018-11-28 11:23:18,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:23:18,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-28 11:23:18,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 116. [2018-11-28 11:23:18,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-28 11:23:18,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2018-11-28 11:23:18,218 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 26 [2018-11-28 11:23:18,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:18,218 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2018-11-28 11:23:18,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:23:18,218 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2018-11-28 11:23:18,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 11:23:18,219 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:18,219 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:18,219 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-28 11:23:18,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:18,220 INFO L82 PathProgramCache]: Analyzing trace with hash -430750965, now seen corresponding path program 1 times [2018-11-28 11:23:18,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:18,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:18,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:18,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:18,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:18,277 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-28 11:23:18,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:18,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:23:18,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:23:18,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:23:18,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:23:18,278 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand 5 states. [2018-11-28 11:23:18,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:18,531 INFO L93 Difference]: Finished difference Result 199 states and 214 transitions. [2018-11-28 11:23:18,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:23:18,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-28 11:23:18,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:18,534 INFO L225 Difference]: With dead ends: 199 [2018-11-28 11:23:18,534 INFO L226 Difference]: Without dead ends: 199 [2018-11-28 11:23:18,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:23:18,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-28 11:23:18,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 115. [2018-11-28 11:23:18,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-28 11:23:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2018-11-28 11:23:18,539 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 26 [2018-11-28 11:23:18,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:18,539 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2018-11-28 11:23:18,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:23:18,539 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2018-11-28 11:23:18,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 11:23:18,540 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:18,540 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:18,541 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-28 11:23:18,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:18,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1604048439, now seen corresponding path program 1 times [2018-11-28 11:23:18,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:18,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:18,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:18,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:18,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:18,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:18,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:23:18,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:23:18,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:23:18,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:23:18,641 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 5 states. [2018-11-28 11:23:18,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:18,796 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2018-11-28 11:23:18,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:23:18,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-28 11:23:18,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:18,798 INFO L225 Difference]: With dead ends: 129 [2018-11-28 11:23:18,798 INFO L226 Difference]: Without dead ends: 118 [2018-11-28 11:23:18,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:23:18,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-28 11:23:18,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-11-28 11:23:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-28 11:23:18,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2018-11-28 11:23:18,802 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 28 [2018-11-28 11:23:18,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:18,802 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2018-11-28 11:23:18,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:23:18,802 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2018-11-28 11:23:18,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 11:23:18,803 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:18,803 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:18,803 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-28 11:23:18,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:18,803 INFO L82 PathProgramCache]: Analyzing trace with hash 899005004, now seen corresponding path program 1 times [2018-11-28 11:23:18,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:18,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:18,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:18,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:18,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:18,965 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-28 11:23:18,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:18,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 11:23:18,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:23:18,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:23:18,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:23:18,966 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 12 states. [2018-11-28 11:23:19,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:19,387 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-11-28 11:23:19,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 11:23:19,388 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-11-28 11:23:19,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:19,388 INFO L225 Difference]: With dead ends: 117 [2018-11-28 11:23:19,388 INFO L226 Difference]: Without dead ends: 117 [2018-11-28 11:23:19,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-11-28 11:23:19,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-28 11:23:19,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-11-28 11:23:19,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-28 11:23:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2018-11-28 11:23:19,392 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 30 [2018-11-28 11:23:19,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:19,393 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2018-11-28 11:23:19,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:23:19,393 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2018-11-28 11:23:19,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 11:23:19,393 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:19,394 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:19,394 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-28 11:23:19,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:19,394 INFO L82 PathProgramCache]: Analyzing trace with hash 899005005, now seen corresponding path program 1 times [2018-11-28 11:23:19,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:19,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:19,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:19,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:19,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:19,582 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-28 11:23:19,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:19,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 11:23:19,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 11:23:19,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 11:23:19,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-11-28 11:23:19,583 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand 13 states. [2018-11-28 11:23:20,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:20,045 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2018-11-28 11:23:20,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 11:23:20,045 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-11-28 11:23:20,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:20,046 INFO L225 Difference]: With dead ends: 114 [2018-11-28 11:23:20,046 INFO L226 Difference]: Without dead ends: 114 [2018-11-28 11:23:20,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2018-11-28 11:23:20,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-28 11:23:20,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 104. [2018-11-28 11:23:20,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-28 11:23:20,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2018-11-28 11:23:20,050 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 30 [2018-11-28 11:23:20,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:20,050 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2018-11-28 11:23:20,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 11:23:20,050 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2018-11-28 11:23:20,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 11:23:20,051 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:20,051 INFO L402 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, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:20,051 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-28 11:23:20,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:20,052 INFO L82 PathProgramCache]: Analyzing trace with hash 460881481, now seen corresponding path program 1 times [2018-11-28 11:23:20,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:20,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:20,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:20,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:20,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:20,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:20,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:23:20,284 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_002cf4c3-2119-4872-a95c-21305de54600/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-28 11:23:20,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:20,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:20,396 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:20,397 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:20,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-28 11:23:20,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:20,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:20,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-11-28 11:23:20,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:23:20,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:23:20,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:20,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:20,467 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-28 11:23:20,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-11-28 11:23:20,538 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:20,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43 [2018-11-28 11:23:20,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 11:23:20,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:20,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:20,575 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-28 11:23:20,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-11-28 11:23:20,693 INFO L478 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-28 11:23:20,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 11:23:20,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:20,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:20,746 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-28 11:23:20,746 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:84 [2018-11-28 11:23:20,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2018-11-28 11:23:20,798 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:20,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-11-28 11:23:20,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:20,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:20,819 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-28 11:23:20,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2018-11-28 11:23:20,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-11-28 11:23:20,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-28 11:23:20,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:20,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 11:23:20,888 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:20,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:20,895 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-28 11:23:20,895 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-11-28 11:23:20,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:20,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:23:20,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2018-11-28 11:23:20,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-28 11:23:20,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-28 11:23:20,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2018-11-28 11:23:20,959 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 24 states. [2018-11-28 11:23:21,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:21,939 INFO L93 Difference]: Finished difference Result 195 states and 208 transitions. [2018-11-28 11:23:21,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-28 11:23:21,940 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 40 [2018-11-28 11:23:21,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:21,941 INFO L225 Difference]: With dead ends: 195 [2018-11-28 11:23:21,941 INFO L226 Difference]: Without dead ends: 195 [2018-11-28 11:23:21,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=313, Invalid=1092, Unknown=1, NotChecked=0, Total=1406 [2018-11-28 11:23:21,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-28 11:23:21,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 132. [2018-11-28 11:23:21,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-28 11:23:21,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2018-11-28 11:23:21,945 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 40 [2018-11-28 11:23:21,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:21,945 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2018-11-28 11:23:21,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-28 11:23:21,945 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2018-11-28 11:23:21,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 11:23:21,946 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:21,946 INFO L402 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, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:21,947 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-28 11:23:21,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:21,947 INFO L82 PathProgramCache]: Analyzing trace with hash 460881482, now seen corresponding path program 1 times [2018-11-28 11:23:21,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:21,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:21,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:21,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:21,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:22,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:22,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:23:22,146 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_002cf4c3-2119-4872-a95c-21305de54600/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-28 11:23:22,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:22,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:22,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 11:23:22,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:22,203 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:22,204 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:22,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:23:22,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:22,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:22,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-28 11:23:22,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:23:22,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:23:22,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:22,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:22,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:23:22,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:23:22,239 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:22,241 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:22,248 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-28 11:23:22,248 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-11-28 11:23:22,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-28 11:23:22,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 11:23:22,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:22,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:22,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2018-11-28 11:23:22,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-28 11:23:22,328 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:22,334 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:22,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 1 xjuncts. [2018-11-28 11:23:22,343 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-11-28 11:23:22,423 INFO L478 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-28 11:23:22,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-11-28 11:23:22,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:22,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:22,474 INFO L478 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-28 11:23:22,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 11:23:22,480 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:22,490 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:22,497 INFO L478 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-28 11:23:22,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 11:23:22,507 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:22,525 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:22,551 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-28 11:23:22,551 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:80, output treesize:123 [2018-11-28 11:23:22,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 92 [2018-11-28 11:23:22,617 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:22,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-11-28 11:23:22,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:22,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:22,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2018-11-28 11:23:22,643 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:22,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-11-28 11:23:22,645 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:22,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:22,657 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-28 11:23:22,657 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:109, output treesize:47 [2018-11-28 11:23:22,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-11-28 11:23:22,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 11:23:22,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:22,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-11-28 11:23:22,732 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:22,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:22,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-28 11:23:22,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 11:23:22,754 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:22,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 11:23:22,762 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:22,765 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:22,770 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-28 11:23:22,770 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-11-28 11:23:22,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:22,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:23:22,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 19 [2018-11-28 11:23:22,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 11:23:22,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 11:23:22,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-11-28 11:23:22,797 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand 20 states. [2018-11-28 11:23:23,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:23,908 INFO L93 Difference]: Finished difference Result 192 states and 208 transitions. [2018-11-28 11:23:23,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 11:23:23,909 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-11-28 11:23:23,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:23,910 INFO L225 Difference]: With dead ends: 192 [2018-11-28 11:23:23,910 INFO L226 Difference]: Without dead ends: 192 [2018-11-28 11:23:23,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=928, Unknown=3, NotChecked=0, Total=1122 [2018-11-28 11:23:23,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-28 11:23:23,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 134. [2018-11-28 11:23:23,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-28 11:23:23,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2018-11-28 11:23:23,915 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 40 [2018-11-28 11:23:23,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:23,916 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2018-11-28 11:23:23,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 11:23:23,916 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2018-11-28 11:23:23,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 11:23:23,917 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:23,917 INFO L402 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] [2018-11-28 11:23:23,917 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-28 11:23:23,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:23,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1824860725, now seen corresponding path program 1 times [2018-11-28 11:23:23,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:23,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:23,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:23,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:23,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:24,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:24,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:23:24,352 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_002cf4c3-2119-4872-a95c-21305de54600/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-28 11:23:24,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:24,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:24,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 11:23:24,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:24,459 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:24,460 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:24,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:23:24,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:24,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:24,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-28 11:23:24,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:23:24,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:23:24,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:24,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:24,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:23:24,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:23:24,561 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:24,563 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:24,582 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-28 11:23:24,582 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-11-28 11:23:24,678 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:24,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2018-11-28 11:23:24,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 11:23:24,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:24,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:24,709 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:24,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-28 11:23:24,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 11:23:24,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:24,721 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:24,731 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-28 11:23:24,731 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-11-28 11:23:24,863 INFO L478 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 62 treesize of output 57 [2018-11-28 11:23:24,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 11:23:24,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:24,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:24,945 INFO L478 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 77 [2018-11-28 11:23:24,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-11-28 11:23:24,959 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:24,982 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:24,989 INFO L478 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 68 treesize of output 67 [2018-11-28 11:23:24,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2018-11-28 11:23:24,994 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:25,005 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:25,039 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-28 11:23:25,039 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:83, output treesize:135 [2018-11-28 11:23:25,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2018-11-28 11:23:25,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:25,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 104 [2018-11-28 11:23:25,136 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:25,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-11-28 11:23:25,138 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:25,148 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:25,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2018-11-28 11:23:25,171 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:25,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-11-28 11:23:25,173 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:25,182 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:25,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-11-28 11:23:25,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 11:23:25,198 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:25,200 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:25,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:23:25,209 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:144, output treesize:57 [2018-11-28 11:23:25,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-11-28 11:23:25,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2018-11-28 11:23:25,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:25,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 11:23:25,318 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:25,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:25,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-28 11:23:25,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 11:23:25,335 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:25,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 11:23:25,340 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:25,342 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:25,350 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-28 11:23:25,350 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:71, output treesize:19 [2018-11-28 11:23:25,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-28 11:23:25,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-28 11:23:25,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:25,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:25,444 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-28 11:23:25,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-11-28 11:23:25,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:25,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:23:25,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 35 [2018-11-28 11:23:25,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-28 11:23:25,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-28 11:23:25,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1095, Unknown=0, NotChecked=0, Total=1190 [2018-11-28 11:23:25,552 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand 35 states. [2018-11-28 11:23:27,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:27,644 INFO L93 Difference]: Finished difference Result 197 states and 212 transitions. [2018-11-28 11:23:27,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-28 11:23:27,645 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 44 [2018-11-28 11:23:27,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:27,646 INFO L225 Difference]: With dead ends: 197 [2018-11-28 11:23:27,646 INFO L226 Difference]: Without dead ends: 196 [2018-11-28 11:23:27,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=394, Invalid=2683, Unknown=3, NotChecked=0, Total=3080 [2018-11-28 11:23:27,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-11-28 11:23:27,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 131. [2018-11-28 11:23:27,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-28 11:23:27,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2018-11-28 11:23:27,650 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 44 [2018-11-28 11:23:27,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:27,651 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2018-11-28 11:23:27,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-28 11:23:27,651 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2018-11-28 11:23:27,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 11:23:27,652 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:27,652 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:27,652 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-28 11:23:27,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:27,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1475687244, now seen corresponding path program 1 times [2018-11-28 11:23:27,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:27,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:27,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:27,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:27,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:27,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 11:23:27,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:23:27,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:23:27,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:23:27,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:23:27,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:23:27,712 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand 6 states. [2018-11-28 11:23:27,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:27,837 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-11-28 11:23:27,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:23:27,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-11-28 11:23:27,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:27,837 INFO L225 Difference]: With dead ends: 101 [2018-11-28 11:23:27,837 INFO L226 Difference]: Without dead ends: 101 [2018-11-28 11:23:27,838 INFO L631 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-28 11:23:27,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-28 11:23:27,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 94. [2018-11-28 11:23:27,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-28 11:23:27,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2018-11-28 11:23:27,841 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 47 [2018-11-28 11:23:27,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:27,841 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2018-11-28 11:23:27,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:23:27,841 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2018-11-28 11:23:27,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 11:23:27,842 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:27,842 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-11-28 11:23:27,842 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-28 11:23:27,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:27,843 INFO L82 PathProgramCache]: Analyzing trace with hash 130593269, now seen corresponding path program 2 times [2018-11-28 11:23:27,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:27,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:27,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:27,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:27,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:28,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:23:28,189 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_002cf4c3-2119-4872-a95c-21305de54600/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-28 11:23:28,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:23:28,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:23:28,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:23:28,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:28,242 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:28,243 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:28,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:23:28,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:28,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:28,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-11-28 11:23:28,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:23:28,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:23:28,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:28,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:28,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:23:28,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:23:28,319 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:28,322 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:28,332 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-28 11:23:28,332 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-11-28 11:23:28,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:28,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-28 11:23:28,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 11:23:28,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:28,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:28,423 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:28,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2018-11-28 11:23:28,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 11:23:28,432 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:28,441 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:28,453 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-28 11:23:28,453 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-11-28 11:23:28,568 INFO L478 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 39 treesize of output 45 [2018-11-28 11:23:28,571 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:23:28,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 32 [2018-11-28 11:23:28,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:28,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:28,597 INFO L478 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 68 treesize of output 63 [2018-11-28 11:23:28,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-11-28 11:23:28,605 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:28,617 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:28,642 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-28 11:23:28,643 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:84, output treesize:141 [2018-11-28 11:23:28,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 111 [2018-11-28 11:23:28,689 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:28,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2018-11-28 11:23:28,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:28,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:28,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 68 [2018-11-28 11:23:28,710 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:28,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2018-11-28 11:23:28,712 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:28,716 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:28,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:28,722 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:49 [2018-11-28 11:23:28,875 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:23:28,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2018-11-28 11:23:28,880 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:23:28,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2018-11-28 11:23:28,881 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-28 11:23:28,888 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:23:28,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-11-28 11:23:28,888 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:28,893 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-28 11:23:28,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-11-28 11:23:28,904 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:23:28,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-11-28 11:23:28,904 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:28,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 11:23:28,909 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:28,911 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:28,915 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-28 11:23:28,916 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:82, output treesize:7 [2018-11-28 11:23:28,963 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:28,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:23:28,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 33 [2018-11-28 11:23:28,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-28 11:23:28,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-28 11:23:28,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2018-11-28 11:23:28,981 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand 33 states. [2018-11-28 11:23:30,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:30,032 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-11-28 11:23:30,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 11:23:30,032 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 48 [2018-11-28 11:23:30,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:30,033 INFO L225 Difference]: With dead ends: 114 [2018-11-28 11:23:30,033 INFO L226 Difference]: Without dead ends: 95 [2018-11-28 11:23:30,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=314, Invalid=1941, Unknown=1, NotChecked=0, Total=2256 [2018-11-28 11:23:30,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-28 11:23:30,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 80. [2018-11-28 11:23:30,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-28 11:23:30,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-11-28 11:23:30,035 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 48 [2018-11-28 11:23:30,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:30,035 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-11-28 11:23:30,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-28 11:23:30,035 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-11-28 11:23:30,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 11:23:30,036 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:30,036 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:30,036 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-28 11:23:30,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:30,036 INFO L82 PathProgramCache]: Analyzing trace with hash 78663807, now seen corresponding path program 1 times [2018-11-28 11:23:30,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:30,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:30,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:30,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:30,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:30,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:30,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:23:30,390 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_002cf4c3-2119-4872-a95c-21305de54600/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-28 11:23:30,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:30,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:30,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:30,445 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:30,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:23:30,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:30,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:30,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-11-28 11:23:30,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:23:30,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:23:30,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:30,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:30,472 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-28 11:23:30,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-11-28 11:23:30,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-11-28 11:23:30,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 11:23:30,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:30,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:30,504 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-28 11:23:30,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-11-28 11:23:30,598 INFO L478 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-28 11:23:30,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 11:23:30,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:30,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:30,656 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-28 11:23:30,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:76 [2018-11-28 11:23:30,708 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:30,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-11-28 11:23:30,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:30,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 11:23:30,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:30,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:30,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:30,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:33 [2018-11-28 11:23:30,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:30,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:30,746 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:30,746 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:30,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 11:23:30,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:30,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:30,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:31 [2018-11-28 11:23:30,785 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:30,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-28 11:23:30,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-28 11:23:30,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:30,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:30,804 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-28 11:23:30,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:37 [2018-11-28 11:23:30,851 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:30,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 53 [2018-11-28 11:23:30,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 11:23:30,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:30,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:30,873 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-28 11:23:30,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-11-28 11:23:30,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 83 [2018-11-28 11:23:30,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-11-28 11:23:30,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:31,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:31,036 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-28 11:23:31,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:89, output treesize:126 [2018-11-28 11:23:31,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 77 [2018-11-28 11:23:31,109 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:31,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-11-28 11:23:31,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:31,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:31,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:23:31,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:104, output treesize:61 [2018-11-28 11:23:31,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 43 [2018-11-28 11:23:31,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-11-28 11:23:31,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:31,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 11:23:31,243 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:31,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 11:23:31,251 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:31,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:31,257 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-28 11:23:31,257 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:68, output treesize:5 [2018-11-28 11:23:31,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:31,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:23:31,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 32 [2018-11-28 11:23:31,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-28 11:23:31,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-28 11:23:31,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=927, Unknown=0, NotChecked=0, Total=1056 [2018-11-28 11:23:31,300 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 33 states. [2018-11-28 11:23:32,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:32,726 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2018-11-28 11:23:32,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-28 11:23:32,728 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 49 [2018-11-28 11:23:32,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:32,728 INFO L225 Difference]: With dead ends: 146 [2018-11-28 11:23:32,728 INFO L226 Difference]: Without dead ends: 146 [2018-11-28 11:23:32,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=424, Invalid=2650, Unknown=6, NotChecked=0, Total=3080 [2018-11-28 11:23:32,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-28 11:23:32,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 108. [2018-11-28 11:23:32,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-28 11:23:32,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2018-11-28 11:23:32,731 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 49 [2018-11-28 11:23:32,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:32,731 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2018-11-28 11:23:32,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-28 11:23:32,731 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2018-11-28 11:23:32,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 11:23:32,731 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:32,731 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:23:32,732 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-28 11:23:32,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:32,732 INFO L82 PathProgramCache]: Analyzing trace with hash 78663808, now seen corresponding path program 1 times [2018-11-28 11:23:32,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:32,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:32,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:32,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:32,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:33,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:33,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:23:33,181 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_002cf4c3-2119-4872-a95c-21305de54600/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-28 11:23:33,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:33,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:33,243 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:33,244 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:33,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:23:33,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:33,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:33,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-11-28 11:23:33,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:23:33,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:23:33,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:33,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:33,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:23:33,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:23:33,290 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:33,292 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:33,299 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-28 11:23:33,299 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-11-28 11:23:33,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:33,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-28 11:23:33,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 11:23:33,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:33,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:33,371 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:33,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2018-11-28 11:23:33,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 11:23:33,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:33,381 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:33,390 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-28 11:23:33,390 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-11-28 11:23:33,499 INFO L478 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-28 11:23:33,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 11:23:33,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:33,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:33,562 INFO L478 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-28 11:23:33,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2018-11-28 11:23:33,566 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:33,574 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:33,597 INFO L478 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-28 11:23:33,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-11-28 11:23:33,607 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:33,625 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:33,654 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-28 11:23:33,655 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:84, output treesize:137 [2018-11-28 11:23:33,727 INFO L478 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 38 treesize of output 44 [2018-11-28 11:23:33,730 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:33,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2018-11-28 11:23:33,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:33,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:33,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:33,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-11-28 11:23:33,774 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:33,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 11:23:33,785 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:33,793 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:33,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:33,805 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:99, output treesize:61 [2018-11-28 11:23:33,858 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:33,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 21 [2018-11-28 11:23:33,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:33,883 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:33,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:33,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:33,886 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:33,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 11:23:33,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:33,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:33,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:68 [2018-11-28 11:23:33,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-11-28 11:23:33,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-11-28 11:23:33,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:33,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:33,996 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:34,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-11-28 11:23:34,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-28 11:23:34,005 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:34,013 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:34,027 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-28 11:23:34,027 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:62 [2018-11-28 11:23:34,112 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:34,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 94 [2018-11-28 11:23:34,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 11:23:34,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:34,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:34,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-28 11:23:34,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 11:23:34,165 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:34,170 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:34,187 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-28 11:23:34,187 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:104, output treesize:88 [2018-11-28 11:23:34,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 107 [2018-11-28 11:23:34,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-11-28 11:23:34,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:34,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:34,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 110 [2018-11-28 11:23:34,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-11-28 11:23:34,443 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:34,457 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:34,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 118 [2018-11-28 11:23:34,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 39 [2018-11-28 11:23:34,474 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:34,498 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:34,549 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-28 11:23:34,550 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:142, output treesize:223 [2018-11-28 11:23:34,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 130 [2018-11-28 11:23:34,650 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:34,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-11-28 11:23:34,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:34,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:34,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 57 [2018-11-28 11:23:34,690 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:34,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-11-28 11:23:34,692 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:34,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:34,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:23:34,715 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:187, output treesize:101 [2018-11-28 11:23:34,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 61 [2018-11-28 11:23:34,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-11-28 11:23:34,907 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-28 11:23:34,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-11-28 11:23:34,928 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:34,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 11:23:34,950 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:34,966 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-28 11:23:34,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-28 11:23:34,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 11:23:34,996 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:35,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-28 11:23:35,004 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:35,007 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:35,019 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-28 11:23:35,020 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:115, output treesize:18 [2018-11-28 11:23:35,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:35,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:23:35,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 38 [2018-11-28 11:23:35,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-28 11:23:35,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-28 11:23:35,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1362, Unknown=0, NotChecked=0, Total=1482 [2018-11-28 11:23:35,200 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 39 states. [2018-11-28 11:23:37,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:37,591 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2018-11-28 11:23:37,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-28 11:23:37,591 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 49 [2018-11-28 11:23:37,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:37,592 INFO L225 Difference]: With dead ends: 148 [2018-11-28 11:23:37,592 INFO L226 Difference]: Without dead ends: 148 [2018-11-28 11:23:37,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=463, Invalid=3696, Unknown=1, NotChecked=0, Total=4160 [2018-11-28 11:23:37,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-28 11:23:37,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 110. [2018-11-28 11:23:37,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-28 11:23:37,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2018-11-28 11:23:37,594 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 49 [2018-11-28 11:23:37,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:37,595 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2018-11-28 11:23:37,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-28 11:23:37,595 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2018-11-28 11:23:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 11:23:37,595 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:37,595 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-11-28 11:23:37,596 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-28 11:23:37,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:37,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1362125989, now seen corresponding path program 3 times [2018-11-28 11:23:37,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:37,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:37,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:37,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:37,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:37,880 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:37,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:23:37,880 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_002cf4c3-2119-4872-a95c-21305de54600/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-28 11:23:37,891 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 11:23:37,954 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-28 11:23:37,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:23:37,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:38,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-11-28 11:23:38,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-28 11:23:38,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:38,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2018-11-28 11:23:38,040 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:38,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:38,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:38,057 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:27, output treesize:46 [2018-11-28 11:23:38,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2018-11-28 11:23:38,089 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:38,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 11:23:38,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:38,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:38,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 52 [2018-11-28 11:23:38,123 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:38,130 INFO L478 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 38 treesize of output 38 [2018-11-28 11:23:38,130 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:38,154 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:38,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-11-28 11:23:38,156 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:38,168 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:38,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:23:38,184 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:84, output treesize:70 [2018-11-28 11:23:38,226 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:38,227 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:38,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2018-11-28 11:23:38,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:38,252 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:38,253 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:38,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2018-11-28 11:23:38,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:38,279 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:38,280 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:38,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2018-11-28 11:23:38,281 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:38,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:23:38,307 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:103, output treesize:97 [2018-11-28 11:23:38,365 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 11:23:38,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:38,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2018-11-28 11:23:38,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-28 11:23:38,401 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:38,411 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:38,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 61 [2018-11-28 11:23:38,455 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:38,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 59 [2018-11-28 11:23:38,464 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-11-28 11:23:38,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-11-28 11:23:38,531 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:38,562 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:38,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:23:38,596 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:144, output treesize:115 [2018-11-28 11:23:38,764 INFO L478 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 69 [2018-11-28 11:23:38,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 62 [2018-11-28 11:23:38,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:38,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:38,836 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:38,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 60 [2018-11-28 11:23:38,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 11:23:38,842 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:38,855 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:38,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:23:38,882 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:119, output treesize:103 [2018-11-28 11:23:39,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 86 [2018-11-28 11:23:39,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 95 [2018-11-28 11:23:39,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:39,178 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:23:39,189 INFO L478 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 4 case distinctions, treesize of input 56 treesize of output 77 [2018-11-28 11:23:39,190 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-28 11:23:39,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-28 11:23:39,371 INFO L478 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 60 treesize of output 51 [2018-11-28 11:23:39,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 11:23:39,379 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:39,393 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:39,475 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 6 xjuncts. [2018-11-28 11:23:39,475 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:150, output treesize:336 [2018-11-28 11:23:39,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2018-11-28 11:23:39,617 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:39,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-11-28 11:23:39,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:39,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:39,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 104 treesize of output 86 [2018-11-28 11:23:39,696 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:39,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 83 [2018-11-28 11:23:39,698 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:39,750 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:39,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 81 [2018-11-28 11:23:39,760 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:39,791 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:39,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2018-11-28 11:23:39,847 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:39,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-11-28 11:23:39,851 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:39,868 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:39,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-11-28 11:23:39,914 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:247, output treesize:184 [2018-11-28 11:23:40,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2018-11-28 11:23:40,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 11:23:40,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:40,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-28 11:23:40,249 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:40,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:40,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 66 [2018-11-28 11:23:40,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2018-11-28 11:23:40,286 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:40,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2018-11-28 11:23:40,341 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:40,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-11-28 11:23:40,392 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:23:40,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2018-11-28 11:23:40,444 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:40,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 48 [2018-11-28 11:23:40,513 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 11:23:40,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-11-28 11:23:40,575 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:40,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-11-28 11:23:40,576 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:40,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 53 [2018-11-28 11:23:40,648 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-11-28 11:23:40,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-11-28 11:23:40,754 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:23:40,860 INFO L267 ElimStorePlain]: Start of recursive call 5: 8 dim-1 vars, End of recursive call: 5 dim-0 vars, and 8 xjuncts. [2018-11-28 11:23:40,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 14 dim-0 vars, and 9 xjuncts. [2018-11-28 11:23:40,972 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 9 variables, input treesize:119, output treesize:194 [2018-11-28 11:23:41,119 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:41,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:23:41,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-11-28 11:23:41,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-28 11:23:41,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-28 11:23:41,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1245, Unknown=1, NotChecked=0, Total=1406 [2018-11-28 11:23:41,138 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand 38 states. [2018-11-28 11:23:53,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:53,302 INFO L93 Difference]: Finished difference Result 183 states and 192 transitions. [2018-11-28 11:23:53,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-28 11:23:53,302 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 52 [2018-11-28 11:23:53,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:53,303 INFO L225 Difference]: With dead ends: 183 [2018-11-28 11:23:53,303 INFO L226 Difference]: Without dead ends: 183 [2018-11-28 11:23:53,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=632, Invalid=3398, Unknown=2, NotChecked=0, Total=4032 [2018-11-28 11:23:53,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-28 11:23:53,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 138. [2018-11-28 11:23:53,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-28 11:23:53,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2018-11-28 11:23:53,305 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 52 [2018-11-28 11:23:53,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:53,306 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2018-11-28 11:23:53,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-28 11:23:53,306 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2018-11-28 11:23:53,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 11:23:53,306 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:53,306 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-11-28 11:23:53,307 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-28 11:23:53,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:53,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1362125988, now seen corresponding path program 2 times [2018-11-28 11:23:53,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:53,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:53,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:53,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:53,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:53,644 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:53,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:23:53,644 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_002cf4c3-2119-4872-a95c-21305de54600/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-28 11:23:53,650 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:23:53,674 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:23:53,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:23:53,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:53,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 11:23:53,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:53,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:53,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 11:23:53,690 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:53,690 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:53,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:23:53,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:53,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:53,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-11-28 11:23:53,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:23:53,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:23:53,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:53,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:53,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:23:53,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-28 11:23:53,721 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:53,722 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:53,727 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-28 11:23:53,728 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-11-28 11:23:53,777 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:53,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-28 11:23:53,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 11:23:53,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:53,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:53,796 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:53,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2018-11-28 11:23:53,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 11:23:53,802 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:53,808 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:53,815 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-28 11:23:53,816 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-11-28 11:23:53,910 INFO L478 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-28 11:23:53,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 11:23:53,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:53,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:53,965 INFO L478 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-28 11:23:53,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2018-11-28 11:23:53,968 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:53,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:53,981 INFO L478 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-28 11:23:53,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-11-28 11:23:53,988 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:54,001 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:54,024 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-28 11:23:54,024 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:84, output treesize:137 [2018-11-28 11:23:54,075 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:54,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-11-28 11:23:54,080 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:54,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 11:23:54,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:54,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:54,104 INFO L478 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 38 treesize of output 44 [2018-11-28 11:23:54,107 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:54,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2018-11-28 11:23:54,108 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:54,113 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:54,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:54,122 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:99, output treesize:61 [2018-11-28 11:23:54,155 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:54,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 21 [2018-11-28 11:23:54,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:54,170 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:54,171 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:54,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:54,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:54,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 11:23:54,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:54,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:54,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:68 [2018-11-28 11:23:54,216 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:54,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-11-28 11:23:54,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-28 11:23:54,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:54,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:54,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-11-28 11:23:54,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-11-28 11:23:54,258 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:54,262 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:54,274 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-28 11:23:54,274 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:62 [2018-11-28 11:23:54,335 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:54,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 94 [2018-11-28 11:23:54,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 11:23:54,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:54,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:54,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-28 11:23:54,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 11:23:54,370 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:54,373 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:54,384 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-28 11:23:54,384 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:104, output treesize:88 [2018-11-28 11:23:54,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 107 [2018-11-28 11:23:54,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-11-28 11:23:54,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:54,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:54,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 110 [2018-11-28 11:23:54,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-11-28 11:23:54,569 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:54,581 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:54,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 118 [2018-11-28 11:23:54,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 39 [2018-11-28 11:23:54,594 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:54,613 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:54,651 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-28 11:23:54,651 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:142, output treesize:223 [2018-11-28 11:23:54,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 57 [2018-11-28 11:23:54,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:54,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-11-28 11:23:54,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:54,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:54,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 99 [2018-11-28 11:23:54,747 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:54,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-11-28 11:23:54,748 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:54,757 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:54,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:23:54,768 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:187, output treesize:101 [2018-11-28 11:23:54,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 61 [2018-11-28 11:23:54,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-11-28 11:23:54,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:54,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-11-28 11:23:54,877 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-28 11:23:54,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 11:23:54,887 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:54,895 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-28 11:23:54,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-28 11:23:54,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 11:23:54,908 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:54,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 11:23:54,912 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:54,913 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:54,919 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-28 11:23:54,920 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:115, output treesize:18 [2018-11-28 11:23:54,994 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:55,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:23:55,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 38 [2018-11-28 11:23:55,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-28 11:23:55,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-28 11:23:55,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1361, Unknown=0, NotChecked=0, Total=1482 [2018-11-28 11:23:55,009 INFO L87 Difference]: Start difference. First operand 138 states and 148 transitions. Second operand 39 states. [2018-11-28 11:23:57,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:23:57,455 INFO L93 Difference]: Finished difference Result 180 states and 192 transitions. [2018-11-28 11:23:57,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-28 11:23:57,455 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 52 [2018-11-28 11:23:57,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:23:57,456 INFO L225 Difference]: With dead ends: 180 [2018-11-28 11:23:57,456 INFO L226 Difference]: Without dead ends: 180 [2018-11-28 11:23:57,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=465, Invalid=3694, Unknown=1, NotChecked=0, Total=4160 [2018-11-28 11:23:57,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-11-28 11:23:57,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 120. [2018-11-28 11:23:57,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-28 11:23:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-11-28 11:23:57,459 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 52 [2018-11-28 11:23:57,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:23:57,460 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-11-28 11:23:57,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-28 11:23:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-11-28 11:23:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 11:23:57,460 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:23:57,460 INFO L402 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] [2018-11-28 11:23:57,461 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-28 11:23:57,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:23:57,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1691181823, now seen corresponding path program 1 times [2018-11-28 11:23:57,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:23:57,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:23:57,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:57,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:23:57,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:23:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:57,757 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:57,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:23:57,757 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_002cf4c3-2119-4872-a95c-21305de54600/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-28 11:23:57,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:23:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:23:57,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:23:57,794 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:57,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:57,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 11:23:57,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:57,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:57,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-11-28 11:23:57,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:23:57,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:23:57,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:57,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:57,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-28 11:23:57,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-28 11:23:57,818 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:57,819 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:57,826 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-28 11:23:57,826 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:20 [2018-11-28 11:23:57,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-11-28 11:23:57,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 11:23:57,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:57,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:57,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2018-11-28 11:23:57,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 11:23:57,850 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:57,854 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:57,860 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-28 11:23:57,860 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:62, output treesize:46 [2018-11-28 11:23:57,942 INFO L478 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-28 11:23:57,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 39 [2018-11-28 11:23:57,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:57,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:57,984 INFO L478 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-28 11:23:57,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-11-28 11:23:57,991 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:58,004 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:58,009 INFO L478 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-28 11:23:58,011 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:23:58,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-11-28 11:23:58,012 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,019 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,042 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-28 11:23:58,043 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:81, output treesize:141 [2018-11-28 11:23:58,101 INFO L478 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 59 [2018-11-28 11:23:58,103 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:58,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-11-28 11:23:58,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,122 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:58,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2018-11-28 11:23:58,127 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:58,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-28 11:23:58,128 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,133 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,140 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:97, output treesize:59 [2018-11-28 11:23:58,142 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:58,143 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:58,144 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:58,144 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:58,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 42 [2018-11-28 11:23:58,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:76 [2018-11-28 11:23:58,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2018-11-28 11:23:58,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-11-28 11:23:58,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,214 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:58,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-11-28 11:23:58,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-11-28 11:23:58,219 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,226 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,235 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-28 11:23:58,236 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:98, output treesize:74 [2018-11-28 11:23:58,300 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:58,301 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:58,302 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:58,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 120 [2018-11-28 11:23:58,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 11:23:58,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2018-11-28 11:23:58,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 11:23:58,347 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,352 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,363 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-28 11:23:58,363 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:116, output treesize:96 [2018-11-28 11:23:58,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 117 [2018-11-28 11:23:58,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-11-28 11:23:58,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:58,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:58,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 129 [2018-11-28 11:23:58,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-11-28 11:23:58,563 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-28 11:23:58,579 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:23:58,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 121 [2018-11-28 11:23:58,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2018-11-28 11:23:58,587 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,597 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,630 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-28 11:23:58,630 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:163, output treesize:237 [2018-11-28 11:23:58,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 164 [2018-11-28 11:23:58,699 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:58,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2018-11-28 11:23:58,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 121 [2018-11-28 11:23:58,729 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:23:58,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2018-11-28 11:23:58,731 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,737 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,746 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-28 11:23:58,746 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:224, output treesize:114 [2018-11-28 11:23:58,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 88 [2018-11-28 11:23:58,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 57 [2018-11-28 11:23:58,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 11:23:58,832 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,844 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-28 11:23:58,845 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:128, output treesize:86 [2018-11-28 11:23:58,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 50 [2018-11-28 11:23:58,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-11-28 11:23:58,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-11-28 11:23:58,952 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-28 11:23:58,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 11:23:58,958 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:23:58,962 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-28 11:23:58,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:23:58,967 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:90, output treesize:28 [2018-11-28 11:23:59,036 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:23:59,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:23:59,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 37 [2018-11-28 11:23:59,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-28 11:23:59,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-28 11:23:59,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1242, Unknown=0, NotChecked=0, Total=1406 [2018-11-28 11:23:59,052 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 38 states. [2018-11-28 11:24:00,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:24:00,412 INFO L93 Difference]: Finished difference Result 182 states and 192 transitions. [2018-11-28 11:24:00,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-28 11:24:00,412 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 53 [2018-11-28 11:24:00,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:24:00,412 INFO L225 Difference]: With dead ends: 182 [2018-11-28 11:24:00,413 INFO L226 Difference]: Without dead ends: 182 [2018-11-28 11:24:00,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=473, Invalid=3187, Unknown=0, NotChecked=0, Total=3660 [2018-11-28 11:24:00,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-28 11:24:00,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 142. [2018-11-28 11:24:00,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-28 11:24:00,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2018-11-28 11:24:00,415 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 53 [2018-11-28 11:24:00,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:24:00,415 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2018-11-28 11:24:00,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-28 11:24:00,415 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2018-11-28 11:24:00,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 11:24:00,415 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:24:00,416 INFO L402 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] [2018-11-28 11:24:00,416 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-28 11:24:00,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:24:00,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1691181822, now seen corresponding path program 1 times [2018-11-28 11:24:00,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:24:00,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:24:00,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:24:00,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:24:00,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:24:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:24:00,791 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:24:00,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:24:00,791 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_002cf4c3-2119-4872-a95c-21305de54600/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-28 11:24:00,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:24:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:24:00,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:24:00,825 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:00,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:00,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-28 11:24:00,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:00,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:24:00,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-11-28 11:24:00,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:24:00,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-28 11:24:00,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:00,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:24:00,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 11:24:00,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 11:24:00,845 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:00,846 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:24:00,852 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-28 11:24:00,852 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:20 [2018-11-28 11:24:00,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-11-28 11:24:00,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 11:24:00,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:00,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:24:00,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-11-28 11:24:00,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 11:24:00,879 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:00,880 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:24:00,886 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-28 11:24:00,886 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:62, output treesize:46 [2018-11-28 11:24:00,979 INFO L478 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 42 [2018-11-28 11:24:00,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 39 [2018-11-28 11:24:00,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:24:00,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:24:01,020 INFO L478 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 62 [2018-11-28 11:24:01,022 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:24:01,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-11-28 11:24:01,023 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:01,030 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:24:01,035 INFO L478 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 66 [2018-11-28 11:24:01,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-11-28 11:24:01,042 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-28 11:24:01,054 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:24:01,078 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-28 11:24:01,078 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:81, output treesize:141 [2018-11-28 11:24:01,133 INFO L478 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 59 [2018-11-28 11:24:01,135 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:01,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-11-28 11:24:01,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:01,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:24:01,154 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:01,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2018-11-28 11:24:01,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:01,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-28 11:24:01,160 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:01,165 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:24:01,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:24:01,172 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:97, output treesize:59 [2018-11-28 11:24:01,174 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:01,175 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:01,176 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:01,176 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:01,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 11:24:01,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:01,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 11:24:01,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:01,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:24:01,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:65 [2018-11-28 11:24:01,228 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:24:01,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 60 [2018-11-28 11:24:01,237 INFO L478 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-28 11:24:01,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:01,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:24:01,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:01,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-11-28 11:24:01,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-11-28 11:24:01,268 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:01,274 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:24:01,281 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-28 11:24:01,281 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:84, output treesize:75 [2018-11-28 11:24:01,341 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:01,341 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:01,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 102 [2018-11-28 11:24:01,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 11:24:01,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:01,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:24:01,371 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:01,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 106 [2018-11-28 11:24:01,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 11:24:01,378 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:01,389 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:24:01,398 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-28 11:24:01,398 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:117, output treesize:97 [2018-11-28 11:24:01,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 136 [2018-11-28 11:24:01,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-11-28 11:24:01,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:24:01,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:24:01,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 114 [2018-11-28 11:24:01,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2018-11-28 11:24:01,583 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:01,593 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:24:01,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 122 [2018-11-28 11:24:01,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-11-28 11:24:01,610 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-28 11:24:01,631 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:24:01,666 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-28 11:24:01,667 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:164, output treesize:239 [2018-11-28 11:24:01,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 199 [2018-11-28 11:24:01,749 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:01,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2018-11-28 11:24:01,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:01,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:24:01,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 127 [2018-11-28 11:24:01,784 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:24:01,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2018-11-28 11:24:01,786 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:01,795 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:24:01,802 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-28 11:24:01,802 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:225, output treesize:115 [2018-11-28 11:24:01,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 98 [2018-11-28 11:24:01,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 11:24:01,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:01,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 23 [2018-11-28 11:24:01,987 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:01,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-11-28 11:24:01,995 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-28 11:24:02,002 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-28 11:24:02,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2018-11-28 11:24:02,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-28 11:24:02,012 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:02,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 11:24:02,019 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 11:24:02,020 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:24:02,024 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-28 11:24:02,024 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:145, output treesize:9 [2018-11-28 11:24:02,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:24:02,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:24:02,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 35 [2018-11-28 11:24:02,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-28 11:24:02,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-28 11:24:02,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1142, Unknown=0, NotChecked=0, Total=1260 [2018-11-28 11:24:02,053 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 36 states. [2018-11-28 11:24:03,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:24:03,335 INFO L93 Difference]: Finished difference Result 177 states and 189 transitions. [2018-11-28 11:24:03,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-28 11:24:03,335 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 53 [2018-11-28 11:24:03,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:24:03,336 INFO L225 Difference]: With dead ends: 177 [2018-11-28 11:24:03,336 INFO L226 Difference]: Without dead ends: 177 [2018-11-28 11:24:03,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=320, Invalid=2870, Unknown=2, NotChecked=0, Total=3192 [2018-11-28 11:24:03,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-28 11:24:03,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 142. [2018-11-28 11:24:03,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-28 11:24:03,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2018-11-28 11:24:03,339 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 152 transitions. Word has length 53 [2018-11-28 11:24:03,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:24:03,339 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 152 transitions. [2018-11-28 11:24:03,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-28 11:24:03,339 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2018-11-28 11:24:03,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 11:24:03,340 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:24:03,340 INFO L402 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-28 11:24:03,340 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr58ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION]=== [2018-11-28 11:24:03,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:24:03,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1728090713, now seen corresponding path program 1 times [2018-11-28 11:24:03,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:24:03,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:24:03,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:24:03,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:24:03,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:24:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:24:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:24:03,380 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 11:24:03,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:24:03 BoogieIcfgContainer [2018-11-28 11:24:03,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:24:03,407 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:24:03,407 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:24:03,409 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:24:03,410 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:14" (3/4) ... [2018-11-28 11:24:03,412 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 11:24:03,445 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_002cf4c3-2119-4872-a95c-21305de54600/bin-2019/uautomizer/witness.graphml [2018-11-28 11:24:03,445 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:24:03,446 INFO L168 Benchmark]: Toolchain (without parser) took 49518.69 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 585.6 MB). Free memory was 956.0 MB in the beginning and 881.9 MB in the end (delta: 74.1 MB). Peak memory consumption was 659.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:24:03,448 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:24:03,448 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -179.4 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2018-11-28 11:24:03,449 INFO L168 Benchmark]: Boogie Preprocessor took 51.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:24:03,449 INFO L168 Benchmark]: RCFGBuilder took 538.80 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: 62.6 MB). Peak memory consumption was 62.6 MB. Max. memory is 11.5 GB. [2018-11-28 11:24:03,449 INFO L168 Benchmark]: TraceAbstraction took 48496.71 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 435.2 MB). Free memory was 1.1 GB in the beginning and 881.9 MB in the end (delta: 187.6 MB). Peak memory consumption was 622.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:24:03,449 INFO L168 Benchmark]: Witness Printer took 38.02 ms. Allocated memory is still 1.6 GB. Free memory was 881.9 MB in the beginning and 881.9 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-28 11:24:03,450 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 390.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -179.4 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 538.80 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: 62.6 MB). Peak memory consumption was 62.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 48496.71 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 435.2 MB). Free memory was 1.1 GB in the beginning and 881.9 MB in the end (delta: 187.6 MB). Peak memory consumption was 622.7 MB. Max. memory is 11.5 GB. * Witness Printer took 38.02 ms. Allocated memory is still 1.6 GB. Free memory was 881.9 MB in the beginning and 881.9 MB in the end (delta: 24 B). Peak memory consumption was 24 B. 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] SLL* list = malloc(sizeof(SLL)); VAL [list={26:0}, malloc(sizeof(SLL))={26:0}] [L995] list->next = ((void*)0) VAL [list={26:0}, malloc(sizeof(SLL))={26:0}] [L996] list->prev = ((void*)0) VAL [list={26:0}, malloc(sizeof(SLL))={26:0}] [L997] list->colour = BLACK VAL [list={26:0}, malloc(sizeof(SLL))={26:0}] [L999] SLL* end = list; VAL [end={26:0}, list={26:0}, malloc(sizeof(SLL))={26:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] end->next = malloc(sizeof(SLL)) VAL [end={26:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1006] EXPR end->next VAL [end={26:0}, end->next={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1006] end->next->prev = end VAL [end={26:0}, end->next={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1007] EXPR end->next VAL [end={26:0}, end->next={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1007] end = end->next [L1008] end->next = ((void*)0) VAL [end={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1016] end->colour = RED VAL [end={31:0}, list={26:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1017] end->next = malloc(sizeof(SLL)) VAL [end={31:0}, list={26:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1018] EXPR end->next VAL [end={31:0}, end->next={30:0}, list={26:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1018] end->next->prev = end VAL [end={31:0}, end->next={30:0}, list={26:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1019] EXPR end->next VAL [end={31:0}, end->next={30:0}, list={26:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1019] end = end->next [L1020] end->next = ((void*)0) VAL [end={30:0}, list={26:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1021] end->colour = BLACK VAL [end={30:0}, list={26:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1025] end = ((void*)0) [L1026] end = list VAL [end={26:0}, list={26:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1029] COND FALSE !(!(((void*)0) != end)) VAL [end={26:0}, list={26:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1030] EXPR end->colour VAL [end={26:0}, end->colour=1, list={26:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1030] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE ((void*)0) != end VAL [end={26:0}, list={26:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1034] EXPR end->colour VAL [end={26:0}, end->colour=1, list={26:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1034] COND FALSE !(RED == end->colour) [L1040] EXPR end->next VAL [end={26:0}, end->next={31:0}, list={26:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1040] COND FALSE !(!(end->next)) [L1041] EXPR end->next VAL [end={26:0}, end->next={31:0}, list={26:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1041] end = end->next [L1032] COND TRUE ((void*)0) != end VAL [end={31:0}, list={26:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1034] EXPR end->colour VAL [end={31:0}, end->colour=0, list={26:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1034] COND TRUE RED == end->colour [L1036] EXPR end->next VAL [end={31:0}, end->next={30:0}, list={26:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1036] end = end->next [L1037] EXPR end->next VAL [end={30:0}, end->next={0:0}, list={26:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={31:0}, malloc(sizeof(SLL))={26:0}] [L1037] end = end->next [L1040] end->next - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 129 locations, 59 error locations. UNSAFE Result, 48.4s OverallTime, 27 OverallIterations, 3 TraceHistogramMax, 30.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1571 SDtfs, 5127 SDslu, 7893 SDs, 0 SdLazy, 16658 SolverSat, 1179 SolverUnsat, 27 SolverUnknown, 0 SolverNotchecked, 17.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1056 GetRequests, 362 SyntacticMatches, 47 SemanticMatches, 647 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7307 ImplicationChecksByTransitivity, 19.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred 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, 853 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 16.9s InterpolantComputationTime, 1356 NumberOfCodeBlocks, 1356 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1265 ConstructedInterpolants, 238 QuantifiedInterpolants, 1662919 SizeOfPredicates, 190 NumberOfNonLiveVariables, 2242 ConjunctsInSsa, 525 ConjunctsInUnsatCore, 36 InterpolantComputations, 16 PerfectInterpolantSequences, 19/167 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...