./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/length_test03_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/length_test03_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2552da43a16cb54d5090a24426eb170717bf5525 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/length_test03_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2552da43a16cb54d5090a24426eb170717bf5525 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_prenex_95 term size 44 --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 16:49:29,491 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:49:29,492 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:49:29,497 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:49:29,498 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:49:29,498 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:49:29,499 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:49:29,500 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:49:29,501 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:49:29,501 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:49:29,502 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:49:29,502 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:49:29,503 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:49:29,503 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:49:29,504 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:49:29,504 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:49:29,505 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:49:29,506 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:49:29,507 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:49:29,508 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:49:29,509 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:49:29,510 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:49:29,511 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:49:29,511 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:49:29,511 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:49:29,512 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:49:29,512 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:49:29,513 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:49:29,513 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:49:29,514 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:49:29,514 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:49:29,515 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:49:29,515 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:49:29,515 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:49:29,516 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:49:29,516 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:49:29,517 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-18 16:49:29,527 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:49:29,527 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:49:29,528 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:49:29,528 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 16:49:29,528 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 16:49:29,528 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 16:49:29,528 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 16:49:29,528 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 16:49:29,529 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 16:49:29,529 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 16:49:29,529 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 16:49:29,529 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 16:49:29,529 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 16:49:29,530 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:49:29,530 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:49:29,530 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:49:29,530 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:49:29,530 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 16:49:29,530 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:49:29,530 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:49:29,530 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:49:29,531 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-18 16:49:29,531 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-18 16:49:29,531 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-18 16:49:29,531 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:49:29,531 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:49:29,531 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:49:29,531 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:49:29,532 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:49:29,532 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:49:29,532 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 16:49:29,532 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:49:29,532 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:49:29,532 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:49:29,532 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 16:49:29,532 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:49:29,533 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 16:49:29,533 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan 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 -> Taipan 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 -> 2552da43a16cb54d5090a24426eb170717bf5525 [2018-11-18 16:49:29,556 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:49:29,565 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:49:29,567 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:49:29,569 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:49:29,569 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:49:29,569 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/../../sv-benchmarks/c/memsafety-ext2/length_test03_false-valid-memtrack.i [2018-11-18 16:49:29,612 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/data/ea6e9f9dd/ea3eda1236fe4352be4a1432e5f606f1/FLAGbd99ed7d3 [2018-11-18 16:49:30,056 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:49:30,057 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/sv-benchmarks/c/memsafety-ext2/length_test03_false-valid-memtrack.i [2018-11-18 16:49:30,067 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/data/ea6e9f9dd/ea3eda1236fe4352be4a1432e5f606f1/FLAGbd99ed7d3 [2018-11-18 16:49:30,077 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/data/ea6e9f9dd/ea3eda1236fe4352be4a1432e5f606f1 [2018-11-18 16:49:30,079 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:49:30,080 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:49:30,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:49:30,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:49:30,083 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:49:30,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:49:30" (1/1) ... [2018-11-18 16:49:30,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a1e0494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:30, skipping insertion in model container [2018-11-18 16:49:30,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:49:30" (1/1) ... [2018-11-18 16:49:30,091 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:49:30,119 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:49:30,316 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:49:30,323 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:49:30,357 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:49:30,424 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:49:30,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:30 WrapperNode [2018-11-18 16:49:30,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:49:30,425 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:49:30,425 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:49:30,426 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:49:30,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:30" (1/1) ... [2018-11-18 16:49:30,442 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:30" (1/1) ... [2018-11-18 16:49:30,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:49:30,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:49:30,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:49:30,449 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:49:30,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:30" (1/1) ... [2018-11-18 16:49:30,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:30" (1/1) ... [2018-11-18 16:49:30,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:30" (1/1) ... [2018-11-18 16:49:30,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:30" (1/1) ... [2018-11-18 16:49:30,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:30" (1/1) ... [2018-11-18 16:49:30,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:30" (1/1) ... [2018-11-18 16:49:30,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:30" (1/1) ... [2018-11-18 16:49:30,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:49:30,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:49:30,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:49:30,476 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:49:30,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:49:30,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 16:49:30,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 16:49:30,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 16:49:30,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 16:49:30,513 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 16:49:30,513 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 16:49:30,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 16:49:30,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 16:49:30,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 16:49:30,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:49:30,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:49:30,514 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-11-18 16:49:30,514 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-11-18 16:49:30,899 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:49:30,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:49:30 BoogieIcfgContainer [2018-11-18 16:49:30,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:49:30,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 16:49:30,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 16:49:30,903 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 16:49:30,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:49:30" (1/3) ... [2018-11-18 16:49:30,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f019ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:49:30, skipping insertion in model container [2018-11-18 16:49:30,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:30" (2/3) ... [2018-11-18 16:49:30,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f019ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:49:30, skipping insertion in model container [2018-11-18 16:49:30,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:49:30" (3/3) ... [2018-11-18 16:49:30,906 INFO L112 eAbstractionObserver]: Analyzing ICFG length_test03_false-valid-memtrack.i [2018-11-18 16:49:30,912 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 16:49:30,916 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-11-18 16:49:30,926 INFO L257 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2018-11-18 16:49:30,947 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 16:49:30,947 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-18 16:49:30,947 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 16:49:30,947 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:49:30,947 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:49:30,948 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 16:49:30,948 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:49:30,948 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 16:49:30,958 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states. [2018-11-18 16:49:30,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 16:49:30,965 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:30,965 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:30,967 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr10REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION]=== [2018-11-18 16:49:30,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:30,970 INFO L82 PathProgramCache]: Analyzing trace with hash -963964013, now seen corresponding path program 1 times [2018-11-18 16:49:30,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:49:31,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:31,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:31,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:31,008 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:49:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:31,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:31,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:31,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:49:31,080 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:49:31,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:49:31,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:49:31,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:31,092 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 3 states. [2018-11-18 16:49:31,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:31,244 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2018-11-18 16:49:31,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:49:31,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-18 16:49:31,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:31,255 INFO L225 Difference]: With dead ends: 161 [2018-11-18 16:49:31,256 INFO L226 Difference]: Without dead ends: 158 [2018-11-18 16:49:31,257 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:31,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-18 16:49:31,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 123. [2018-11-18 16:49:31,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-18 16:49:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2018-11-18 16:49:31,295 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 7 [2018-11-18 16:49:31,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:31,295 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2018-11-18 16:49:31,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:49:31,295 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2018-11-18 16:49:31,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 16:49:31,295 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:31,296 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:31,296 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr10REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION]=== [2018-11-18 16:49:31,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:31,296 INFO L82 PathProgramCache]: Analyzing trace with hash -963964012, now seen corresponding path program 1 times [2018-11-18 16:49:31,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:49:31,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:31,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:31,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:31,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:49:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:31,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:31,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:31,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:49:31,341 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:49:31,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:49:31,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:49:31,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:31,342 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand 3 states. [2018-11-18 16:49:31,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:31,421 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2018-11-18 16:49:31,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:49:31,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-18 16:49:31,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:31,422 INFO L225 Difference]: With dead ends: 123 [2018-11-18 16:49:31,422 INFO L226 Difference]: Without dead ends: 123 [2018-11-18 16:49:31,423 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:31,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-18 16:49:31,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-11-18 16:49:31,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-18 16:49:31,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2018-11-18 16:49:31,428 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 7 [2018-11-18 16:49:31,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:31,428 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2018-11-18 16:49:31,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:49:31,429 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2018-11-18 16:49:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 16:49:31,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:31,429 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:31,429 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr10REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION]=== [2018-11-18 16:49:31,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:31,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1300590983, now seen corresponding path program 1 times [2018-11-18 16:49:31,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:49:31,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:31,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:31,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:31,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:49:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:31,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:31,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:31,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:49:31,451 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:49:31,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:49:31,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:49:31,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:31,452 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand 3 states. [2018-11-18 16:49:31,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:31,564 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2018-11-18 16:49:31,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:49:31,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-18 16:49:31,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:31,566 INFO L225 Difference]: With dead ends: 135 [2018-11-18 16:49:31,566 INFO L226 Difference]: Without dead ends: 135 [2018-11-18 16:49:31,566 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:31,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-18 16:49:31,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2018-11-18 16:49:31,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-18 16:49:31,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-11-18 16:49:31,573 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 10 [2018-11-18 16:49:31,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:31,573 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-11-18 16:49:31,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:49:31,574 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-11-18 16:49:31,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 16:49:31,574 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:31,574 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:31,574 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr10REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION]=== [2018-11-18 16:49:31,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:31,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1300590982, now seen corresponding path program 1 times [2018-11-18 16:49:31,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:49:31,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:31,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:31,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:31,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:49:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:31,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:31,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:31,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:49:31,607 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:49:31,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:49:31,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:49:31,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:31,608 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 3 states. [2018-11-18 16:49:31,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:31,661 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2018-11-18 16:49:31,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:49:31,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-18 16:49:31,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:31,662 INFO L225 Difference]: With dead ends: 124 [2018-11-18 16:49:31,662 INFO L226 Difference]: Without dead ends: 124 [2018-11-18 16:49:31,662 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:31,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-18 16:49:31,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-11-18 16:49:31,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-18 16:49:31,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-11-18 16:49:31,667 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 10 [2018-11-18 16:49:31,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:31,667 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-11-18 16:49:31,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:49:31,667 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-11-18 16:49:31,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 16:49:31,668 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:31,668 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:31,668 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr10REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION]=== [2018-11-18 16:49:31,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:31,669 INFO L82 PathProgramCache]: Analyzing trace with hash 204096602, now seen corresponding path program 1 times [2018-11-18 16:49:31,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:49:31,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:31,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:31,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:31,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:49:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:31,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:31,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:31,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:49:31,706 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:49:31,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:49:31,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:49:31,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:31,707 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 3 states. [2018-11-18 16:49:31,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:31,768 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2018-11-18 16:49:31,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:49:31,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-18 16:49:31,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:31,769 INFO L225 Difference]: With dead ends: 117 [2018-11-18 16:49:31,769 INFO L226 Difference]: Without dead ends: 117 [2018-11-18 16:49:31,769 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:31,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-18 16:49:31,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-11-18 16:49:31,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-18 16:49:31,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2018-11-18 16:49:31,773 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 16 [2018-11-18 16:49:31,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:31,774 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2018-11-18 16:49:31,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:49:31,774 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2018-11-18 16:49:31,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 16:49:31,774 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:31,774 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:31,775 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr10REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION]=== [2018-11-18 16:49:31,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:31,775 INFO L82 PathProgramCache]: Analyzing trace with hash 204096603, now seen corresponding path program 1 times [2018-11-18 16:49:31,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:49:31,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:31,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:31,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:31,776 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:49:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:31,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:31,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:31,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:49:31,811 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:49:31,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:49:31,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:49:31,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:31,812 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 3 states. [2018-11-18 16:49:31,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:31,857 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2018-11-18 16:49:31,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:49:31,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-18 16:49:31,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:31,858 INFO L225 Difference]: With dead ends: 112 [2018-11-18 16:49:31,858 INFO L226 Difference]: Without dead ends: 112 [2018-11-18 16:49:31,858 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:31,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-18 16:49:31,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-11-18 16:49:31,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-18 16:49:31,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2018-11-18 16:49:31,863 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 16 [2018-11-18 16:49:31,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:31,864 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2018-11-18 16:49:31,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:49:31,864 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-11-18 16:49:31,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 16:49:31,864 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:31,864 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:31,865 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr10REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION]=== [2018-11-18 16:49:31,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:31,865 INFO L82 PathProgramCache]: Analyzing trace with hash 2032027461, now seen corresponding path program 1 times [2018-11-18 16:49:31,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:49:31,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:31,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:31,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:31,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:49:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:31,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:31,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:31,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:49:31,926 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:49:31,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:49:31,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:49:31,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:49:31,927 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 6 states. [2018-11-18 16:49:32,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:32,065 INFO L93 Difference]: Finished difference Result 174 states and 187 transitions. [2018-11-18 16:49:32,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:49:32,066 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-18 16:49:32,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:32,066 INFO L225 Difference]: With dead ends: 174 [2018-11-18 16:49:32,067 INFO L226 Difference]: Without dead ends: 174 [2018-11-18 16:49:32,067 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:49:32,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-18 16:49:32,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 131. [2018-11-18 16:49:32,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-18 16:49:32,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 151 transitions. [2018-11-18 16:49:32,072 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 151 transitions. Word has length 17 [2018-11-18 16:49:32,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:32,073 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 151 transitions. [2018-11-18 16:49:32,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:49:32,073 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 151 transitions. [2018-11-18 16:49:32,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 16:49:32,073 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:32,073 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:32,074 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr10REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION]=== [2018-11-18 16:49:32,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:32,074 INFO L82 PathProgramCache]: Analyzing trace with hash 2032027462, now seen corresponding path program 1 times [2018-11-18 16:49:32,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:49:32,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:32,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:32,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:32,075 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:49:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:32,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:32,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:32,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:49:32,161 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:49:32,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:49:32,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:49:32,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:49:32,162 INFO L87 Difference]: Start difference. First operand 131 states and 151 transitions. Second operand 6 states. [2018-11-18 16:49:32,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:32,268 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2018-11-18 16:49:32,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:49:32,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-18 16:49:32,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:32,269 INFO L225 Difference]: With dead ends: 157 [2018-11-18 16:49:32,269 INFO L226 Difference]: Without dead ends: 157 [2018-11-18 16:49:32,269 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:49:32,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-18 16:49:32,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2018-11-18 16:49:32,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-18 16:49:32,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 179 transitions. [2018-11-18 16:49:32,274 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 179 transitions. Word has length 17 [2018-11-18 16:49:32,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:32,274 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 179 transitions. [2018-11-18 16:49:32,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:49:32,280 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 179 transitions. [2018-11-18 16:49:32,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 16:49:32,281 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:32,281 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:32,282 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr10REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION]=== [2018-11-18 16:49:32,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:32,283 INFO L82 PathProgramCache]: Analyzing trace with hash -935781227, now seen corresponding path program 1 times [2018-11-18 16:49:32,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:49:32,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:32,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:32,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:32,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:49:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:32,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:32,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:32,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 16:49:32,446 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:49:32,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 16:49:32,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 16:49:32,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:49:32,447 INFO L87 Difference]: Start difference. First operand 155 states and 179 transitions. Second operand 9 states. [2018-11-18 16:49:32,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:32,646 INFO L93 Difference]: Finished difference Result 189 states and 212 transitions. [2018-11-18 16:49:32,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 16:49:32,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-18 16:49:32,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:32,647 INFO L225 Difference]: With dead ends: 189 [2018-11-18 16:49:32,647 INFO L226 Difference]: Without dead ends: 189 [2018-11-18 16:49:32,647 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-18 16:49:32,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-18 16:49:32,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 155. [2018-11-18 16:49:32,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-18 16:49:32,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 178 transitions. [2018-11-18 16:49:32,650 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 178 transitions. Word has length 26 [2018-11-18 16:49:32,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:32,651 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 178 transitions. [2018-11-18 16:49:32,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 16:49:32,651 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 178 transitions. [2018-11-18 16:49:32,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 16:49:32,651 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:32,651 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:32,651 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr10REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION]=== [2018-11-18 16:49:32,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:32,651 INFO L82 PathProgramCache]: Analyzing trace with hash 723673912, now seen corresponding path program 1 times [2018-11-18 16:49:32,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:49:32,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:32,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:32,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:32,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:49:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:32,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:32,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:32,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 16:49:32,878 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:49:32,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 16:49:32,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 16:49:32,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:49:32,879 INFO L87 Difference]: Start difference. First operand 155 states and 178 transitions. Second operand 9 states. [2018-11-18 16:49:33,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:33,075 INFO L93 Difference]: Finished difference Result 147 states and 167 transitions. [2018-11-18 16:49:33,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 16:49:33,076 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-18 16:49:33,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:33,077 INFO L225 Difference]: With dead ends: 147 [2018-11-18 16:49:33,077 INFO L226 Difference]: Without dead ends: 147 [2018-11-18 16:49:33,077 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-18 16:49:33,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-18 16:49:33,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-11-18 16:49:33,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-18 16:49:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 167 transitions. [2018-11-18 16:49:33,081 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 167 transitions. Word has length 28 [2018-11-18 16:49:33,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:33,081 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 167 transitions. [2018-11-18 16:49:33,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 16:49:33,081 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 167 transitions. [2018-11-18 16:49:33,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 16:49:33,082 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:33,082 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:33,082 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr10REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION]=== [2018-11-18 16:49:33,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:33,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1167161761, now seen corresponding path program 1 times [2018-11-18 16:49:33,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:49:33,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:33,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:33,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:33,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:49:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:33,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:33,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:33,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:49:33,137 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:49:33,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:49:33,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:49:33,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:33,138 INFO L87 Difference]: Start difference. First operand 147 states and 167 transitions. Second operand 3 states. [2018-11-18 16:49:33,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:33,156 INFO L93 Difference]: Finished difference Result 154 states and 171 transitions. [2018-11-18 16:49:33,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:49:33,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 16:49:33,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:33,158 INFO L225 Difference]: With dead ends: 154 [2018-11-18 16:49:33,158 INFO L226 Difference]: Without dead ends: 154 [2018-11-18 16:49:33,158 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:33,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-18 16:49:33,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 143. [2018-11-18 16:49:33,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-18 16:49:33,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 159 transitions. [2018-11-18 16:49:33,162 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 159 transitions. Word has length 34 [2018-11-18 16:49:33,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:33,162 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 159 transitions. [2018-11-18 16:49:33,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:49:33,162 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 159 transitions. [2018-11-18 16:49:33,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 16:49:33,163 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:33,163 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:33,163 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr10REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION]=== [2018-11-18 16:49:33,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:33,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1872730989, now seen corresponding path program 1 times [2018-11-18 16:49:33,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:49:33,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:33,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:33,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:33,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:49:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:33,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:33,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:49:33,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:49:33,380 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-11-18 16:49:33,382 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [13], [16], [19], [23], [26], [31], [121], [122], [125], [127], [128], [131], [132], [135], [141], [142], [145], [148], [151], [175], [176], [177], [178], [180], [181] [2018-11-18 16:49:33,404 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:49:33,404 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:49:33,521 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:49:33,522 INFO L272 AbstractInterpreter]: Visited 31 different actions 31 times. Never merged. Never widened. Performed 262 root evaluator evaluations with a maximum evaluation depth of 3. Performed 262 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 29 variables. [2018-11-18 16:49:33,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:33,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:49:33,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:49:33,526 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:49:33,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:33,533 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:49:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:33,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:49:33,676 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:33,676 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:33,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 16:49:33,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:33,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-18 16:49:33,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:33,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:49:33,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-11-18 16:49:33,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:33,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:49:33,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-18 16:49:33,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:33,895 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:49:33,896 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:49:33,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-18 16:49:33,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:33,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:49:33,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:7 [2018-11-18 16:49:33,943 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:49:33,943 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:49:33,944 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2018-11-18 16:49:33,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:33,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:49:33,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-11-18 16:49:33,970 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:49:33,970 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:49:33,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-11-18 16:49:33,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:33,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:33,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2018-11-18 16:49:33,986 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:34,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:49:34,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2018-11-18 16:49:34,013 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:49:34,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 16:49:34,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 16:49:34,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-11-18 16:49:34,014 INFO L87 Difference]: Start difference. First operand 143 states and 159 transitions. Second operand 17 states. [2018-11-18 16:49:34,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:34,429 INFO L93 Difference]: Finished difference Result 179 states and 190 transitions. [2018-11-18 16:49:34,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 16:49:34,430 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2018-11-18 16:49:34,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:34,431 INFO L225 Difference]: With dead ends: 179 [2018-11-18 16:49:34,431 INFO L226 Difference]: Without dead ends: 179 [2018-11-18 16:49:34,432 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2018-11-18 16:49:34,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-18 16:49:34,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 142. [2018-11-18 16:49:34,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-18 16:49:34,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2018-11-18 16:49:34,437 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 35 [2018-11-18 16:49:34,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:34,437 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2018-11-18 16:49:34,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 16:49:34,438 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2018-11-18 16:49:34,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 16:49:34,438 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:34,438 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:34,439 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr10REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION]=== [2018-11-18 16:49:34,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:34,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1133396195, now seen corresponding path program 1 times [2018-11-18 16:49:34,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:49:34,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:34,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:34,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:34,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:49:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:34,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:49:34,555 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:49:34,555 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-11-18 16:49:34,555 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [13], [16], [19], [23], [26], [29], [35], [39], [44], [121], [122], [125], [126], [128], [131], [132], [135], [141], [142], [145], [148], [151], [175], [176], [177], [178], [180], [181], [182] [2018-11-18 16:49:34,556 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:49:34,557 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:49:34,619 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:49:34,619 INFO L272 AbstractInterpreter]: Visited 35 different actions 49 times. Never merged. Never widened. Performed 414 root evaluator evaluations with a maximum evaluation depth of 3. Performed 414 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 29 variables. [2018-11-18 16:49:34,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:34,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:49:34,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:49:34,625 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:49:34,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:34,631 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:49:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:34,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:49:34,679 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:34,680 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:34,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-18 16:49:34,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:34,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:49:34,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-11-18 16:49:34,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-18 16:49:34,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:34,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:49:34,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:20 [2018-11-18 16:49:34,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:34,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:49:34,866 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:34,866 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 2 variables, input treesize:21, output treesize:1 [2018-11-18 16:49:34,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:34,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:49:34,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 16 [2018-11-18 16:49:34,886 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:49:34,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 16:49:34,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 16:49:34,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-11-18 16:49:34,887 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand 13 states. [2018-11-18 16:49:35,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:35,178 INFO L93 Difference]: Finished difference Result 178 states and 186 transitions. [2018-11-18 16:49:35,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 16:49:35,178 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-11-18 16:49:35,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:35,179 INFO L225 Difference]: With dead ends: 178 [2018-11-18 16:49:35,179 INFO L226 Difference]: Without dead ends: 178 [2018-11-18 16:49:35,179 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-11-18 16:49:35,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-18 16:49:35,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 144. [2018-11-18 16:49:35,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-18 16:49:35,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2018-11-18 16:49:35,182 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 37 [2018-11-18 16:49:35,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:35,182 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2018-11-18 16:49:35,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 16:49:35,183 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2018-11-18 16:49:35,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 16:49:35,183 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:35,183 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:35,184 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr10REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION]=== [2018-11-18 16:49:35,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:35,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1133396194, now seen corresponding path program 1 times [2018-11-18 16:49:35,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:49:35,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:35,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:35,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:35,185 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:49:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:35,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:35,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:49:35,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:49:35,278 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-11-18 16:49:35,279 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [13], [16], [19], [23], [26], [29], [35], [39], [44], [121], [122], [125], [127], [128], [131], [132], [135], [141], [142], [145], [148], [151], [175], [176], [177], [178], [180], [181], [182] [2018-11-18 16:49:35,281 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:49:35,281 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:49:35,337 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:49:35,337 INFO L272 AbstractInterpreter]: Visited 35 different actions 49 times. Never merged. Never widened. Performed 418 root evaluator evaluations with a maximum evaluation depth of 3. Performed 418 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 29 variables. [2018-11-18 16:49:35,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:35,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:49:35,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:49:35,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:49:35,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:35,361 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:49:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:35,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:49:35,444 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:35,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-18 16:49:35,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:35,463 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:35,463 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:35,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-18 16:49:35,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:35,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:49:35,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:30 [2018-11-18 16:49:35,507 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:35,508 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:35,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 30 [2018-11-18 16:49:35,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:35,522 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:35,523 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:35,524 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:35,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 16:49:35,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:35,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 16:49:35,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:33 [2018-11-18 16:49:35,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:35,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:49:35,707 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 40 [2018-11-18 16:49:40,144 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:40,144 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 4 variables, input treesize:42, output treesize:1 [2018-11-18 16:49:40,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:40,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:49:40,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2018-11-18 16:49:40,177 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:49:40,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 16:49:40,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 16:49:40,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=387, Unknown=2, NotChecked=0, Total=462 [2018-11-18 16:49:40,178 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand 15 states. [2018-11-18 16:49:41,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:41,255 INFO L93 Difference]: Finished difference Result 168 states and 176 transitions. [2018-11-18 16:49:41,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 16:49:41,255 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-11-18 16:49:41,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:41,255 INFO L225 Difference]: With dead ends: 168 [2018-11-18 16:49:41,256 INFO L226 Difference]: Without dead ends: 168 [2018-11-18 16:49:41,256 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=104, Invalid=494, Unknown=2, NotChecked=0, Total=600 [2018-11-18 16:49:41,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-18 16:49:41,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 135. [2018-11-18 16:49:41,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-18 16:49:41,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2018-11-18 16:49:41,259 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 37 [2018-11-18 16:49:41,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:41,259 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2018-11-18 16:49:41,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 16:49:41,260 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2018-11-18 16:49:41,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 16:49:41,260 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:41,260 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:41,261 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr10REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION]=== [2018-11-18 16:49:41,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:41,261 INFO L82 PathProgramCache]: Analyzing trace with hash -484015026, now seen corresponding path program 1 times [2018-11-18 16:49:41,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:49:41,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:41,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:41,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:41,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:49:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:41,598 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:41,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:49:41,599 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:49:41,599 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-11-18 16:49:41,599 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [13], [16], [19], [23], [26], [31], [121], [122], [125], [128], [131], [132], [135], [137], [141], [142], [145], [148], [151], [154], [155], [158], [161], [162], [165], [169], [175], [176], [177], [178], [180], [181] [2018-11-18 16:49:41,601 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:49:41,601 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:49:41,642 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:49:41,643 INFO L272 AbstractInterpreter]: Visited 38 different actions 40 times. Merged at 1 different actions 1 times. Never widened. Performed 309 root evaluator evaluations with a maximum evaluation depth of 3. Performed 309 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 33 variables. [2018-11-18 16:49:41,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:41,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:49:41,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:49:41,645 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:49:41,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:41,660 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:49:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:41,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:49:41,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 16:49:41,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:41,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:41,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-11-18 16:49:41,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 16:49:41,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 16:49:41,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:41,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:41,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:49:41,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-11-18 16:49:41,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-11-18 16:49:41,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-18 16:49:41,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:41,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-11-18 16:49:41,898 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 16:49:41,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:49:41,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 16:49:41,962 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:44, output treesize:77 [2018-11-18 16:49:42,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 71 [2018-11-18 16:49:42,041 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:42,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 82 [2018-11-18 16:49:42,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:42,080 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:42,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 60 [2018-11-18 16:49:42,088 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 16:49:42,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:49:42,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2018-11-18 16:49:42,151 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:42,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 16:49:42,152 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:42,158 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:42,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-18 16:49:42,184 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:116, output treesize:141 [2018-11-18 16:49:42,959 WARN L180 SmtUtils]: Spent 741.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-18 16:49:42,968 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 16:49:42,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:42,995 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:42,996 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:42,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-11-18 16:49:42,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:43,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 16:49:43,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:165, output treesize:66 [2018-11-18 16:49:43,089 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:43,090 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:43,091 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:43,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-11-18 16:49:43,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:43,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 16:49:43,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:77, output treesize:85 [2018-11-18 16:49:43,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-11-18 16:49:43,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 16:49:43,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:43,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:43,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 16:49:43,225 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:85 [2018-11-18 16:49:43,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-11-18 16:49:43,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 16:49:43,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:43,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:43,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-18 16:49:43,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:98, output treesize:94 [2018-11-18 16:49:43,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 65 [2018-11-18 16:49:43,344 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:49:43,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2018-11-18 16:49:43,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:43,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 16:49:43,363 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:43,374 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:43,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-18 16:49:43,375 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:43,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:43,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 16:49:43,397 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:103, output treesize:28 [2018-11-18 16:49:43,433 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:43,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:49:49,742 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:49:49,742 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:49:49,745 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:49:49,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 292 [2018-11-18 16:49:49,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:49,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 174 [2018-11-18 16:49:49,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-18 16:49:49,846 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:49,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 122 [2018-11-18 16:49:49,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 66 [2018-11-18 16:49:49,982 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:49:49,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-11-18 16:49:49,982 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:49,992 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:50,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 59 [2018-11-18 16:49:50,030 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:49:50,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 69 [2018-11-18 16:49:50,038 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-18 16:49:50,066 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:49:50,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2018-11-18 16:49:50,067 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:50,091 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 16:49:50,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 52 [2018-11-18 16:49:50,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 20 [2018-11-18 16:49:50,161 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:50,394 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:49:50,394 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_20 term size 38 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-18 16:49:50,397 INFO L168 Benchmark]: Toolchain (without parser) took 20317.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.2 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 315.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:49:50,398 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:49:50,398 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -172.9 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. [2018-11-18 16:49:50,398 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:49:50,399 INFO L168 Benchmark]: Boogie Preprocessor took 26.67 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 16:49:50,399 INFO L168 Benchmark]: RCFGBuilder took 423.81 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: 36.9 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. [2018-11-18 16:49:50,399 INFO L168 Benchmark]: TraceAbstraction took 19496.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -52.9 MB). Peak memory consumption was 302.1 MB. Max. memory is 11.5 GB. [2018-11-18 16:49:50,401 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 344.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -172.9 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.67 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 423.81 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: 36.9 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19496.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -52.9 MB). Peak memory consumption was 302.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_20 term size 38 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_20 term size 38: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-5842f4b [2018-11-18 16:49:51,798 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:49:51,799 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:49:51,807 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:49:51,807 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:49:51,808 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:49:51,809 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:49:51,810 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:49:51,811 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:49:51,812 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:49:51,813 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:49:51,813 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:49:51,814 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:49:51,815 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:49:51,816 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:49:51,817 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:49:51,817 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:49:51,818 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:49:51,820 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:49:51,821 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:49:51,822 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:49:51,823 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:49:51,825 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:49:51,825 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:49:51,825 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:49:51,826 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:49:51,826 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:49:51,827 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:49:51,827 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:49:51,829 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:49:51,829 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:49:51,829 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:49:51,829 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:49:51,829 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:49:51,830 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:49:51,830 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:49:51,831 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-11-18 16:49:51,840 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:49:51,840 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:49:51,841 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:49:51,841 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 16:49:51,841 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 16:49:51,841 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 16:49:51,842 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 16:49:51,842 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 16:49:51,842 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 16:49:51,842 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 16:49:51,842 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:49:51,843 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:49:51,843 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:49:51,843 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:49:51,843 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 16:49:51,843 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:49:51,843 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:49:51,843 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:49:51,844 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-18 16:49:51,844 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-18 16:49:51,844 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-18 16:49:51,845 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:49:51,845 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 16:49:51,846 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 16:49:51,846 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:49:51,846 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:49:51,846 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:49:51,846 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:49:51,846 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:49:51,846 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 16:49:51,846 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:49:51,847 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:49:51,847 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:49:51,847 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-18 16:49:51,847 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:49:51,847 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 16:49:51,847 INFO L133 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan 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 -> Taipan 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 -> 2552da43a16cb54d5090a24426eb170717bf5525 [2018-11-18 16:49:51,879 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:49:51,888 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:49:51,891 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:49:51,892 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:49:51,893 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:49:51,893 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/../../sv-benchmarks/c/memsafety-ext2/length_test03_false-valid-memtrack.i [2018-11-18 16:49:51,940 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/data/0f6dc9a93/f2128f23917740e0b36adc097ec131e4/FLAG121f6ec46 [2018-11-18 16:49:52,369 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:49:52,370 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/sv-benchmarks/c/memsafety-ext2/length_test03_false-valid-memtrack.i [2018-11-18 16:49:52,376 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/data/0f6dc9a93/f2128f23917740e0b36adc097ec131e4/FLAG121f6ec46 [2018-11-18 16:49:52,385 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/data/0f6dc9a93/f2128f23917740e0b36adc097ec131e4 [2018-11-18 16:49:52,387 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:49:52,388 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:49:52,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:49:52,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:49:52,391 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:49:52,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:49:52" (1/1) ... [2018-11-18 16:49:52,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76351e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:52, skipping insertion in model container [2018-11-18 16:49:52,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:49:52" (1/1) ... [2018-11-18 16:49:52,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:49:52,426 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:49:52,634 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:49:52,645 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:49:52,681 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:49:52,760 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:49:52,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:52 WrapperNode [2018-11-18 16:49:52,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:49:52,761 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:49:52,761 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:49:52,761 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:49:52,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:52" (1/1) ... [2018-11-18 16:49:52,776 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:52" (1/1) ... [2018-11-18 16:49:52,781 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:49:52,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:49:52,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:49:52,781 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:49:52,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:52" (1/1) ... [2018-11-18 16:49:52,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:52" (1/1) ... [2018-11-18 16:49:52,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:52" (1/1) ... [2018-11-18 16:49:52,789 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:52" (1/1) ... [2018-11-18 16:49:52,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:52" (1/1) ... [2018-11-18 16:49:52,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:52" (1/1) ... [2018-11-18 16:49:52,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:52" (1/1) ... [2018-11-18 16:49:52,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:49:52,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:49:52,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:49:52,810 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:49:52,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:49:52,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 16:49:52,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 16:49:52,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 16:49:52,846 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 16:49:52,846 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 16:49:52,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 16:49:52,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 16:49:52,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2018-11-18 16:49:52,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 16:49:52,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:49:52,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:49:52,847 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-11-18 16:49:52,847 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-11-18 16:49:53,330 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:49:53,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:49:53 BoogieIcfgContainer [2018-11-18 16:49:53,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:49:53,331 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 16:49:53,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 16:49:53,334 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 16:49:53,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:49:52" (1/3) ... [2018-11-18 16:49:53,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@baa957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:49:53, skipping insertion in model container [2018-11-18 16:49:53,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:52" (2/3) ... [2018-11-18 16:49:53,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@baa957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:49:53, skipping insertion in model container [2018-11-18 16:49:53,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:49:53" (3/3) ... [2018-11-18 16:49:53,336 INFO L112 eAbstractionObserver]: Analyzing ICFG length_test03_false-valid-memtrack.i [2018-11-18 16:49:53,345 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 16:49:53,351 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-11-18 16:49:53,363 INFO L257 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2018-11-18 16:49:53,382 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 16:49:53,383 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 16:49:53,383 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-18 16:49:53,383 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 16:49:53,383 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:49:53,383 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:49:53,384 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 16:49:53,384 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:49:53,384 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 16:49:53,398 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2018-11-18 16:49:53,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 16:49:53,405 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:53,406 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:53,408 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION]=== [2018-11-18 16:49:53,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:53,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1851498446, now seen corresponding path program 1 times [2018-11-18 16:49:53,416 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:49:53,416 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 16:49:53,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:53,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:49:53,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 16:49:53,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:53,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:53,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 16:49:53,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:53,503 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:49:53,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:53,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:49:53,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:49:53,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:49:53,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:53,517 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2018-11-18 16:49:53,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:53,772 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2018-11-18 16:49:53,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:49:53,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-18 16:49:53,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:53,781 INFO L225 Difference]: With dead ends: 160 [2018-11-18 16:49:53,781 INFO L226 Difference]: Without dead ends: 157 [2018-11-18 16:49:53,783 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:53,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-18 16:49:53,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 122. [2018-11-18 16:49:53,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-18 16:49:53,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2018-11-18 16:49:53,818 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 7 [2018-11-18 16:49:53,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:53,818 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2018-11-18 16:49:53,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:49:53,819 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2018-11-18 16:49:53,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 16:49:53,819 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:53,819 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:53,819 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION]=== [2018-11-18 16:49:53,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:53,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1851498445, now seen corresponding path program 1 times [2018-11-18 16:49:53,820 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:49:53,820 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 16:49:53,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:53,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:49:53,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 16:49:53,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:53,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:53,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 16:49:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:53,872 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:49:53,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:53,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:49:53,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:49:53,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:49:53,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:53,874 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand 3 states. [2018-11-18 16:49:54,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:54,069 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2018-11-18 16:49:54,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:49:54,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-18 16:49:54,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:54,071 INFO L225 Difference]: With dead ends: 122 [2018-11-18 16:49:54,071 INFO L226 Difference]: Without dead ends: 122 [2018-11-18 16:49:54,071 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:54,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-18 16:49:54,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-11-18 16:49:54,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-18 16:49:54,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 126 transitions. [2018-11-18 16:49:54,077 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 126 transitions. Word has length 7 [2018-11-18 16:49:54,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:54,077 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 126 transitions. [2018-11-18 16:49:54,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:49:54,077 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2018-11-18 16:49:54,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 16:49:54,078 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:54,078 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:54,078 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION]=== [2018-11-18 16:49:54,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:54,078 INFO L82 PathProgramCache]: Analyzing trace with hash -2020210310, now seen corresponding path program 1 times [2018-11-18 16:49:54,079 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:49:54,079 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 16:49:54,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:54,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:49:54,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 16:49:54,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:54,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:49:54,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-11-18 16:49:54,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:54,162 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:49:54,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:54,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:49:54,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:49:54,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:49:54,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:49:54,165 INFO L87 Difference]: Start difference. First operand 120 states and 126 transitions. Second operand 4 states. [2018-11-18 16:49:54,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:54,376 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2018-11-18 16:49:54,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:49:54,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-18 16:49:54,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:54,378 INFO L225 Difference]: With dead ends: 142 [2018-11-18 16:49:54,378 INFO L226 Difference]: Without dead ends: 142 [2018-11-18 16:49:54,378 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:49:54,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-18 16:49:54,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 123. [2018-11-18 16:49:54,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-18 16:49:54,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-11-18 16:49:54,384 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 10 [2018-11-18 16:49:54,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:54,384 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-11-18 16:49:54,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:49:54,385 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-11-18 16:49:54,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 16:49:54,385 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:54,385 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:54,385 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION]=== [2018-11-18 16:49:54,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:54,386 INFO L82 PathProgramCache]: Analyzing trace with hash -2020210309, now seen corresponding path program 1 times [2018-11-18 16:49:54,386 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:49:54,386 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 16:49:54,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:54,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:49:54,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 16:49:54,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:54,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:54,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 16:49:54,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:54,452 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:49:54,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:54,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:49:54,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:49:54,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:49:54,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:54,454 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 3 states. [2018-11-18 16:49:54,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:54,613 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-11-18 16:49:54,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:49:54,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-18 16:49:54,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:54,614 INFO L225 Difference]: With dead ends: 123 [2018-11-18 16:49:54,614 INFO L226 Difference]: Without dead ends: 123 [2018-11-18 16:49:54,615 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:54,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-18 16:49:54,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-11-18 16:49:54,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-18 16:49:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2018-11-18 16:49:54,621 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 10 [2018-11-18 16:49:54,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:54,621 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2018-11-18 16:49:54,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:49:54,621 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2018-11-18 16:49:54,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 16:49:54,622 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:54,622 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:54,622 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION]=== [2018-11-18 16:49:54,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:54,623 INFO L82 PathProgramCache]: Analyzing trace with hash 878950074, now seen corresponding path program 1 times [2018-11-18 16:49:54,623 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:49:54,623 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 16:49:54,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:54,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:49:54,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 16:49:54,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:54,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:54,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 16:49:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:54,679 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:49:54,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:54,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:49:54,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:49:54,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:49:54,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:54,681 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 3 states. [2018-11-18 16:49:54,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:54,812 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2018-11-18 16:49:54,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:49:54,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-18 16:49:54,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:54,813 INFO L225 Difference]: With dead ends: 116 [2018-11-18 16:49:54,813 INFO L226 Difference]: Without dead ends: 116 [2018-11-18 16:49:54,813 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:54,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-18 16:49:54,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-11-18 16:49:54,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-18 16:49:54,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2018-11-18 16:49:54,817 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 16 [2018-11-18 16:49:54,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:54,817 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2018-11-18 16:49:54,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:49:54,817 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2018-11-18 16:49:54,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 16:49:54,817 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:54,818 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:54,818 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION]=== [2018-11-18 16:49:54,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:54,818 INFO L82 PathProgramCache]: Analyzing trace with hash 878950075, now seen corresponding path program 1 times [2018-11-18 16:49:54,819 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:49:54,819 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 16:49:54,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:54,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:49:54,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 16:49:54,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:54,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:54,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 16:49:54,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:54,883 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:49:54,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:54,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:49:54,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:49:54,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:49:54,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:54,885 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand 3 states. [2018-11-18 16:49:55,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:55,005 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2018-11-18 16:49:55,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:49:55,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-18 16:49:55,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:55,006 INFO L225 Difference]: With dead ends: 111 [2018-11-18 16:49:55,006 INFO L226 Difference]: Without dead ends: 111 [2018-11-18 16:49:55,007 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:49:55,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-18 16:49:55,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-11-18 16:49:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-18 16:49:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2018-11-18 16:49:55,010 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 16 [2018-11-18 16:49:55,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:55,010 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2018-11-18 16:49:55,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:49:55,010 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2018-11-18 16:49:55,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 16:49:55,010 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:55,011 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:55,011 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION]=== [2018-11-18 16:49:55,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:55,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1477648612, now seen corresponding path program 1 times [2018-11-18 16:49:55,011 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:49:55,012 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 16:49:55,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:55,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:49:55,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 16:49:55,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:55,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:55,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 16:49:55,078 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:55,079 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:55,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-18 16:49:55,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:55,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:49:55,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-11-18 16:49:55,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 16:49:55,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:55,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 16:49:55,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:20 [2018-11-18 16:49:55,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:55,149 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:49:55,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:55,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:49:55,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:49:55,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:49:55,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:49:55,151 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 6 states. [2018-11-18 16:49:55,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:55,685 INFO L93 Difference]: Finished difference Result 216 states and 231 transitions. [2018-11-18 16:49:55,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:49:55,686 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-18 16:49:55,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:55,687 INFO L225 Difference]: With dead ends: 216 [2018-11-18 16:49:55,687 INFO L226 Difference]: Without dead ends: 216 [2018-11-18 16:49:55,687 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:49:55,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-11-18 16:49:55,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 136. [2018-11-18 16:49:55,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-18 16:49:55,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 156 transitions. [2018-11-18 16:49:55,700 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 156 transitions. Word has length 17 [2018-11-18 16:49:55,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:55,700 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 156 transitions. [2018-11-18 16:49:55,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:49:55,701 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2018-11-18 16:49:55,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 16:49:55,701 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:55,701 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:55,701 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION]=== [2018-11-18 16:49:55,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:55,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1477648613, now seen corresponding path program 1 times [2018-11-18 16:49:55,702 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:49:55,703 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 16:49:55,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:55,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:49:55,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 16:49:55,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:55,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 16:49:55,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:55,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:55,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-18 16:49:55,836 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:55,838 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:55,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 16:49:55,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:55,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-18 16:49:55,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:55,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:49:55,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-11-18 16:49:55,902 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:55,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 19 treesize of output 28 [2018-11-18 16:49:55,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-11-18 16:49:55,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-18 16:49:55,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:52 [2018-11-18 16:49:55,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:55,989 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:49:55,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:55,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:49:55,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:49:55,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:49:55,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:49:55,995 INFO L87 Difference]: Start difference. First operand 136 states and 156 transitions. Second operand 6 states. [2018-11-18 16:49:56,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:56,458 INFO L93 Difference]: Finished difference Result 162 states and 184 transitions. [2018-11-18 16:49:56,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:49:56,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-18 16:49:56,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:56,459 INFO L225 Difference]: With dead ends: 162 [2018-11-18 16:49:56,459 INFO L226 Difference]: Without dead ends: 162 [2018-11-18 16:49:56,459 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:49:56,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-18 16:49:56,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-11-18 16:49:56,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-18 16:49:56,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 184 transitions. [2018-11-18 16:49:56,463 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 184 transitions. Word has length 17 [2018-11-18 16:49:56,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:56,463 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 184 transitions. [2018-11-18 16:49:56,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:49:56,463 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 184 transitions. [2018-11-18 16:49:56,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 16:49:56,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:56,464 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:56,464 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION]=== [2018-11-18 16:49:56,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:56,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1131832917, now seen corresponding path program 1 times [2018-11-18 16:49:56,465 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:49:56,465 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 16:49:56,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:56,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:49:56,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 16:49:56,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:56,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:56,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 16:49:56,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 16:49:56,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 16:49:56,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:56,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:56,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 16:49:56,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 16:49:56,595 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:56,596 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:56,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:56,603 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-11-18 16:49:56,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-18 16:49:56,623 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:56,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 16:49:56,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:56,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:56,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-18 16:49:56,651 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:56,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 16:49:56,652 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:56,656 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:56,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:56,665 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-11-18 16:49:56,690 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:56,690 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:56,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 16:49:56,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:56,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:56,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:40 [2018-11-18 16:49:56,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-18 16:49:56,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 16:49:56,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:56,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:56,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-18 16:49:56,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 16:49:56,781 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:56,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:56,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:56,802 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2018-11-18 16:49:56,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-18 16:49:56,857 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:56,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 16:49:56,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:56,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:56,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-18 16:49:56,933 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:56,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 16:49:56,934 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:56,950 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:56,974 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-18 16:49:56,974 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:80, output treesize:72 [2018-11-18 16:49:57,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-11-18 16:49:57,111 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:57,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-18 16:49:57,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:57,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-18 16:49:57,125 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:57,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:57,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-11-18 16:49:57,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-18 16:49:57,150 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:57,161 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:57,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-18 16:49:57,161 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:57,164 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:57,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:57,169 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:79, output treesize:7 [2018-11-18 16:49:57,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:57,199 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:49:57,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:57,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 16:49:57,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 16:49:57,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 16:49:57,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-11-18 16:49:57,201 INFO L87 Difference]: Start difference. First operand 160 states and 184 transitions. Second operand 12 states. [2018-11-18 16:50:00,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:50:00,180 INFO L93 Difference]: Finished difference Result 160 states and 183 transitions. [2018-11-18 16:50:00,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 16:50:00,181 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-18 16:50:00,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:50:00,181 INFO L225 Difference]: With dead ends: 160 [2018-11-18 16:50:00,182 INFO L226 Difference]: Without dead ends: 160 [2018-11-18 16:50:00,182 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-11-18 16:50:00,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-18 16:50:00,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-11-18 16:50:00,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-18 16:50:00,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 183 transitions. [2018-11-18 16:50:00,185 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 183 transitions. Word has length 26 [2018-11-18 16:50:00,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:50:00,186 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 183 transitions. [2018-11-18 16:50:00,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 16:50:00,186 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 183 transitions. [2018-11-18 16:50:00,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 16:50:00,186 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:50:00,186 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:50:00,187 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION]=== [2018-11-18 16:50:00,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:00,187 INFO L82 PathProgramCache]: Analyzing trace with hash -868991784, now seen corresponding path program 1 times [2018-11-18 16:50:00,187 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:50:00,187 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 16:50:00,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:50:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:00,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:50:00,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 16:50:00,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:00,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:00,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 16:50:00,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 16:50:00,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 16:50:00,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:00,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:00,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 16:50:00,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 16:50:00,323 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:00,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:00,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:00,333 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-11-18 16:50:00,347 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:00,348 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:00,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 16:50:00,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:00,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:00,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-11-18 16:50:00,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-18 16:50:00,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 16:50:00,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:00,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:00,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-18 16:50:00,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 16:50:00,419 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:00,425 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:00,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:00,436 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-11-18 16:50:00,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-11-18 16:50:00,475 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:00,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 16:50:00,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:00,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:00,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-11-18 16:50:00,523 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:00,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 16:50:00,524 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:00,534 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:00,552 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-18 16:50:00,552 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:58 [2018-11-18 16:50:00,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:50:00,820 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:50:00,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:50:00,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 16:50:00,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 16:50:00,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 16:50:00,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 16:50:00,822 INFO L87 Difference]: Start difference. First operand 160 states and 183 transitions. Second operand 11 states. [2018-11-18 16:50:06,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:50:06,881 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2018-11-18 16:50:06,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 16:50:06,882 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-11-18 16:50:06,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:50:06,883 INFO L225 Difference]: With dead ends: 152 [2018-11-18 16:50:06,883 INFO L226 Difference]: Without dead ends: 152 [2018-11-18 16:50:06,883 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-11-18 16:50:06,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-18 16:50:06,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-11-18 16:50:06,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-18 16:50:06,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 172 transitions. [2018-11-18 16:50:06,886 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 172 transitions. Word has length 28 [2018-11-18 16:50:06,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:50:06,887 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 172 transitions. [2018-11-18 16:50:06,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 16:50:06,887 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 172 transitions. [2018-11-18 16:50:06,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 16:50:06,887 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:50:06,888 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:50:06,888 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION]=== [2018-11-18 16:50:06,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:06,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1429689308, now seen corresponding path program 1 times [2018-11-18 16:50:06,888 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:50:06,888 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 16:50:06,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:50:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:07,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:50:07,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:50:07,044 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:50:07,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:50:07,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:50:07,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:50:07,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:50:07,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:50:07,048 INFO L87 Difference]: Start difference. First operand 152 states and 172 transitions. Second operand 3 states. [2018-11-18 16:50:07,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:50:07,077 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2018-11-18 16:50:07,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:50:07,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 16:50:07,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:50:07,078 INFO L225 Difference]: With dead ends: 159 [2018-11-18 16:50:07,079 INFO L226 Difference]: Without dead ends: 159 [2018-11-18 16:50:07,079 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:50:07,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-18 16:50:07,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 148. [2018-11-18 16:50:07,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-18 16:50:07,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 164 transitions. [2018-11-18 16:50:07,082 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 164 transitions. Word has length 33 [2018-11-18 16:50:07,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:50:07,082 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 164 transitions. [2018-11-18 16:50:07,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:50:07,082 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 164 transitions. [2018-11-18 16:50:07,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 16:50:07,083 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:50:07,083 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:50:07,083 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION]=== [2018-11-18 16:50:07,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:07,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1422073874, now seen corresponding path program 1 times [2018-11-18 16:50:07,084 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:50:07,084 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 16:50:07,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:50:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:07,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:50:07,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 16:50:07,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:07,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:50:07,286 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2018-11-18 16:50:07,542 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:07,543 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:07,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-18 16:50:07,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:07,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-18 16:50:07,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:07,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:50:07,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2018-11-18 16:50:07,603 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:50:07,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:50:08,072 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2018-11-18 16:50:08,074 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:50:08,075 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:50:08,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-11-18 16:50:08,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:08,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-11-18 16:50:08,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:08,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-11-18 16:50:08,140 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:50:08,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-18 16:50:08,192 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:08,196 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:50:08,196 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:50:08,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-11-18 16:50:08,197 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:08,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-11-18 16:50:08,235 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:50:08,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 16:50:08,269 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:130, output treesize:23 [2018-11-18 16:50:08,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2018-11-18 16:50:08,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-18 16:50:08,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-18 16:50:08,772 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:50:08,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2018-11-18 16:50:08,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:233 [2018-11-18 16:50:09,252 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 53 [2018-11-18 16:50:09,257 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:09,257 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 2 variables, input treesize:26, output treesize:1 [2018-11-18 16:50:09,269 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:50:09,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:50:09,271 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:50:09,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:50:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:09,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:50:09,634 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:09,635 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:09,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-18 16:50:09,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:09,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-18 16:50:09,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:09,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:50:09,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2018-11-18 16:50:09,663 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:50:09,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:50:09,912 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:09,912 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 8 variables, input treesize:94, output treesize:1 [2018-11-18 16:50:10,176 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-18 16:50:10,437 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2018-11-18 16:50:10,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2018-11-18 16:50:10,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:50:10,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2018-11-18 16:50:10,567 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:50:10,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 55 [2018-11-18 16:50:10,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-18 16:50:10,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2018-11-18 16:50:10,752 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:50:10,952 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:50:10,953 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:50:10,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2018-11-18 16:50:10,954 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:10,962 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:50:10,963 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:50:10,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2018-11-18 16:50:10,964 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:10,969 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:50:10,969 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:50:10,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-11-18 16:50:10,971 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:11,121 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:50:11,121 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:50:11,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 33 [2018-11-18 16:50:11,122 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:11,290 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:50:11,290 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:50:11,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2018-11-18 16:50:11,291 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:11,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2018-11-18 16:50:11,443 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:160, output treesize:155 [2018-11-18 16:50:11,839 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 30 [2018-11-18 16:50:11,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:50:11,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 16:50:11,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8, 6] total 22 [2018-11-18 16:50:11,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-18 16:50:11,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 16:50:11,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2018-11-18 16:50:11,885 INFO L87 Difference]: Start difference. First operand 148 states and 164 transitions. Second operand 23 states. [2018-11-18 16:50:19,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:50:19,271 INFO L93 Difference]: Finished difference Result 173 states and 183 transitions. [2018-11-18 16:50:19,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 16:50:19,272 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 34 [2018-11-18 16:50:19,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:50:19,273 INFO L225 Difference]: With dead ends: 173 [2018-11-18 16:50:19,273 INFO L226 Difference]: Without dead ends: 173 [2018-11-18 16:50:19,273 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 109 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2018-11-18 16:50:19,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-18 16:50:19,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 142. [2018-11-18 16:50:19,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-18 16:50:19,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2018-11-18 16:50:19,276 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 152 transitions. Word has length 34 [2018-11-18 16:50:19,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:50:19,276 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 152 transitions. [2018-11-18 16:50:19,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-18 16:50:19,277 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2018-11-18 16:50:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 16:50:19,277 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:50:19,277 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:50:19,278 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION]=== [2018-11-18 16:50:19,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:19,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1310690527, now seen corresponding path program 1 times [2018-11-18 16:50:19,278 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:50:19,278 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 16:50:19,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:50:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:19,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:50:19,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 16:50:19,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:19,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:50:19,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-11-18 16:50:20,100 WARN L854 $PredicateComparison]: unable to prove that (exists ((|append_#t~malloc2.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |append_#t~malloc2.base| (_ bv1 1))) (= (select |c_old(#valid)| |append_#t~malloc2.base|) (_ bv0 1)))) is different from true [2018-11-18 16:50:20,107 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:20,124 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:20,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-11-18 16:50:20,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:20,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:50:20,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:16 [2018-11-18 16:50:20,157 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:50:20,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2018-11-18 16:50:20,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:20,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 16:50:20,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:20 [2018-11-18 16:50:20,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-18 16:50:20,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:50:20,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:50:20,262 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:50:20,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:50:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:20,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:50:20,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 16:50:20,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:20,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:20,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 16:50:29,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 16:50:29,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:29,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:50:29,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-11-18 16:50:30,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-18 16:50:30,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:30,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:30,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:11 [2018-11-18 16:50:32,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:50:32,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:50:32,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:50:32,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:50:32,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 16 [2018-11-18 16:50:32,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 16:50:32,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 16:50:32,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=233, Unknown=11, NotChecked=32, Total=342 [2018-11-18 16:50:32,176 INFO L87 Difference]: Start difference. First operand 142 states and 152 transitions. Second operand 17 states. [2018-11-18 16:50:45,556 WARN L180 SmtUtils]: Spent 777.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-18 16:50:47,553 WARN L180 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2018-11-18 16:50:50,130 WARN L180 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2018-11-18 16:50:54,186 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2018-11-18 16:51:01,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:01,083 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2018-11-18 16:51:01,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 16:51:01,083 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-11-18 16:51:01,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:01,084 INFO L225 Difference]: With dead ends: 208 [2018-11-18 16:51:01,084 INFO L226 Difference]: Without dead ends: 208 [2018-11-18 16:51:01,085 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 91 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=154, Invalid=482, Unknown=18, NotChecked=48, Total=702 [2018-11-18 16:51:01,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-11-18 16:51:01,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 144. [2018-11-18 16:51:01,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-18 16:51:01,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2018-11-18 16:51:01,089 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 36 [2018-11-18 16:51:01,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:01,089 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2018-11-18 16:51:01,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 16:51:01,089 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2018-11-18 16:51:01,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 16:51:01,090 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:01,090 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:01,090 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION]=== [2018-11-18 16:51:01,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:01,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1310690526, now seen corresponding path program 1 times [2018-11-18 16:51:01,091 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:51:01,091 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 16:51:01,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:01,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:51:01,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 16:51:01,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:01,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 16:51:01,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:01,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:01,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-18 16:51:02,749 WARN L854 $PredicateComparison]: unable to prove that (exists ((|append_#t~malloc2.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |append_#t~malloc2.base| (_ bv9 32))) (= (select |c_old(#valid)| |append_#t~malloc2.base|) (_ bv0 1)))) is different from true [2018-11-18 16:51:02,759 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:02,761 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:02,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-18 16:51:02,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:02,773 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:02,774 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:02,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 16:51:02,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:02,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:51:02,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-11-18 16:51:02,806 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:02,811 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:02,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 24 [2018-11-18 16:51:02,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-18 16:51:02,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-18 16:51:02,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:38 [2018-11-18 16:51:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-18 16:51:02,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:51:03,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:03,207 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:51:03,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:03,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:51:03,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 16:51:03,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:03,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 16:51:03,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:03,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:03,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-18 16:51:03,271 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:03,272 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:03,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-18 16:51:03,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:03,294 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:03,294 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:03,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-18 16:51:03,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:03,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:51:03,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2018-11-18 16:51:03,306 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:03,311 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:03,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 24 [2018-11-18 16:51:03,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-18 16:51:03,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 16:51:03,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:41 [2018-11-18 16:51:03,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-18 16:51:03,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:51:03,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:51:03,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2018-11-18 16:51:03,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 16:51:03,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 16:51:03,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2018-11-18 16:51:03,774 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand 9 states. [2018-11-18 16:51:07,967 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 34 [2018-11-18 16:51:08,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:08,611 INFO L93 Difference]: Finished difference Result 194 states and 213 transitions. [2018-11-18 16:51:08,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 16:51:08,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-18 16:51:08,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:08,612 INFO L225 Difference]: With dead ends: 194 [2018-11-18 16:51:08,613 INFO L226 Difference]: Without dead ends: 194 [2018-11-18 16:51:08,613 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=48, Invalid=164, Unknown=2, NotChecked=26, Total=240 [2018-11-18 16:51:08,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-18 16:51:08,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 171. [2018-11-18 16:51:08,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-18 16:51:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 188 transitions. [2018-11-18 16:51:08,616 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 188 transitions. Word has length 36 [2018-11-18 16:51:08,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:08,617 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 188 transitions. [2018-11-18 16:51:08,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 16:51:08,617 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 188 transitions. [2018-11-18 16:51:08,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 16:51:08,617 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:08,618 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:08,618 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr28ENSURES_VIOLATIONMEMORY_LEAK, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION]=== [2018-11-18 16:51:08,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:08,618 INFO L82 PathProgramCache]: Analyzing trace with hash 876489160, now seen corresponding path program 1 times [2018-11-18 16:51:08,618 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:51:08,619 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 16:51:08,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:08,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:51:08,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 16:51:08,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:08,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:08,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 16:51:08,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 16:51:08,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:08,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:51:08,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-11-18 16:51:08,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 16:51:08,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 16:51:08,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:08,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:08,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:08,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-11-18 16:51:08,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-11-18 16:51:13,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-11-18 16:51:13,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 16:51:13,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-18 16:51:13,654 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:13,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:51:13,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:51:13,723 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:41, output treesize:76 [2018-11-18 16:51:13,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 68 [2018-11-18 16:51:13,898 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:13,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 79 [2018-11-18 16:51:13,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:13,978 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:17,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 55 [2018-11-18 16:51:17,359 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 16:51:17,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:51:17,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2018-11-18 16:51:17,525 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:17,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 16:51:17,526 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:17,539 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:17,621 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 3 xjuncts. [2018-11-18 16:51:17,621 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:106, output treesize:120 [2018-11-18 16:51:19,733 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 46 [2018-11-18 16:51:19,736 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 16:51:19,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:19,770 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:19,771 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:19,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-11-18 16:51:19,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:19,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:51:19,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:144, output treesize:60 [2018-11-18 16:51:19,920 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:19,922 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:19,924 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:19,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 54 [2018-11-18 16:51:19,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:19,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:51:19,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:72 [2018-11-18 16:51:20,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 72 [2018-11-18 16:51:20,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-18 16:51:20,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:20,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:20,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:51:20,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:87 [2018-11-18 16:51:20,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 79 [2018-11-18 16:51:20,432 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:20,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2018-11-18 16:51:20,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:20,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:20,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-18 16:51:20,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:100, output treesize:96 [2018-11-18 16:51:20,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 60 [2018-11-18 16:51:20,649 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:20,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-18 16:51:20,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:20,678 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:20,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-18 16:51:20,679 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:20,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-11-18 16:51:20,688 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:20,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:20,700 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-18 16:51:20,700 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:98, output treesize:31 [2018-11-18 16:51:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:51:20,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:51:34,034 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-18 16:51:34,209 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-18 16:51:34,317 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-18 16:51:34,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 97 [2018-11-18 16:51:34,775 WARN L180 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2018-11-18 16:51:34,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-18 16:51:34,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:34,859 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:34,860 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:51:34,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 98 [2018-11-18 16:51:35,072 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2018-11-18 16:51:35,275 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:51:35,276 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:51:35,278 INFO L303 Elim1Store]: Index analysis took 204 ms [2018-11-18 16:51:36,793 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 117 [2018-11-18 16:52:02,343 WARN L180 SmtUtils]: Spent 25.54 s on a formula simplification. DAG size of input: 227 DAG size of output: 184 [2018-11-18 16:52:02,426 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:52:02,429 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:02,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 73 treesize of output 82 [2018-11-18 16:52:02,431 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:11,992 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:52:12,009 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:12,010 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:52:12,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 45 [2018-11-18 16:52:12,011 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:30,837 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:52:30,840 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:30,840 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:52:30,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 86 [2018-11-18 16:52:30,842 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:35,139 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:35,140 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:52:35,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2018-11-18 16:52:35,142 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:36,806 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, 7 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:52:36,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2018-11-18 16:52:36,869 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:52:36,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2018-11-18 16:52:36,869 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:36,880 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:36,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-11-18 16:52:36,886 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:52:36,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2018-11-18 16:52:36,887 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:36,898 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:36,920 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:52:36,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:52:36,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:52:36,979 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:172, output treesize:29 [2018-11-18 16:52:39,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:52:39,047 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_307e3b88-f5a6-468f-bb8b-0d1c0cfa3744/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:52:39,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:52:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:52:39,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:52:39,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 16:52:39,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:39,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:39,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 16:52:39,113 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:39,114 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:39,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-18 16:52:39,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:39,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:52:39,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2018-11-18 16:52:39,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 16:52:39,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 16:52:39,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:39,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:39,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:39,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-11-18 16:52:39,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-11-18 16:52:39,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-18 16:52:39,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:41,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-11-18 16:52:41,163 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 16:52:41,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:52:41,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:52:41,242 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:50, output treesize:94 [2018-11-18 16:52:41,497 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2018-11-18 16:52:41,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 77 [2018-11-18 16:52:41,563 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:41,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 88 [2018-11-18 16:52:41,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:41,636 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:42,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 61 [2018-11-18 16:52:42,600 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 16:52:42,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:52:42,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2018-11-18 16:52:42,785 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:42,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 16:52:42,787 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:42,808 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:42,911 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 3 xjuncts. [2018-11-18 16:52:42,911 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:124, output treesize:145 [2018-11-18 16:52:43,146 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 16:52:43,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:43,207 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:43,208 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:43,209 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:43,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-11-18 16:52:43,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:43,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:52:43,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:204, output treesize:64 [2018-11-18 16:52:43,314 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:43,316 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:43,317 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:43,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 54 [2018-11-18 16:52:43,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:43,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:52:43,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:72 [2018-11-18 16:52:43,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 66 [2018-11-18 16:52:43,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 16:52:43,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:43,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:43,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 16:52:43,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:72 [2018-11-18 16:52:43,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 66 [2018-11-18 16:52:43,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 16:52:43,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:43,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:43,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-18 16:52:43,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:81 [2018-11-18 16:52:43,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 51 [2018-11-18 16:52:43,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 16:52:43,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:43,986 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:43,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-18 16:52:43,987 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:43,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-11-18 16:52:43,997 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:44,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:44,011 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-18 16:52:44,011 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:85, output treesize:31 [2018-11-18 16:52:44,020 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:52:44,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:52:55,628 WARN L180 SmtUtils]: Spent 743.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-18 16:52:58,173 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-18 16:52:58,278 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-18 16:52:58,389 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-18 16:52:58,502 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-18 16:52:58,759 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-11-18 16:52:58,769 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:52:58,773 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:58,774 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:52:58,778 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:58,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 196 [2018-11-18 16:52:58,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:58,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 120 [2018-11-18 16:52:59,046 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-11-18 16:52:59,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-18 16:52:59,053 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:59,109 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:52:59,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 93 [2018-11-18 16:52:59,220 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:52:59,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 40 [2018-11-18 16:52:59,438 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:52:59,458 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:59,459 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:52:59,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 55 [2018-11-18 16:52:59,460 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:01,469 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:01,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 36 [2018-11-18 16:53:01,470 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:01,541 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:53:01,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-18 16:53:01,689 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:01,690 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:01,691 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:01,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-11-18 16:53:01,692 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:01,707 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:01,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-18 16:53:01,742 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:01,743 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:01,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-11-18 16:53:01,743 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:01,753 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:01,776 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:53:01,799 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:53:01,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:01,837 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 7 variables, input treesize:138, output treesize:20 [2018-11-18 16:53:11,369 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-11-18 16:53:21,831 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-11-18 16:53:21,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 91 [2018-11-18 16:53:22,277 WARN L180 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-11-18 16:53:22,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-18 16:53:22,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:22,765 INFO L303 Elim1Store]: Index analysis took 301 ms [2018-11-18 16:53:23,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 111 treesize of output 129 [2018-11-18 16:53:26,879 WARN L180 SmtUtils]: Spent 3.80 s on a formula simplification. DAG size of input: 309 DAG size of output: 302 [2018-11-18 16:53:26,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 97 [2018-11-18 16:53:27,233 WARN L180 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2018-11-18 16:53:27,241 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:27,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2018-11-18 16:53:27,242 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:27,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2018-11-18 16:53:27,345 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 16:53:27,423 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 16:53:27,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-11-18 16:53:27,432 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:27,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-11-18 16:53:27,433 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:27,465 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:27,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 107 [2018-11-18 16:53:27,688 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2018-11-18 16:53:27,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 6 [2018-11-18 16:53:27,696 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:27,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2018-11-18 16:53:27,721 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 16:53:27,852 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:27,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2018-11-18 16:53:27,854 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:27,938 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-18 16:53:30,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2018-11-18 16:53:30,879 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:30,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-11-18 16:53:30,880 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:30,915 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:30,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 91 [2018-11-18 16:53:30,941 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:30,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2018-11-18 16:53:30,943 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:31,003 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:33,215 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:34,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 65 [2018-11-18 16:53:34,634 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:34,641 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:34,641 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:34,642 INFO L303 Elim1Store]: Index analysis took 461 ms [2018-11-18 16:53:36,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 91 [2018-11-18 16:53:36,197 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-11-18 16:53:37,633 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:37,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 61 [2018-11-18 16:53:37,634 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:37,743 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 16:53:37,752 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:37,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 71 [2018-11-18 16:53:37,775 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:37,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 62 [2018-11-18 16:53:37,776 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:37,816 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:40,127 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:41,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 104 [2018-11-18 16:53:41,519 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:41,525 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:41,525 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:41,526 INFO L303 Elim1Store]: Index analysis took 368 ms [2018-11-18 16:53:41,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 127 [2018-11-18 16:53:41,985 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-11-18 16:53:43,104 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:43,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 97 [2018-11-18 16:53:43,106 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:43,272 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 16:53:44,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 61 [2018-11-18 16:53:44,696 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:51,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 71 [2018-11-18 16:53:51,082 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-11-18 16:53:51,266 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:51,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2018-11-18 16:53:51,268 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:51,389 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 16:53:54,370 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:54,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 76 [2018-11-18 16:53:54,525 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:54,533 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:56,200 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:53:56,200 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_prenex_95 term size 44 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-18 16:53:56,202 INFO L168 Benchmark]: Toolchain (without parser) took 243815.13 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 277.3 MB). Free memory was 943.8 MB in the beginning and 996.4 MB in the end (delta: -52.6 MB). Peak memory consumption was 372.6 MB. Max. memory is 11.5 GB. [2018-11-18 16:53:56,203 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:53:56,203 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.4 MB). Free memory was 943.8 MB in the beginning and 1.2 GB in the end (delta: -231.4 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. [2018-11-18 16:53:56,203 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2018-11-18 16:53:56,203 INFO L168 Benchmark]: Boogie Preprocessor took 28.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2018-11-18 16:53:56,203 INFO L168 Benchmark]: RCFGBuilder took 520.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 40.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 11.5 GB. [2018-11-18 16:53:56,204 INFO L168 Benchmark]: TraceAbstraction took 242871.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 95.9 MB). Free memory was 1.1 GB in the beginning and 996.4 MB in the end (delta: 125.9 MB). Peak memory consumption was 369.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:53:56,205 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 372.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.4 MB). Free memory was 943.8 MB in the beginning and 1.2 GB in the end (delta: -231.4 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 520.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 40.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 242871.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 95.9 MB). Free memory was 1.1 GB in the beginning and 996.4 MB in the end (delta: 125.9 MB). Peak memory consumption was 369.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_prenex_95 term size 44 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_prenex_95 term size 44: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...