./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/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 e9df23a7e56f2cc55ab4eafe0f0a27c6f539ef31 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/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 e9df23a7e56f2cc55ab4eafe0f0a27c6f539ef31 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 06:01:20,347 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 06:01:20,348 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 06:01:20,354 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 06:01:20,354 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 06:01:20,355 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 06:01:20,355 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 06:01:20,356 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 06:01:20,357 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 06:01:20,358 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 06:01:20,358 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 06:01:20,358 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 06:01:20,359 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 06:01:20,360 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 06:01:20,360 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 06:01:20,361 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 06:01:20,361 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 06:01:20,362 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 06:01:20,364 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 06:01:20,364 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 06:01:20,365 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 06:01:20,366 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 06:01:20,367 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 06:01:20,367 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 06:01:20,367 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 06:01:20,368 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 06:01:20,368 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 06:01:20,369 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 06:01:20,369 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 06:01:20,370 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 06:01:20,370 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 06:01:20,370 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 06:01:20,370 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 06:01:20,371 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 06:01:20,371 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 06:01:20,371 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 06:01:20,372 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-03 06:01:20,379 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 06:01:20,379 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 06:01:20,380 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 06:01:20,380 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 06:01:20,380 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 06:01:20,380 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 06:01:20,381 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 06:01:20,381 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 06:01:20,381 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 06:01:20,381 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 06:01:20,381 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 06:01:20,381 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 06:01:20,381 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 06:01:20,382 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 06:01:20,382 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 06:01:20,382 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 06:01:20,382 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 06:01:20,382 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 06:01:20,383 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 06:01:20,383 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 06:01:20,383 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 06:01:20,383 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-03 06:01:20,383 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-03 06:01:20,383 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-03 06:01:20,383 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 06:01:20,384 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 06:01:20,384 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 06:01:20,384 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 06:01:20,384 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 06:01:20,384 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 06:01:20,384 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 06:01:20,384 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 06:01:20,384 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 06:01:20,385 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 06:01:20,385 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 06:01:20,385 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 06:01:20,385 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_1fccc87d-26bc-4372-a404-9aadb3afc78e/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 -> e9df23a7e56f2cc55ab4eafe0f0a27c6f539ef31 [2018-12-03 06:01:20,402 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 06:01:20,409 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 06:01:20,410 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 06:01:20,411 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 06:01:20,411 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 06:01:20,412 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/../../sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i [2018-12-03 06:01:20,446 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/data/220606f48/ba4ff699b0b248ba9a6b680db6d89036/FLAG8efdbc523 [2018-12-03 06:01:20,857 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 06:01:20,857 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i [2018-12-03 06:01:20,862 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/data/220606f48/ba4ff699b0b248ba9a6b680db6d89036/FLAG8efdbc523 [2018-12-03 06:01:20,871 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/data/220606f48/ba4ff699b0b248ba9a6b680db6d89036 [2018-12-03 06:01:20,873 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 06:01:20,874 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 06:01:20,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 06:01:20,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 06:01:20,878 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 06:01:20,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:01:20" (1/1) ... [2018-12-03 06:01:20,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c3629c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:01:20, skipping insertion in model container [2018-12-03 06:01:20,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:01:20" (1/1) ... [2018-12-03 06:01:20,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 06:01:20,905 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 06:01:21,043 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 06:01:21,048 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 06:01:21,123 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 06:01:21,146 INFO L195 MainTranslator]: Completed translation [2018-12-03 06:01:21,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:01:21 WrapperNode [2018-12-03 06:01:21,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 06:01:21,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 06:01:21,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 06:01:21,147 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 06:01:21,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:01:21" (1/1) ... [2018-12-03 06:01:21,163 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:01:21" (1/1) ... [2018-12-03 06:01:21,168 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 06:01:21,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 06:01:21,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 06:01:21,168 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 06:01:21,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:01:21" (1/1) ... [2018-12-03 06:01:21,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:01:21" (1/1) ... [2018-12-03 06:01:21,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:01:21" (1/1) ... [2018-12-03 06:01:21,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:01:21" (1/1) ... [2018-12-03 06:01:21,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:01:21" (1/1) ... [2018-12-03 06:01:21,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:01:21" (1/1) ... [2018-12-03 06:01:21,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:01:21" (1/1) ... [2018-12-03 06:01:21,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 06:01:21,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 06:01:21,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 06:01:21,189 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 06:01:21,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:01:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/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-12-03 06:01:21,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 06:01:21,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 06:01:21,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 06:01:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 06:01:21,226 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 06:01:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 06:01:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 06:01:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 06:01:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-03 06:01:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 06:01:21,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 06:01:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-12-03 06:01:21,226 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-12-03 06:01:21,478 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 06:01:21,478 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-03 06:01:21,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:01:21 BoogieIcfgContainer [2018-12-03 06:01:21,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 06:01:21,479 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 06:01:21,479 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 06:01:21,481 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 06:01:21,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 06:01:20" (1/3) ... [2018-12-03 06:01:21,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0b2295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:01:21, skipping insertion in model container [2018-12-03 06:01:21,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:01:21" (2/3) ... [2018-12-03 06:01:21,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0b2295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:01:21, skipping insertion in model container [2018-12-03 06:01:21,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:01:21" (3/3) ... [2018-12-03 06:01:21,483 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-memtrack.i [2018-12-03 06:01:21,489 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 06:01:21,494 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-12-03 06:01:21,504 INFO L257 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2018-12-03 06:01:21,520 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 06:01:21,520 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-03 06:01:21,520 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 06:01:21,520 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 06:01:21,520 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 06:01:21,520 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 06:01:21,520 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 06:01:21,521 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 06:01:21,532 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2018-12-03 06:01:21,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 06:01:21,540 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:21,540 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:21,542 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-03 06:01:21,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:21,546 INFO L82 PathProgramCache]: Analyzing trace with hash 250163319, now seen corresponding path program 1 times [2018-12-03 06:01:21,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:01:21,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:21,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:21,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:21,578 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:01:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:21,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:21,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:21,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 06:01:21,622 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:01:21,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-03 06:01:21,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-03 06:01:21,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-03 06:01:21,634 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 2 states. [2018-12-03 06:01:21,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:21,646 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-12-03 06:01:21,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-03 06:01:21,647 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-12-03 06:01:21,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:21,653 INFO L225 Difference]: With dead ends: 85 [2018-12-03 06:01:21,653 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 06:01:21,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-03 06:01:21,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 06:01:21,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 06:01:21,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 06:01:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-12-03 06:01:21,679 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 8 [2018-12-03 06:01:21,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:21,679 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-12-03 06:01:21,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-03 06:01:21,680 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-12-03 06:01:21,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 06:01:21,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:21,680 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:21,680 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-03 06:01:21,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:21,681 INFO L82 PathProgramCache]: Analyzing trace with hash -834775614, now seen corresponding path program 1 times [2018-12-03 06:01:21,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:01:21,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:21,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:21,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:21,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:01:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:21,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:21,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:21,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:01:21,745 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:01:21,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:01:21,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:01:21,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:01:21,746 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 5 states. [2018-12-03 06:01:21,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:21,853 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-12-03 06:01:21,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 06:01:21,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-03 06:01:21,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:21,854 INFO L225 Difference]: With dead ends: 74 [2018-12-03 06:01:21,854 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 06:01:21,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:01:21,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 06:01:21,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 06:01:21,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 06:01:21,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-12-03 06:01:21,859 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 9 [2018-12-03 06:01:21,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:21,859 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-12-03 06:01:21,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:01:21,859 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-12-03 06:01:21,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 06:01:21,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:21,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:21,860 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-03 06:01:21,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:21,860 INFO L82 PathProgramCache]: Analyzing trace with hash -834775613, now seen corresponding path program 1 times [2018-12-03 06:01:21,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:01:21,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:21,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:21,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:21,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:01:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:21,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:21,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:21,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:01:21,912 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:01:21,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:01:21,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:01:21,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:01:21,913 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2018-12-03 06:01:22,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:22,039 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-12-03 06:01:22,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 06:01:22,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-03 06:01:22,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:22,041 INFO L225 Difference]: With dead ends: 90 [2018-12-03 06:01:22,041 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 06:01:22,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:01:22,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 06:01:22,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 79. [2018-12-03 06:01:22,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 06:01:22,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-12-03 06:01:22,045 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 9 [2018-12-03 06:01:22,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:22,045 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-12-03 06:01:22,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:01:22,046 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-12-03 06:01:22,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 06:01:22,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:22,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:22,046 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-03 06:01:22,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:22,046 INFO L82 PathProgramCache]: Analyzing trace with hash -108240204, now seen corresponding path program 1 times [2018-12-03 06:01:22,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:01:22,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:22,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:22,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:22,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:01:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:22,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:22,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 06:01:22,062 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:01:22,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:01:22,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:01:22,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:01:22,062 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 3 states. [2018-12-03 06:01:22,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:22,092 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-12-03 06:01:22,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:01:22,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-03 06:01:22,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:22,093 INFO L225 Difference]: With dead ends: 75 [2018-12-03 06:01:22,093 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 06:01:22,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:01:22,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 06:01:22,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 06:01:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 06:01:22,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-12-03 06:01:22,098 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 10 [2018-12-03 06:01:22,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:22,099 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-12-03 06:01:22,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:01:22,099 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-12-03 06:01:22,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 06:01:22,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:22,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:22,100 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-03 06:01:22,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:22,100 INFO L82 PathProgramCache]: Analyzing trace with hash -108240203, now seen corresponding path program 1 times [2018-12-03 06:01:22,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:01:22,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:22,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:22,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:22,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:01:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:22,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:22,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:22,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 06:01:22,142 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:01:22,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:01:22,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:01:22,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:01:22,143 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 3 states. [2018-12-03 06:01:22,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:22,176 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-12-03 06:01:22,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:01:22,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-03 06:01:22,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:22,177 INFO L225 Difference]: With dead ends: 71 [2018-12-03 06:01:22,177 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 06:01:22,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:01:22,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 06:01:22,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-03 06:01:22,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 06:01:22,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-12-03 06:01:22,180 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 10 [2018-12-03 06:01:22,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:22,180 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-12-03 06:01:22,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:01:22,180 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-12-03 06:01:22,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 06:01:22,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:22,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:22,181 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-03 06:01:22,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:22,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1891124339, now seen corresponding path program 1 times [2018-12-03 06:01:22,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:01:22,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:22,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:22,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:22,182 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:01:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:22,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:22,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:22,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 06:01:22,258 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:01:22,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 06:01:22,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 06:01:22,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:01:22,259 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 8 states. [2018-12-03 06:01:22,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:22,408 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-12-03 06:01:22,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 06:01:22,409 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-03 06:01:22,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:22,409 INFO L225 Difference]: With dead ends: 82 [2018-12-03 06:01:22,409 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 06:01:22,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-12-03 06:01:22,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 06:01:22,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-12-03 06:01:22,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 06:01:22,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2018-12-03 06:01:22,414 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 15 [2018-12-03 06:01:22,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:22,415 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2018-12-03 06:01:22,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 06:01:22,415 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2018-12-03 06:01:22,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 06:01:22,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:22,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:22,416 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-03 06:01:22,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:22,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1504965753, now seen corresponding path program 1 times [2018-12-03 06:01:22,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:01:22,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:22,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:22,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:22,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:01:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:22,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:22,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:22,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:01:22,476 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:01:22,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:01:22,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:01:22,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:01:22,477 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 7 states. [2018-12-03 06:01:22,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:22,542 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-12-03 06:01:22,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 06:01:22,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-12-03 06:01:22,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:22,543 INFO L225 Difference]: With dead ends: 77 [2018-12-03 06:01:22,543 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 06:01:22,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-03 06:01:22,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 06:01:22,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2018-12-03 06:01:22,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 06:01:22,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-12-03 06:01:22,546 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 16 [2018-12-03 06:01:22,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:22,546 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-12-03 06:01:22,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:01:22,546 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-12-03 06:01:22,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 06:01:22,547 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:22,547 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:22,547 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-03 06:01:22,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:22,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1740580681, now seen corresponding path program 1 times [2018-12-03 06:01:22,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:01:22,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:22,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:22,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:22,548 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:01:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:22,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:22,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:22,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:01:22,602 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:01:22,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:01:22,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:01:22,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:01:22,602 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 7 states. [2018-12-03 06:01:22,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:22,698 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-12-03 06:01:22,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:01:22,698 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-12-03 06:01:22,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:22,699 INFO L225 Difference]: With dead ends: 80 [2018-12-03 06:01:22,699 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 06:01:22,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-03 06:01:22,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 06:01:22,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2018-12-03 06:01:22,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 06:01:22,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-12-03 06:01:22,702 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 24 [2018-12-03 06:01:22,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:22,703 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-12-03 06:01:22,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:01:22,703 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-12-03 06:01:22,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 06:01:22,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:22,703 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:22,704 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-03 06:01:22,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:22,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1740580682, now seen corresponding path program 1 times [2018-12-03 06:01:22,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:01:22,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:22,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:22,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:22,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:01:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:22,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:22,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:22,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:01:22,769 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:01:22,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:01:22,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:01:22,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:01:22,770 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 7 states. [2018-12-03 06:01:22,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:22,877 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-12-03 06:01:22,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:01:22,877 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-12-03 06:01:22,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:22,878 INFO L225 Difference]: With dead ends: 82 [2018-12-03 06:01:22,878 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 06:01:22,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-03 06:01:22,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 06:01:22,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2018-12-03 06:01:22,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 06:01:22,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-12-03 06:01:22,881 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 24 [2018-12-03 06:01:22,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:22,882 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-12-03 06:01:22,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:01:22,882 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-12-03 06:01:22,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 06:01:22,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:22,883 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:22,883 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-03 06:01:22,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:22,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1974013919, now seen corresponding path program 1 times [2018-12-03 06:01:22,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:01:22,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:22,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:22,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:22,884 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:01:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:22,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:22,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:22,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:01:22,943 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:01:22,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:01:22,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:01:22,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:01:22,944 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 6 states. [2018-12-03 06:01:23,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:23,024 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-12-03 06:01:23,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:01:23,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-03 06:01:23,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:23,025 INFO L225 Difference]: With dead ends: 66 [2018-12-03 06:01:23,025 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 06:01:23,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:01:23,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 06:01:23,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 06:01:23,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 06:01:23,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-12-03 06:01:23,028 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2018-12-03 06:01:23,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:23,028 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-12-03 06:01:23,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:01:23,028 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-12-03 06:01:23,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 06:01:23,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:23,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:23,029 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-03 06:01:23,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:23,029 INFO L82 PathProgramCache]: Analyzing trace with hash 498905083, now seen corresponding path program 1 times [2018-12-03 06:01:23,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:01:23,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:23,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:23,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:23,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:01:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:23,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:23,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:23,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:01:23,060 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:01:23,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:01:23,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:01:23,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:01:23,060 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 6 states. [2018-12-03 06:01:23,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:23,111 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-12-03 06:01:23,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:01:23,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-12-03 06:01:23,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:23,111 INFO L225 Difference]: With dead ends: 65 [2018-12-03 06:01:23,112 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 06:01:23,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:01:23,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 06:01:23,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 06:01:23,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 06:01:23,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-12-03 06:01:23,114 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 27 [2018-12-03 06:01:23,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:23,114 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-12-03 06:01:23,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:01:23,114 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-12-03 06:01:23,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 06:01:23,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:23,115 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:23,115 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-03 06:01:23,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:23,116 INFO L82 PathProgramCache]: Analyzing trace with hash 861927359, now seen corresponding path program 1 times [2018-12-03 06:01:23,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:01:23,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:23,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:23,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:23,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:01:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:23,206 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:23,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:01:23,206 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 06:01:23,207 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-12-03 06:01:23,208 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [11], [16], [80], [81], [84], [87], [88], [93], [94], [98], [102], [104], [107], [108], [111], [112], [113], [114], [116], [117] [2018-12-03 06:01:23,235 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 06:01:23,235 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 06:01:23,334 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 06:01:23,334 INFO L272 AbstractInterpreter]: Visited 23 different actions 23 times. Never merged. Never widened. Performed 182 root evaluator evaluations with a maximum evaluation depth of 3. Performed 182 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-12-03 06:01:23,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:23,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 06:01:23,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:01:23,340 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/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-12-03 06:01:23,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:23,348 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 06:01:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:23,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:01:23,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 06:01:23,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 06:01:23,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:23,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:23,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:23,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-12-03 06:01:23,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-12-03 06:01:23,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:23,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:23,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-12-03 06:01:23,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-12-03 06:01:23,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-12-03 06:01:23,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:23,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:23,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:23,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-12-03 06:01:23,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-12-03 06:01:23,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-12-03 06:01:23,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:23,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-12-03 06:01:23,613 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:23,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-12-03 06:01:23,623 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:23,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:23,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:23,628 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-12-03 06:01:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:23,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:01:23,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-12-03 06:01:23,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-03 06:01:23,722 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:23,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:23,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-03 06:01:23,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:44 [2018-12-03 06:01:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:23,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 06:01:23,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 18 [2018-12-03 06:01:23,790 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 06:01:23,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 06:01:23,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 06:01:23,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-12-03 06:01:23,791 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 16 states. [2018-12-03 06:01:24,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:24,153 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-12-03 06:01:24,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 06:01:24,154 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2018-12-03 06:01:24,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:24,154 INFO L225 Difference]: With dead ends: 71 [2018-12-03 06:01:24,154 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 06:01:24,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2018-12-03 06:01:24,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 06:01:24,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-12-03 06:01:24,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 06:01:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-12-03 06:01:24,158 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 29 [2018-12-03 06:01:24,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:24,158 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-12-03 06:01:24,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 06:01:24,158 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-12-03 06:01:24,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 06:01:24,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:24,159 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:24,159 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-03 06:01:24,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:24,159 INFO L82 PathProgramCache]: Analyzing trace with hash 861927360, now seen corresponding path program 1 times [2018-12-03 06:01:24,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:01:24,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:24,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:24,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:24,160 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:01:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:24,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:24,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:01:24,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 06:01:24,283 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-12-03 06:01:24,283 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [11], [16], [80], [81], [84], [87], [88], [93], [94], [99], [102], [104], [107], [108], [111], [112], [113], [114], [116], [117] [2018-12-03 06:01:24,284 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 06:01:24,284 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 06:01:24,316 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 06:01:24,316 INFO L272 AbstractInterpreter]: Visited 23 different actions 23 times. Never merged. Never widened. Performed 186 root evaluator evaluations with a maximum evaluation depth of 3. Performed 186 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-12-03 06:01:24,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:24,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 06:01:24,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:01:24,318 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/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-12-03 06:01:24,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:24,323 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 06:01:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:24,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:01:24,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 06:01:24,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 06:01:24,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:24,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:24,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 06:01:24,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 06:01:24,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:24,377 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:24,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:24,381 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-12-03 06:01:24,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:24,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-03 06:01:24,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:24,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:24,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:24,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-03 06:01:24,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:24,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:24,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-12-03 06:01:24,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-12-03 06:01:24,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-12-03 06:01:24,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:24,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:24,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2018-12-03 06:01:24,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-03 06:01:24,527 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:24,542 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:24,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:24,549 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2018-12-03 06:01:24,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2018-12-03 06:01:24,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-12-03 06:01:24,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:24,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:24,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-12-03 06:01:24,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-12-03 06:01:24,606 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:24,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-12-03 06:01:24,616 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:24,621 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:24,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:24,629 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2018-12-03 06:01:24,651 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:24,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:01:24,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-12-03 06:01:24,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-12-03 06:01:24,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:24,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:24,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-12-03 06:01:24,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-12-03 06:01:24,918 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:24,920 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:24,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-12-03 06:01:24,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-12-03 06:01:24,923 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:24,925 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:24,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-12-03 06:01:24,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-03 06:01:24,971 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:24,973 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:24,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-12-03 06:01:24,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-03 06:01:24,976 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:24,981 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:24,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-12-03 06:01:25,000 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:66, output treesize:70 [2018-12-03 06:01:25,101 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 06:01:25,101 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 06:01:25,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-12-03 06:01:25,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:25,115 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 06:01:25,115 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 06:01:25,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-12-03 06:01:25,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:25,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-12-03 06:01:25,128 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:25,139 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 06:01:25,139 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 06:01:25,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-12-03 06:01:25,140 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:25,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-12-03 06:01:25,150 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:25,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-12-03 06:01:25,159 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:25,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 06:01:25,165 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 16 variables, input treesize:106, output treesize:12 [2018-12-03 06:01:25,203 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:25,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 06:01:25,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 25 [2018-12-03 06:01:25,218 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 06:01:25,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 06:01:25,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 06:01:25,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2018-12-03 06:01:25,218 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 17 states. [2018-12-03 06:01:25,479 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2018-12-03 06:01:26,058 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2018-12-03 06:01:26,378 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2018-12-03 06:01:26,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:26,538 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-12-03 06:01:26,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 06:01:26,538 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-12-03 06:01:26,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:26,539 INFO L225 Difference]: With dead ends: 70 [2018-12-03 06:01:26,539 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 06:01:26,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 06:01:26,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 06:01:26,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-12-03 06:01:26,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 06:01:26,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-12-03 06:01:26,542 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 29 [2018-12-03 06:01:26,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:26,542 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-12-03 06:01:26,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 06:01:26,542 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-12-03 06:01:26,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 06:01:26,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:26,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:26,542 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-03 06:01:26,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:26,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1713811542, now seen corresponding path program 1 times [2018-12-03 06:01:26,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:01:26,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:26,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:26,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:26,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:01:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:26,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:26,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:26,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:01:26,591 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:01:26,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:01:26,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:01:26,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:01:26,592 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 7 states. [2018-12-03 06:01:26,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:26,664 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-12-03 06:01:26,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:01:26,664 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-12-03 06:01:26,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:26,665 INFO L225 Difference]: With dead ends: 67 [2018-12-03 06:01:26,665 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 06:01:26,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-03 06:01:26,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 06:01:26,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 06:01:26,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 06:01:26,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-12-03 06:01:26,668 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 28 [2018-12-03 06:01:26,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:26,668 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-12-03 06:01:26,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:01:26,668 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-12-03 06:01:26,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 06:01:26,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:26,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:26,669 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-03 06:01:26,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:26,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1588550178, now seen corresponding path program 1 times [2018-12-03 06:01:26,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:01:26,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:26,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:26,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:26,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:01:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:26,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:26,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:26,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:01:26,721 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:01:26,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 06:01:26,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 06:01:26,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:01:26,721 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 8 states. [2018-12-03 06:01:26,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:26,833 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-12-03 06:01:26,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:01:26,834 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-12-03 06:01:26,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:26,834 INFO L225 Difference]: With dead ends: 66 [2018-12-03 06:01:26,834 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 06:01:26,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-03 06:01:26,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 06:01:26,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 06:01:26,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 06:01:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-12-03 06:01:26,837 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 29 [2018-12-03 06:01:26,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:26,837 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-12-03 06:01:26,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 06:01:26,837 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-12-03 06:01:26,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 06:01:26,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:26,838 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:26,838 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-03 06:01:26,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:26,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1588550177, now seen corresponding path program 1 times [2018-12-03 06:01:26,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:01:26,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:26,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:26,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:26,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:01:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:26,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:26,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:26,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 06:01:26,863 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:01:26,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:01:26,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:01:26,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:01:26,864 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 3 states. [2018-12-03 06:01:26,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:26,899 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-12-03 06:01:26,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:01:26,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-03 06:01:26,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:26,901 INFO L225 Difference]: With dead ends: 61 [2018-12-03 06:01:26,901 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 06:01:26,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:01:26,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 06:01:26,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 06:01:26,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 06:01:26,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-12-03 06:01:26,904 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 29 [2018-12-03 06:01:26,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:26,904 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-12-03 06:01:26,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:01:26,904 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-12-03 06:01:26,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 06:01:26,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:26,905 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:26,906 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-03 06:01:26,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:26,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1699247644, now seen corresponding path program 1 times [2018-12-03 06:01:26,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:01:26,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:26,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:26,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:01:26,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:01:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 06:01:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 06:01:26,955 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 06:01:26,966 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-03 06:01:26,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:01:26 BoogieIcfgContainer [2018-12-03 06:01:26,979 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 06:01:26,979 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 06:01:26,979 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 06:01:26,980 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 06:01:26,980 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:01:21" (3/4) ... [2018-12-03 06:01:26,983 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-03 06:01:26,983 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 06:01:26,983 INFO L168 Benchmark]: Toolchain (without parser) took 6109.46 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 315.6 MB). Free memory was 952.4 MB in the beginning and 980.6 MB in the end (delta: -28.2 MB). Peak memory consumption was 287.4 MB. Max. memory is 11.5 GB. [2018-12-03 06:01:26,984 INFO L168 Benchmark]: CDTParser took 0.13 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-12-03 06:01:26,984 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-03 06:01:26,984 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.30 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-12-03 06:01:26,985 INFO L168 Benchmark]: Boogie Preprocessor took 19.88 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-12-03 06:01:26,985 INFO L168 Benchmark]: RCFGBuilder took 290.31 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: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. [2018-12-03 06:01:26,985 INFO L168 Benchmark]: TraceAbstraction took 5500.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.0 MB). Free memory was 1.1 GB in the beginning and 980.6 MB in the end (delta: 106.6 MB). Peak memory consumption was 278.6 MB. Max. memory is 11.5 GB. [2018-12-03 06:01:26,985 INFO L168 Benchmark]: Witness Printer took 3.36 ms. Allocated memory is still 1.3 GB. Free memory is still 980.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 06:01:26,987 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 271.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.30 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 19.88 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. * RCFGBuilder took 290.31 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: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5500.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.0 MB). Free memory was 1.1 GB in the beginning and 980.6 MB in the end (delta: 106.6 MB). Peak memory consumption was 278.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.36 ms. Allocated memory is still 1.3 GB. Free memory is still 980.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 633]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 633. Possible FailurePath: [L635] struct item *list = ((void *)0); VAL [list={10:0}] [L637] CALL append(&list) VAL [plist={10:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={13:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L627] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={13:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L627] item->next = *plist VAL [\read(**plist)={0:0}, item={13:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L628] EXPR item->next VAL [item={13:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={11:0}, item={13:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L628-L630] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={11:0}, item={13:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L631] *plist = item VAL [item={13:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L637] RET append(&list) VAL [list={10:0}] [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] \read(*list) VAL [\read(*list)={13:0}, list={10:0}] [L639] COND TRUE \read(*list) [L640] EXPR \read(*list) VAL [\read(*list)={13:0}, list={10:0}] [L640] EXPR list->next VAL [\read(*list)={13:0}, list={10:0}, list->next={0:0}] [L640] struct item *next = list->next; [L641] EXPR \read(*list) VAL [\read(*list)={13:0}, list={10:0}, next={0:0}] [L641] free(list) VAL [\read(*list)={13:0}, list={10:0}, next={0:0}] [L641] free(list) [L642] list = next VAL [list={10:0}, next={0:0}] [L644] \read(*list) VAL [\read(*list)={0:0}, list={10:0}, next={0:0}] [L644] COND FALSE !(\read(*list)) [L649] return 0; [L635] struct item *list = ((void *)0); [L649] return 0; VAL [\result=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 85 locations, 39 error locations. UNSAFE Result, 5.4s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 728 SDtfs, 692 SDslu, 1752 SDs, 0 SdLazy, 2164 SolverSat, 109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 241 GetRequests, 101 SyntacticMatches, 12 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 39 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 418 ConstructedInterpolants, 21 QuantifiedInterpolants, 100210 SizeOfPredicates, 47 NumberOfNonLiveVariables, 366 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 12/42 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-03 06:01:28,221 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 06:01:28,222 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 06:01:28,228 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 06:01:28,228 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 06:01:28,228 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 06:01:28,229 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 06:01:28,230 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 06:01:28,230 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 06:01:28,231 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 06:01:28,231 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 06:01:28,231 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 06:01:28,232 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 06:01:28,232 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 06:01:28,233 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 06:01:28,233 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 06:01:28,234 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 06:01:28,234 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 06:01:28,235 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 06:01:28,236 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 06:01:28,236 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 06:01:28,237 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 06:01:28,238 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 06:01:28,238 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 06:01:28,238 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 06:01:28,239 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 06:01:28,239 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 06:01:28,239 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 06:01:28,240 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 06:01:28,240 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 06:01:28,241 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 06:01:28,241 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 06:01:28,241 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 06:01:28,241 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 06:01:28,242 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 06:01:28,242 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 06:01:28,242 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-03 06:01:28,249 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 06:01:28,249 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 06:01:28,250 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 06:01:28,250 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 06:01:28,250 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 06:01:28,250 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 06:01:28,250 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 06:01:28,250 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 06:01:28,250 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 06:01:28,250 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 06:01:28,251 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 06:01:28,251 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 06:01:28,251 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 06:01:28,251 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 06:01:28,251 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 06:01:28,251 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 06:01:28,251 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 06:01:28,251 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 06:01:28,252 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-03 06:01:28,252 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-03 06:01:28,252 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-03 06:01:28,252 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 06:01:28,252 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-03 06:01:28,252 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-03 06:01:28,252 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 06:01:28,252 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-03 06:01:28,252 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 06:01:28,252 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 06:01:28,253 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 06:01:28,253 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 06:01:28,253 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 06:01:28,253 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 06:01:28,253 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 06:01:28,253 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-03 06:01:28,253 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 06:01:28,253 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-03 06:01:28,253 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_1fccc87d-26bc-4372-a404-9aadb3afc78e/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 -> e9df23a7e56f2cc55ab4eafe0f0a27c6f539ef31 [2018-12-03 06:01:28,271 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 06:01:28,278 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 06:01:28,280 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 06:01:28,281 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 06:01:28,281 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 06:01:28,281 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/../../sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i [2018-12-03 06:01:28,319 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/data/e67f65630/e891c5dd777747899a5738aaaf8f6e78/FLAG2e13ea60f [2018-12-03 06:01:28,789 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 06:01:28,790 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i [2018-12-03 06:01:28,796 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/data/e67f65630/e891c5dd777747899a5738aaaf8f6e78/FLAG2e13ea60f [2018-12-03 06:01:28,804 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/data/e67f65630/e891c5dd777747899a5738aaaf8f6e78 [2018-12-03 06:01:28,805 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 06:01:28,806 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 06:01:28,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 06:01:28,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 06:01:28,809 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 06:01:28,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:01:28" (1/1) ... [2018-12-03 06:01:28,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7834880b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:01:28, skipping insertion in model container [2018-12-03 06:01:28,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:01:28" (1/1) ... [2018-12-03 06:01:28,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 06:01:28,839 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 06:01:28,993 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 06:01:28,999 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 06:01:29,031 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 06:01:29,094 INFO L195 MainTranslator]: Completed translation [2018-12-03 06:01:29,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:01:29 WrapperNode [2018-12-03 06:01:29,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 06:01:29,095 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 06:01:29,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 06:01:29,095 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 06:01:29,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:01:29" (1/1) ... [2018-12-03 06:01:29,110 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:01:29" (1/1) ... [2018-12-03 06:01:29,114 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 06:01:29,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 06:01:29,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 06:01:29,115 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 06:01:29,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:01:29" (1/1) ... [2018-12-03 06:01:29,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:01:29" (1/1) ... [2018-12-03 06:01:29,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:01:29" (1/1) ... [2018-12-03 06:01:29,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:01:29" (1/1) ... [2018-12-03 06:01:29,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:01:29" (1/1) ... [2018-12-03 06:01:29,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:01:29" (1/1) ... [2018-12-03 06:01:29,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:01:29" (1/1) ... [2018-12-03 06:01:29,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 06:01:29,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 06:01:29,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 06:01:29,133 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 06:01:29,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:01:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/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-12-03 06:01:29,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 06:01:29,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 06:01:29,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 06:01:29,164 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 06:01:29,164 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 06:01:29,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 06:01:29,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 06:01:29,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 06:01:29,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-03 06:01:29,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 06:01:29,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 06:01:29,165 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-12-03 06:01:29,165 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-12-03 06:01:29,432 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 06:01:29,432 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-03 06:01:29,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:01:29 BoogieIcfgContainer [2018-12-03 06:01:29,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 06:01:29,433 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 06:01:29,433 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 06:01:29,435 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 06:01:29,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 06:01:28" (1/3) ... [2018-12-03 06:01:29,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f346ff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:01:29, skipping insertion in model container [2018-12-03 06:01:29,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:01:29" (2/3) ... [2018-12-03 06:01:29,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f346ff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:01:29, skipping insertion in model container [2018-12-03 06:01:29,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:01:29" (3/3) ... [2018-12-03 06:01:29,437 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-memtrack.i [2018-12-03 06:01:29,442 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 06:01:29,447 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-12-03 06:01:29,456 INFO L257 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2018-12-03 06:01:29,470 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-03 06:01:29,471 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 06:01:29,471 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-03 06:01:29,471 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 06:01:29,471 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 06:01:29,471 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 06:01:29,471 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 06:01:29,471 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 06:01:29,471 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 06:01:29,481 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-12-03 06:01:29,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 06:01:29,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:29,486 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:29,488 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-03 06:01:29,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:29,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1493600360, now seen corresponding path program 1 times [2018-12-03 06:01:29,493 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:01:29,493 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:01:29,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:29,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:01:29,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:29,543 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:01:29,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:29,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 06:01:29,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-03 06:01:29,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-03 06:01:29,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-03 06:01:29,557 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2018-12-03 06:01:29,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:29,568 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-12-03 06:01:29,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-03 06:01:29,569 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-12-03 06:01:29,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:29,575 INFO L225 Difference]: With dead ends: 84 [2018-12-03 06:01:29,575 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 06:01:29,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-03 06:01:29,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 06:01:29,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-03 06:01:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 06:01:29,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2018-12-03 06:01:29,598 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 8 [2018-12-03 06:01:29,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:29,598 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2018-12-03 06:01:29,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-03 06:01:29,599 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2018-12-03 06:01:29,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 06:01:29,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:29,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:29,599 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-03 06:01:29,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:29,600 INFO L82 PathProgramCache]: Analyzing trace with hash 943125184, now seen corresponding path program 1 times [2018-12-03 06:01:29,600 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:01:29,600 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:01:29,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:29,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:01:29,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:01:29,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:29,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:29,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 06:01:29,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:29,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:29,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-03 06:01:29,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:29,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:29,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-12-03 06:01:29,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:29,698 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:01:29,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:29,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:01:29,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:01:29,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:01:29,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:01:29,701 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 5 states. [2018-12-03 06:01:29,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:29,928 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-12-03 06:01:29,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 06:01:29,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-03 06:01:29,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:29,929 INFO L225 Difference]: With dead ends: 73 [2018-12-03 06:01:29,929 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 06:01:29,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:01:29,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 06:01:29,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 06:01:29,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 06:01:29,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-12-03 06:01:29,934 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 9 [2018-12-03 06:01:29,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:29,934 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-12-03 06:01:29,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:01:29,934 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-12-03 06:01:29,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 06:01:29,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:29,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:29,935 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-03 06:01:29,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:29,935 INFO L82 PathProgramCache]: Analyzing trace with hash 943125185, now seen corresponding path program 1 times [2018-12-03 06:01:29,935 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:01:29,935 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:01:29,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:29,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:01:29,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:01:29,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:29,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:01:29,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:29,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:29,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-03 06:01:30,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:30,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:30,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12-03 06:01:30,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:30,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:30,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:30,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-03 06:01:30,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:30,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:30,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2018-12-03 06:01:30,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:30,061 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:01:30,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:30,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:01:30,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:01:30,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:01:30,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:01:30,064 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 5 states. [2018-12-03 06:01:30,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:30,359 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-12-03 06:01:30,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 06:01:30,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-03 06:01:30,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:30,361 INFO L225 Difference]: With dead ends: 89 [2018-12-03 06:01:30,361 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 06:01:30,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:01:30,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 06:01:30,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2018-12-03 06:01:30,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 06:01:30,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2018-12-03 06:01:30,365 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 9 [2018-12-03 06:01:30,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:30,366 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2018-12-03 06:01:30,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:01:30,366 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2018-12-03 06:01:30,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 06:01:30,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:30,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:30,366 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-03 06:01:30,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:30,367 INFO L82 PathProgramCache]: Analyzing trace with hash -827890315, now seen corresponding path program 1 times [2018-12-03 06:01:30,367 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:01:30,367 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:01:30,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:30,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:01:30,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:01:30,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:30,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:30,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 06:01:30,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:30,415 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:01:30,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:30,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 06:01:30,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:01:30,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:01:30,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:01:30,417 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 3 states. [2018-12-03 06:01:30,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:30,488 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-12-03 06:01:30,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:01:30,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-03 06:01:30,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:30,489 INFO L225 Difference]: With dead ends: 74 [2018-12-03 06:01:30,489 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 06:01:30,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:01:30,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 06:01:30,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 06:01:30,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 06:01:30,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-12-03 06:01:30,492 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 10 [2018-12-03 06:01:30,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:30,492 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-12-03 06:01:30,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:01:30,493 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-12-03 06:01:30,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 06:01:30,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:30,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:30,493 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-03 06:01:30,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:30,493 INFO L82 PathProgramCache]: Analyzing trace with hash -827890314, now seen corresponding path program 1 times [2018-12-03 06:01:30,494 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:01:30,494 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:01:30,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:30,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:01:30,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:01:30,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:30,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:30,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-03 06:01:30,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:30,545 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:01:30,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:30,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 06:01:30,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:01:30,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:01:30,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:01:30,547 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 3 states. [2018-12-03 06:01:30,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:30,620 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-12-03 06:01:30,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:01:30,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-03 06:01:30,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:30,622 INFO L225 Difference]: With dead ends: 70 [2018-12-03 06:01:30,622 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 06:01:30,622 INFO L631 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-12-03 06:01:30,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 06:01:30,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 06:01:30,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 06:01:30,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-12-03 06:01:30,625 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 10 [2018-12-03 06:01:30,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:30,625 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-12-03 06:01:30,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:01:30,625 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-12-03 06:01:30,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 06:01:30,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:30,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:30,626 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-03 06:01:30,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:30,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1711716779, now seen corresponding path program 1 times [2018-12-03 06:01:30,627 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:01:30,627 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:01:30,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:30,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:01:30,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-12-03 06:01:30,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-12-03 06:01:30,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:30,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:30,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-12-03 06:01:30,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-12-03 06:01:30,852 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:30,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-03 06:01:30,884 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:30,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:30,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:30,903 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2018-12-03 06:01:30,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-12-03 06:01:30,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-12-03 06:01:30,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:30,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-03 06:01:30,966 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:30,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-12-03 06:01:30,983 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:30,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:31,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-12-03 06:01:31,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-12-03 06:01:31,007 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:31,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-03 06:01:31,023 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:31,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-12-03 06:01:31,035 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:31,039 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:31,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:31,041 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:51, output treesize:7 [2018-12-03 06:01:31,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:31,054 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:01:31,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:31,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 06:01:31,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 06:01:31,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 06:01:31,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=37, Unknown=6, NotChecked=0, Total=56 [2018-12-03 06:01:31,056 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 8 states. [2018-12-03 06:01:31,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:31,550 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2018-12-03 06:01:31,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 06:01:31,551 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-03 06:01:31,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:31,551 INFO L225 Difference]: With dead ends: 78 [2018-12-03 06:01:31,551 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 06:01:31,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=96, Unknown=14, NotChecked=0, Total=156 [2018-12-03 06:01:31,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 06:01:31,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-12-03 06:01:31,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 06:01:31,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-12-03 06:01:31,556 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 15 [2018-12-03 06:01:31,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:31,557 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-12-03 06:01:31,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 06:01:31,557 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-12-03 06:01:31,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 06:01:31,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:31,557 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:31,558 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-03 06:01:31,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:31,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1523890714, now seen corresponding path program 1 times [2018-12-03 06:01:31,558 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:01:31,558 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:01:31,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:31,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:01:31,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:31,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-03 06:01:31,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:31,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:31,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:31,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-03 06:01:31,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:31,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:31,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-12-03 06:01:31,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:31,728 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:01:31,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:31,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:01:31,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:01:31,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:01:31,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:01:31,731 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 7 states. [2018-12-03 06:01:31,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:31,935 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2018-12-03 06:01:31,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:01:31,936 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-12-03 06:01:31,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:31,937 INFO L225 Difference]: With dead ends: 78 [2018-12-03 06:01:31,937 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 06:01:31,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-03 06:01:31,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 06:01:31,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 06:01:31,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 06:01:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2018-12-03 06:01:31,942 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 16 [2018-12-03 06:01:31,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:31,942 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2018-12-03 06:01:31,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:01:31,942 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2018-12-03 06:01:31,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 06:01:31,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:31,942 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:31,943 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-03 06:01:31,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:31,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1744964280, now seen corresponding path program 1 times [2018-12-03 06:01:31,943 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:01:31,943 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:01:31,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:32,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:01:32,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 06:01:32,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:32,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:32,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-03 06:01:32,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 06:01:32,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 06:01:32,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:32,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:32,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:32,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-03 06:01:32,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-03 06:01:32,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-03 06:01:32,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:32,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:32,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:32,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-12-03 06:01:32,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:32,087 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:01:32,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:32,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:01:32,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 06:01:32,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 06:01:32,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:01:32,090 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 8 states. [2018-12-03 06:01:32,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:32,381 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-12-03 06:01:32,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:01:32,382 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-12-03 06:01:32,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:32,382 INFO L225 Difference]: With dead ends: 84 [2018-12-03 06:01:32,382 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 06:01:32,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 06:01:32,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 06:01:32,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2018-12-03 06:01:32,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 06:01:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-12-03 06:01:32,385 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 23 [2018-12-03 06:01:32,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:32,385 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-12-03 06:01:32,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 06:01:32,385 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-12-03 06:01:32,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 06:01:32,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:32,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:32,386 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-03 06:01:32,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:32,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1744964281, now seen corresponding path program 1 times [2018-12-03 06:01:32,386 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:01:32,386 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:01:32,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:32,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:01:32,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 06:01:32,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 06:01:32,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:32,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:32,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 06:01:32,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 06:01:32,503 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:32,505 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:32,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:32,513 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-12-03 06:01:32,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-03 06:01:32,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-03 06:01:32,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:32,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:32,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-03 06:01:32,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-03 06:01:32,561 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:32,562 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:32,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:32,566 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-03 06:01:32,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:32,582 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:01:32,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:32,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:01:32,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 06:01:32,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 06:01:32,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:01:32,585 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 8 states. [2018-12-03 06:01:33,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:33,021 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-12-03 06:01:33,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:01:33,022 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-12-03 06:01:33,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:33,022 INFO L225 Difference]: With dead ends: 86 [2018-12-03 06:01:33,022 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 06:01:33,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 06:01:33,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 06:01:33,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2018-12-03 06:01:33,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 06:01:33,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-12-03 06:01:33,025 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 23 [2018-12-03 06:01:33,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:33,025 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-12-03 06:01:33,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 06:01:33,025 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-12-03 06:01:33,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 06:01:33,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:33,026 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:33,026 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-03 06:01:33,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:33,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1891685230, now seen corresponding path program 1 times [2018-12-03 06:01:33,026 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:01:33,027 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:01:33,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:33,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:01:33,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 06:01:33,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 06:01:33,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:33,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:33,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:33,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-12-03 06:01:33,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-03 06:01:33,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-12-03 06:01:33,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:33,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:33,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:33,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-12-03 06:01:33,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:33,145 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:01:33,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:33,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:01:33,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:01:33,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:01:33,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:01:33,147 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 7 states. [2018-12-03 06:01:33,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:33,369 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-12-03 06:01:33,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:01:33,369 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-12-03 06:01:33,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:33,370 INFO L225 Difference]: With dead ends: 70 [2018-12-03 06:01:33,370 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 06:01:33,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-03 06:01:33,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 06:01:33,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 06:01:33,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 06:01:33,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-12-03 06:01:33,372 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 25 [2018-12-03 06:01:33,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:33,372 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-12-03 06:01:33,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:01:33,372 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-12-03 06:01:33,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 06:01:33,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:33,373 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:33,373 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-03 06:01:33,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:33,373 INFO L82 PathProgramCache]: Analyzing trace with hash -2053284277, now seen corresponding path program 1 times [2018-12-03 06:01:33,373 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:01:33,373 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:01:33,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:33,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:01:33,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 06:01:33,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 06:01:33,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:33,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:33,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:33,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-03 06:01:33,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-03 06:01:33,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-03 06:01:33,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:33,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:33,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:33,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-03 06:01:33,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:33,485 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:01:33,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:33,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:01:33,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:01:33,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:01:33,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:01:33,487 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 7 states. [2018-12-03 06:01:33,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:33,654 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-12-03 06:01:33,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:01:33,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-03 06:01:33,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:33,655 INFO L225 Difference]: With dead ends: 69 [2018-12-03 06:01:33,655 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 06:01:33,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-03 06:01:33,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 06:01:33,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 06:01:33,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 06:01:33,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2018-12-03 06:01:33,657 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 26 [2018-12-03 06:01:33,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:33,657 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2018-12-03 06:01:33,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:01:33,657 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-12-03 06:01:33,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 06:01:33,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:33,657 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:33,657 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-03 06:01:33,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:33,658 INFO L82 PathProgramCache]: Analyzing trace with hash 772696921, now seen corresponding path program 1 times [2018-12-03 06:01:33,658 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:01:33,658 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:01:33,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:33,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:01:33,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 06:01:33,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:33,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:33,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-03 06:01:33,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 06:01:33,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 06:01:33,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:33,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:33,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:33,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-03 06:01:33,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-03 06:01:33,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-03 06:01:33,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:33,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:33,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:33,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-12-03 06:01:33,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:33,805 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:01:33,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:33,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:01:33,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 06:01:33,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 06:01:33,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:01:33,808 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 8 states. [2018-12-03 06:01:34,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:34,104 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-12-03 06:01:34,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:01:34,105 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-12-03 06:01:34,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:34,106 INFO L225 Difference]: With dead ends: 68 [2018-12-03 06:01:34,106 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 06:01:34,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 06:01:34,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 06:01:34,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 06:01:34,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 06:01:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-12-03 06:01:34,109 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 27 [2018-12-03 06:01:34,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:34,110 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-12-03 06:01:34,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 06:01:34,110 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-12-03 06:01:34,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 06:01:34,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:34,111 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:34,111 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-03 06:01:34,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:34,111 INFO L82 PathProgramCache]: Analyzing trace with hash 634278383, now seen corresponding path program 1 times [2018-12-03 06:01:34,111 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:01:34,111 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:01:34,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:34,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:01:34,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 06:01:34,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:34,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:34,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-03 06:01:34,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 06:01:34,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 06:01:34,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:34,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:34,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:34,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-03 06:01:34,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-03 06:01:34,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:34,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:34,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2018-12-03 06:01:34,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-12-03 06:01:34,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-03 06:01:34,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:34,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:34,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:34,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2018-12-03 06:01:34,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-12-03 06:01:34,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-12-03 06:01:34,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:34,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-12-03 06:01:34,442 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:34,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-12-03 06:01:34,465 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:34,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:34,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:34,474 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:13 [2018-12-03 06:01:34,491 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:34,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:01:34,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-12-03 06:01:34,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-12-03 06:01:34,652 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:34,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:34,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-03 06:01:34,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:50 [2018-12-03 06:01:34,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-12-03 06:01:34,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:34,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-12-03 06:01:34,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:34,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 06:01:34,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-12-03 06:01:34,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-12-03 06:01:34,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:34,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-12-03 06:01:34,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:34,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 06:01:34,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2018-12-03 06:01:34,774 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:34,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:01:34,776 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 06:01:34,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:34,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:01:34,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 06:01:34,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 06:01:34,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:34,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:34,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:34,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-03 06:01:34,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:34,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:34,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 35 [2018-12-03 06:01:34,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:34,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:34,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:25 [2018-12-03 06:01:34,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2018-12-03 06:01:34,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-12-03 06:01:34,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:35,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:35,025 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-12-03 06:01:35,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-12-03 06:01:35,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 36 [2018-12-03 06:01:35,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-12-03 06:01:35,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:35,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-12-03 06:01:35,109 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:35,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2018-12-03 06:01:35,128 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:35,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:35,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:35,139 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:43, output treesize:17 [2018-12-03 06:01:35,166 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:35,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:01:35,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-12-03 06:01:35,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-12-03 06:01:35,315 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:35,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:35,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-12-03 06:01:35,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:87 [2018-12-03 06:01:35,468 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:35,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 06:01:35,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 9] total 23 [2018-12-03 06:01:35,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 06:01:35,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 06:01:35,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2018-12-03 06:01:35,484 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 24 states. [2018-12-03 06:01:36,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:36,992 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-12-03 06:01:36,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 06:01:36,993 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2018-12-03 06:01:36,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:36,993 INFO L225 Difference]: With dead ends: 72 [2018-12-03 06:01:36,993 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 06:01:36,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=201, Invalid=855, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 06:01:36,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 06:01:36,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2018-12-03 06:01:36,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 06:01:36,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-12-03 06:01:36,995 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 28 [2018-12-03 06:01:36,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:36,995 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-12-03 06:01:36,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 06:01:36,995 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-12-03 06:01:36,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 06:01:36,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:36,996 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:36,996 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-03 06:01:36,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:36,996 INFO L82 PathProgramCache]: Analyzing trace with hash 634278384, now seen corresponding path program 1 times [2018-12-03 06:01:36,996 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:01:36,996 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:01:37,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:37,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:01:37,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:01:37,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:37,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:01:37,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:37,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:37,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-12-03 06:01:37,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:37,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:37,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-03 06:01:37,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:37,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-03 06:01:37,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:37,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:37,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2018-12-03 06:01:37,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 06:01:37,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 06:01:37,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:37,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:37,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 06:01:37,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 06:01:37,269 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:37,271 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:37,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:37,284 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:43 [2018-12-03 06:01:37,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:37,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 36 [2018-12-03 06:01:37,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:37,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:37,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:37,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-03 06:01:37,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:37,426 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-12-03 06:01:37,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:46 [2018-12-03 06:01:37,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2018-12-03 06:01:37,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-03 06:01:37,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:37,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:37,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-12-03 06:01:37,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-12-03 06:01:37,618 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:37,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-03 06:01:37,654 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:37,664 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:37,676 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-12-03 06:01:37,677 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:62, output treesize:54 [2018-12-03 06:01:37,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-12-03 06:01:37,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-12-03 06:01:37,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:37,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-03 06:01:37,745 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:37,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-12-03 06:01:37,768 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:37,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:37,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2018-12-03 06:01:37,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-12-03 06:01:37,811 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:37,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2018-12-03 06:01:37,842 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:37,857 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:37,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:37,868 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:68, output treesize:22 [2018-12-03 06:01:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:37,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:01:39,106 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-12-03 06:01:39,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-12-03 06:01:39,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-03 06:01:39,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:39,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:39,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-12-03 06:01:39,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-03 06:01:39,125 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:39,128 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:39,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-12-03 06:01:39,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-03 06:01:39,134 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:39,137 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:39,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-12-03 06:01:39,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-12-03 06:01:39,320 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:39,334 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:39,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-12-03 06:01:39,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-12-03 06:01:39,340 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:39,357 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:39,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-12-03 06:01:39,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-03 06:01:39,522 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:39,525 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:39,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-12-03 06:01:39,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-03 06:01:39,534 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:39,537 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:39,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-12-03 06:01:39,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-12-03 06:01:39,667 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:39,678 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:39,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-12-03 06:01:39,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-12-03 06:01:39,684 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:39,695 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:39,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 13 dim-0 vars, and 9 xjuncts. [2018-12-03 06:01:39,842 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 7 variables, input treesize:104, output treesize:132 [2018-12-03 06:01:40,180 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 59 [2018-12-03 06:01:40,186 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 06:01:40,187 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 06:01:40,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-12-03 06:01:40,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:40,255 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 06:01:40,255 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 06:01:40,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-12-03 06:01:40,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:40,327 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 06:01:40,327 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 06:01:40,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-12-03 06:01:40,328 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:40,395 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 06:01:40,396 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 06:01:40,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-03 06:01:40,397 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:40,467 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 06:01:40,468 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 06:01:40,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2018-12-03 06:01:40,469 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:40,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 5 dim-1 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-12-03 06:01:40,539 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 12 variables, input treesize:104, output treesize:47 [2018-12-03 06:01:40,785 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 24 [2018-12-03 06:01:41,000 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:41,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 06:01:41,002 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 06:01:41,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:41,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:01:41,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:01:41,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:41,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:41,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-12-03 06:01:41,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:41,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-03 06:01:41,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:41,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:41,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:41,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-03 06:01:41,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:41,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:41,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2018-12-03 06:01:41,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 06:01:41,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 06:01:41,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:41,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:41,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 06:01:41,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 06:01:41,198 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:41,200 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:41,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:41,212 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:43 [2018-12-03 06:01:41,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:41,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 36 [2018-12-03 06:01:41,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:41,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:41,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:41,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-03 06:01:41,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:41,333 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-12-03 06:01:41,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:43 [2018-12-03 06:01:41,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-12-03 06:01:41,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-12-03 06:01:41,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:41,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:41,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 43 [2018-12-03 06:01:41,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-12-03 06:01:41,607 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:41,660 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:41,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:41,677 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:62, output treesize:54 [2018-12-03 06:01:41,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-12-03 06:01:41,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-12-03 06:01:41,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:41,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-12-03 06:01:41,802 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:41,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:41,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 36 [2018-12-03 06:01:41,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2018-12-03 06:01:41,848 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:41,864 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:41,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:41,871 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:68, output treesize:20 [2018-12-03 06:01:41,912 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:41,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 06:01:42,166 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2018-12-03 06:01:42,755 WARN L180 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-12-03 06:01:42,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-12-03 06:01:42,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-03 06:01:42,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:42,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:42,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-12-03 06:01:42,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-03 06:01:42,772 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:42,775 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:42,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-12-03 06:01:42,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-03 06:01:42,783 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:42,791 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:42,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-12-03 06:01:42,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-03 06:01:42,947 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:42,950 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:42,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-12-03 06:01:42,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-03 06:01:42,955 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:42,958 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:43,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-12-03 06:01:43,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-12-03 06:01:43,082 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:43,092 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:43,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-12-03 06:01:43,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-12-03 06:01:43,098 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:43,109 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:43,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-12-03 06:01:43,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-12-03 06:01:43,229 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:43,240 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:43,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-12-03 06:01:43,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-12-03 06:01:43,246 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:43,257 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:43,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 13 dim-0 vars, and 9 xjuncts. [2018-12-03 06:01:43,403 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 7 variables, input treesize:104, output treesize:132 [2018-12-03 06:01:43,604 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-03 06:01:43,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:43,675 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 06:01:43,676 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 06:01:43,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-12-03 06:01:43,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:43,749 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 06:01:43,750 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 06:01:43,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-12-03 06:01:43,751 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:43,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 06:01:43,812 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:132, output treesize:66 [2018-12-03 06:01:44,172 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 06:01:44,172 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 06:01:44,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-12-03 06:01:44,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:44,232 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 06:01:44,232 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 06:01:44,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-12-03 06:01:44,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:44,284 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 2 xjuncts. [2018-12-03 06:01:44,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:73 [2018-12-03 06:01:44,487 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:44,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 06:01:44,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 11, 11] total 28 [2018-12-03 06:01:44,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 06:01:44,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 06:01:44,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2018-12-03 06:01:44,504 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 29 states. [2018-12-03 06:01:45,659 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 50 [2018-12-03 06:01:46,279 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 49 [2018-12-03 06:01:51,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:51,437 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-12-03 06:01:51,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 06:01:51,438 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-12-03 06:01:51,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:51,439 INFO L225 Difference]: With dead ends: 68 [2018-12-03 06:01:51,439 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 06:01:51,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 75 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 06:01:51,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 06:01:51,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-12-03 06:01:51,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 06:01:51,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-12-03 06:01:51,441 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 28 [2018-12-03 06:01:51,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:51,441 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-12-03 06:01:51,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 06:01:51,441 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-12-03 06:01:51,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 06:01:51,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:51,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:51,442 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-03 06:01:51,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:51,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1816199154, now seen corresponding path program 1 times [2018-12-03 06:01:51,442 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:01:51,442 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:01:51,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:51,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:01:51,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 06:01:51,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:51,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:51,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-03 06:01:51,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-03 06:01:51,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:51,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:51,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2018-12-03 06:01:51,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-03 06:01:51,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 06:01:51,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:51,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:51,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:51,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-12-03 06:01:51,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:51,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:51,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-03 06:01:51,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:51,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:51,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2018-12-03 06:01:51,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-03 06:01:51,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-12-03 06:01:51,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:51,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:51,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 06:01:51,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-12-03 06:01:51,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 06:01:51,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-03 06:01:51,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 06:01:51,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 06:01:51,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-03 06:01:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:51,645 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:01:51,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:51,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 06:01:51,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 06:01:51,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 06:01:51,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 06:01:51,648 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 9 states. [2018-12-03 06:01:56,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:56,014 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-12-03 06:01:56,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 06:01:56,014 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-12-03 06:01:56,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:56,014 INFO L225 Difference]: With dead ends: 81 [2018-12-03 06:01:56,014 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 06:01:56,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-12-03 06:01:56,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 06:01:56,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 65. [2018-12-03 06:01:56,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 06:01:56,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-12-03 06:01:56,016 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 28 [2018-12-03 06:01:56,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:56,016 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-12-03 06:01:56,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 06:01:56,016 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-12-03 06:01:56,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 06:01:56,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:56,016 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:56,017 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-03 06:01:56,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:56,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1816199153, now seen corresponding path program 1 times [2018-12-03 06:01:56,017 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:01:56,017 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:01:56,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:01:56,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 06:01:56,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:01:56,064 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 06:01:56,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:01:56,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 06:01:56,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:01:56,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:01:56,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:01:56,066 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 3 states. [2018-12-03 06:01:56,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:01:56,157 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-12-03 06:01:56,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:01:56,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-03 06:01:56,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:01:56,158 INFO L225 Difference]: With dead ends: 60 [2018-12-03 06:01:56,158 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 06:01:56,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:01:56,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 06:01:56,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 06:01:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 06:01:56,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-12-03 06:01:56,161 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 28 [2018-12-03 06:01:56,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:01:56,161 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-12-03 06:01:56,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:01:56,161 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-12-03 06:01:56,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 06:01:56,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:01:56,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:01:56,162 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr22REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2018-12-03 06:01:56,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:01:56,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1660103724, now seen corresponding path program 1 times [2018-12-03 06:01:56,162 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 06:01:56,163 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fccc87d-26bc-4372-a404-9aadb3afc78e/bin-2019/utaipan/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 06:01:56,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:01:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 06:01:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 06:01:56,437 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 06:01:56,447 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-03 06:01:56,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:01:56 BoogieIcfgContainer [2018-12-03 06:01:56,459 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 06:01:56,459 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 06:01:56,459 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 06:01:56,459 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 06:01:56,459 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:01:29" (3/4) ... [2018-12-03 06:01:56,462 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-03 06:01:56,462 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 06:01:56,462 INFO L168 Benchmark]: Toolchain (without parser) took 27656.53 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 321.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 149.1 MB. Max. memory is 11.5 GB. [2018-12-03 06:01:56,463 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 06:01:56,463 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -201.2 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. [2018-12-03 06:01:56,463 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-03 06:01:56,463 INFO L168 Benchmark]: Boogie Preprocessor took 18.36 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-12-03 06:01:56,463 INFO L168 Benchmark]: RCFGBuilder took 298.99 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: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. [2018-12-03 06:01:56,463 INFO L168 Benchmark]: TraceAbstraction took 27026.06 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -16.0 MB). Peak memory consumption was 158.6 MB. Max. memory is 11.5 GB. [2018-12-03 06:01:56,463 INFO L168 Benchmark]: Witness Printer took 2.91 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 06:01:56,464 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 288.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -201.2 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.36 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. * RCFGBuilder took 298.99 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: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27026.06 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -16.0 MB). Peak memory consumption was 158.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.91 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 633]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 633. Possible FailurePath: [L635] struct item *list = ((void *)0); VAL [list={-2146959039:0}] [L637] CALL append(&list) VAL [plist={-2146959039:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={-2146959040:0}, malloc(sizeof *item)={-2146959040:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L627] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={-2146959040:0}, malloc(sizeof *item)={-2146959040:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L627] item->next = *plist VAL [\read(**plist)={0:0}, item={-2146959040:0}, malloc(sizeof *item)={-2146959040:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L628] EXPR item->next VAL [item={-2146959040:0}, item->next={0:0}, malloc(sizeof *item)={-2146959040:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-2147483648:0}, item={-2146959040:0}, item->next={0:0}, malloc(sizeof *item)={-2147483648:0}, malloc(sizeof *item)={-2146959040:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L628-L630] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-2147483648:0}, item={-2146959040:0}, item->next={0:0}, malloc(sizeof *item)={-2147483648:0}, malloc(sizeof *item)={-2146959040:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L631] *plist = item VAL [item={-2146959040:0}, malloc(sizeof *item)={-2147483648:0}, malloc(sizeof *item)={-2146959040:0}, plist={-2146959039:0}, plist={-2146959039:0}] [L637] RET append(&list) VAL [list={-2146959039:0}] [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] \read(*list) VAL [\read(*list)={-2146959040:0}, list={-2146959039:0}] [L639] COND TRUE \read(*list) [L640] EXPR \read(*list) VAL [\read(*list)={-2146959040:0}, list={-2146959039:0}] [L640] EXPR list->next VAL [\read(*list)={-2146959040:0}, list={-2146959039:0}, list->next={0:0}] [L640] struct item *next = list->next; [L641] EXPR \read(*list) VAL [\read(*list)={-2146959040:0}, list={-2146959039:0}, next={0:0}] [L641] free(list) VAL [\read(*list)={-2146959040:0}, list={-2146959039:0}, next={0:0}] [L641] free(list) [L642] list = next VAL [list={-2146959039:0}, next={0:0}] [L644] \read(*list) VAL [\read(*list)={0:0}, list={-2146959039:0}, next={0:0}] [L644] COND FALSE !(\read(*list)) [L649] return 0; [L635] struct item *list = ((void *)0); [L649] return 0; VAL [\result=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 84 locations, 39 error locations. UNSAFE Result, 26.9s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 15.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 677 SDtfs, 932 SDslu, 1797 SDs, 0 SdLazy, 2596 SolverSat, 147 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 12.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 504 GetRequests, 348 SyntacticMatches, 11 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 52 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 401 NumberOfCodeBlocks, 401 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 459 ConstructedInterpolants, 85 QuantifiedInterpolants, 175059 SizeOfPredicates, 175 NumberOfNonLiveVariables, 1779 ConjunctsInSsa, 255 ConjunctsInUnsatCore, 22 InterpolantComputations, 14 PerfectInterpolantSequences, 16/56 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...