./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_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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-09 16:55:14,786 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 16:55:14,787 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 16:55:14,796 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 16:55:14,796 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 16:55:14,797 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 16:55:14,798 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 16:55:14,799 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 16:55:14,800 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 16:55:14,801 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 16:55:14,802 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 16:55:14,802 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 16:55:14,803 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 16:55:14,803 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 16:55:14,804 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 16:55:14,805 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 16:55:14,806 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 16:55:14,807 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 16:55:14,809 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 16:55:14,810 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 16:55:14,811 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 16:55:14,811 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 16:55:14,813 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 16:55:14,813 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 16:55:14,813 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 16:55:14,814 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 16:55:14,815 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 16:55:14,815 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 16:55:14,816 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 16:55:14,817 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 16:55:14,817 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 16:55:14,817 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 16:55:14,818 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 16:55:14,818 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 16:55:14,818 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 16:55:14,819 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 16:55:14,819 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 16:55:14,830 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 16:55:14,830 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 16:55:14,831 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 16:55:14,831 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 16:55:14,831 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 16:55:14,831 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 16:55:14,831 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 16:55:14,831 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 16:55:14,831 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 16:55:14,831 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 16:55:14,831 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 16:55:14,832 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 16:55:14,832 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 16:55:14,832 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 16:55:14,832 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 16:55:14,832 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 16:55:14,833 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 16:55:14,833 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 16:55:14,833 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 16:55:14,833 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 16:55:14,833 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 16:55:14,833 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 16:55:14,833 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 16:55:14,834 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 16:55:14,834 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 16:55:14,834 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 16:55:14,834 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 16:55:14,834 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 16:55:14,834 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 16:55:14,834 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 16:55:14,834 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 16:55:14,834 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 16:55:14,834 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 16:55:14,835 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 16:55:14,835 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 16:55:14,835 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 16:55:14,835 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_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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-09 16:55:14,858 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 16:55:14,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 16:55:14,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 16:55:14,871 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 16:55:14,871 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 16:55:14,872 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/bin-2019/utaipan/../../sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i [2018-12-09 16:55:14,912 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/bin-2019/utaipan/data/da44eb556/fb22ab7d048642e3b2d0e1ccc53e40ab/FLAGb8b66dbb9 [2018-12-09 16:55:15,264 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 16:55:15,265 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i [2018-12-09 16:55:15,270 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/bin-2019/utaipan/data/da44eb556/fb22ab7d048642e3b2d0e1ccc53e40ab/FLAGb8b66dbb9 [2018-12-09 16:55:15,278 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/bin-2019/utaipan/data/da44eb556/fb22ab7d048642e3b2d0e1ccc53e40ab [2018-12-09 16:55:15,279 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 16:55:15,280 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 16:55:15,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 16:55:15,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 16:55:15,283 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 16:55:15,283 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:55:15" (1/1) ... [2018-12-09 16:55:15,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a6ee20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:15, skipping insertion in model container [2018-12-09 16:55:15,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:55:15" (1/1) ... [2018-12-09 16:55:15,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 16:55:15,306 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 16:55:15,442 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:55:15,447 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 16:55:15,502 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:55:15,523 INFO L195 MainTranslator]: Completed translation [2018-12-09 16:55:15,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:15 WrapperNode [2018-12-09 16:55:15,523 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 16:55:15,523 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 16:55:15,524 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 16:55:15,524 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 16:55:15,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:15" (1/1) ... [2018-12-09 16:55:15,536 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:15" (1/1) ... [2018-12-09 16:55:15,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 16:55:15,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 16:55:15,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 16:55:15,541 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 16:55:15,546 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:15" (1/1) ... [2018-12-09 16:55:15,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:15" (1/1) ... [2018-12-09 16:55:15,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:15" (1/1) ... [2018-12-09 16:55:15,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:15" (1/1) ... [2018-12-09 16:55:15,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:15" (1/1) ... [2018-12-09 16:55:15,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:15" (1/1) ... [2018-12-09 16:55:15,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:15" (1/1) ... [2018-12-09 16:55:15,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 16:55:15,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 16:55:15,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 16:55:15,558 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 16:55:15,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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-09 16:55:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 16:55:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 16:55:15,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 16:55:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 16:55:15,590 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 16:55:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 16:55:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 16:55:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 16:55:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 16:55:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 16:55:15,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 16:55:15,591 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-12-09 16:55:15,591 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-12-09 16:55:15,800 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 16:55:15,800 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 16:55:15,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:55:15 BoogieIcfgContainer [2018-12-09 16:55:15,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 16:55:15,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 16:55:15,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 16:55:15,803 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 16:55:15,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:55:15" (1/3) ... [2018-12-09 16:55:15,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4a6617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:55:15, skipping insertion in model container [2018-12-09 16:55:15,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:15" (2/3) ... [2018-12-09 16:55:15,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4a6617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:55:15, skipping insertion in model container [2018-12-09 16:55:15,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:55:15" (3/3) ... [2018-12-09 16:55:15,804 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-memtrack.i [2018-12-09 16:55:15,810 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 16:55:15,814 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-12-09 16:55:15,823 INFO L257 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2018-12-09 16:55:15,837 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 16:55:15,837 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 16:55:15,837 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 16:55:15,838 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 16:55:15,838 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 16:55:15,838 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 16:55:15,838 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 16:55:15,838 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 16:55:15,847 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2018-12-09 16:55:15,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-09 16:55:15,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:15,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:55:15,854 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-09 16:55:15,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:15,857 INFO L82 PathProgramCache]: Analyzing trace with hash 250163319, now seen corresponding path program 1 times [2018-12-09 16:55:15,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:55:15,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:15,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:15,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:15,886 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:55:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:15,923 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-09 16:55:15,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:15,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 16:55:15,925 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:55:15,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 16:55:15,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 16:55:15,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 16:55:15,937 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 2 states. [2018-12-09 16:55:15,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:15,948 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-12-09 16:55:15,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 16:55:15,948 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-12-09 16:55:15,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:15,954 INFO L225 Difference]: With dead ends: 85 [2018-12-09 16:55:15,954 INFO L226 Difference]: Without dead ends: 82 [2018-12-09 16:55:15,955 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-09 16:55:15,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-09 16:55:15,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-09 16:55:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-09 16:55:15,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-12-09 16:55:15,977 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 8 [2018-12-09 16:55:15,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:15,977 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-12-09 16:55:15,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 16:55:15,978 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-12-09 16:55:15,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 16:55:15,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:15,978 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:55:15,978 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-09 16:55:15,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:15,978 INFO L82 PathProgramCache]: Analyzing trace with hash -834775614, now seen corresponding path program 1 times [2018-12-09 16:55:15,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:55:15,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:15,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:15,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:15,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:55:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:16,039 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-09 16:55:16,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:16,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:55:16,039 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:55:16,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:55:16,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:55:16,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:55:16,041 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 5 states. [2018-12-09 16:55:16,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:16,148 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-12-09 16:55:16,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:55:16,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-09 16:55:16,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:16,149 INFO L225 Difference]: With dead ends: 74 [2018-12-09 16:55:16,149 INFO L226 Difference]: Without dead ends: 74 [2018-12-09 16:55:16,149 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-09 16:55:16,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-09 16:55:16,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-09 16:55:16,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-09 16:55:16,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-12-09 16:55:16,153 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 9 [2018-12-09 16:55:16,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:16,153 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-12-09 16:55:16,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:55:16,153 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-12-09 16:55:16,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 16:55:16,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:16,153 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:55:16,154 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-09 16:55:16,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:16,154 INFO L82 PathProgramCache]: Analyzing trace with hash -834775613, now seen corresponding path program 1 times [2018-12-09 16:55:16,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:55:16,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:16,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:16,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:16,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:55:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:16,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:55:16,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:16,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:55:16,202 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:55:16,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:55:16,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:55:16,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:55:16,202 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2018-12-09 16:55:16,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:16,334 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-12-09 16:55:16,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:55:16,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-09 16:55:16,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:16,337 INFO L225 Difference]: With dead ends: 90 [2018-12-09 16:55:16,337 INFO L226 Difference]: Without dead ends: 90 [2018-12-09 16:55:16,337 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-09 16:55:16,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-09 16:55:16,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 79. [2018-12-09 16:55:16,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-09 16:55:16,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-12-09 16:55:16,342 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 9 [2018-12-09 16:55:16,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:16,342 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-12-09 16:55:16,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:55:16,342 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-12-09 16:55:16,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 16:55:16,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:16,342 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:55:16,343 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-09 16:55:16,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:16,343 INFO L82 PathProgramCache]: Analyzing trace with hash -108240204, now seen corresponding path program 1 times [2018-12-09 16:55:16,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:55:16,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:16,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:16,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:16,344 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:55:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:16,358 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-09 16:55:16,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:16,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 16:55:16,359 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:55:16,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:55:16,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:55:16,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:55:16,359 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 3 states. [2018-12-09 16:55:16,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:16,396 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-12-09 16:55:16,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:55:16,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 16:55:16,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:16,396 INFO L225 Difference]: With dead ends: 75 [2018-12-09 16:55:16,397 INFO L226 Difference]: Without dead ends: 75 [2018-12-09 16:55:16,397 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-09 16:55:16,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-09 16:55:16,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-09 16:55:16,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-09 16:55:16,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-12-09 16:55:16,400 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 10 [2018-12-09 16:55:16,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:16,400 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-12-09 16:55:16,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:55:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-12-09 16:55:16,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 16:55:16,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:16,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:55:16,401 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-09 16:55:16,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:16,401 INFO L82 PathProgramCache]: Analyzing trace with hash -108240203, now seen corresponding path program 1 times [2018-12-09 16:55:16,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:55:16,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:16,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:16,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:16,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:55:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:16,426 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-09 16:55:16,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:16,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 16:55:16,427 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:55:16,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:55:16,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:55:16,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:55:16,427 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 3 states. [2018-12-09 16:55:16,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:16,461 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-12-09 16:55:16,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:55:16,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 16:55:16,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:16,462 INFO L225 Difference]: With dead ends: 71 [2018-12-09 16:55:16,462 INFO L226 Difference]: Without dead ends: 71 [2018-12-09 16:55:16,462 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-09 16:55:16,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-09 16:55:16,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-09 16:55:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-09 16:55:16,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-12-09 16:55:16,465 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 10 [2018-12-09 16:55:16,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:16,465 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-12-09 16:55:16,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:55:16,465 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-12-09 16:55:16,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 16:55:16,466 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:16,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:55:16,466 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-09 16:55:16,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:16,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1891124339, now seen corresponding path program 1 times [2018-12-09 16:55:16,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:55:16,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:16,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:16,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:16,468 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:55:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:16,550 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-09 16:55:16,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:16,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 16:55:16,550 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:55:16,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 16:55:16,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 16:55:16,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 16:55:16,551 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 8 states. [2018-12-09 16:55:16,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:16,695 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-12-09 16:55:16,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 16:55:16,695 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-09 16:55:16,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:16,696 INFO L225 Difference]: With dead ends: 82 [2018-12-09 16:55:16,696 INFO L226 Difference]: Without dead ends: 82 [2018-12-09 16:55:16,696 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-09 16:55:16,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-09 16:55:16,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-12-09 16:55:16,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-09 16:55:16,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2018-12-09 16:55:16,700 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 15 [2018-12-09 16:55:16,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:16,701 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2018-12-09 16:55:16,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 16:55:16,701 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2018-12-09 16:55:16,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 16:55:16,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:16,701 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:55:16,701 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-09 16:55:16,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:16,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1504965753, now seen corresponding path program 1 times [2018-12-09 16:55:16,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:55:16,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:16,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:16,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:16,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:55:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:16,754 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-09 16:55:16,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:16,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 16:55:16,755 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:55:16,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 16:55:16,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 16:55:16,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:55:16,755 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 7 states. [2018-12-09 16:55:16,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:16,824 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-12-09 16:55:16,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:55:16,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-12-09 16:55:16,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:16,825 INFO L225 Difference]: With dead ends: 77 [2018-12-09 16:55:16,825 INFO L226 Difference]: Without dead ends: 77 [2018-12-09 16:55:16,826 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-09 16:55:16,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-09 16:55:16,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2018-12-09 16:55:16,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-09 16:55:16,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-12-09 16:55:16,828 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 16 [2018-12-09 16:55:16,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:16,829 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-12-09 16:55:16,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 16:55:16,829 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-12-09 16:55:16,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 16:55:16,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:16,829 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-09 16:55:16,829 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-09 16:55:16,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:16,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1740580681, now seen corresponding path program 1 times [2018-12-09 16:55:16,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:55:16,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:16,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:16,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:16,830 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:55:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:16,881 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-09 16:55:16,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:16,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 16:55:16,881 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:55:16,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 16:55:16,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 16:55:16,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:55:16,882 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 7 states. [2018-12-09 16:55:16,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:16,975 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-12-09 16:55:16,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 16:55:16,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-12-09 16:55:16,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:16,976 INFO L225 Difference]: With dead ends: 80 [2018-12-09 16:55:16,976 INFO L226 Difference]: Without dead ends: 80 [2018-12-09 16:55:16,976 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-09 16:55:16,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-09 16:55:16,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2018-12-09 16:55:16,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-09 16:55:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-12-09 16:55:16,978 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 24 [2018-12-09 16:55:16,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:16,979 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-12-09 16:55:16,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 16:55:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-12-09 16:55:16,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 16:55:16,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:16,980 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-09 16:55:16,980 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-09 16:55:16,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:16,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1740580682, now seen corresponding path program 1 times [2018-12-09 16:55:16,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:55:16,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:16,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:16,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:16,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:55:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:17,041 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-09 16:55:17,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:17,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 16:55:17,041 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:55:17,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 16:55:17,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 16:55:17,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:55:17,042 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 7 states. [2018-12-09 16:55:17,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:17,147 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-12-09 16:55:17,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 16:55:17,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-12-09 16:55:17,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:17,148 INFO L225 Difference]: With dead ends: 82 [2018-12-09 16:55:17,148 INFO L226 Difference]: Without dead ends: 82 [2018-12-09 16:55:17,148 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-09 16:55:17,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-09 16:55:17,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2018-12-09 16:55:17,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-09 16:55:17,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-12-09 16:55:17,151 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 24 [2018-12-09 16:55:17,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:17,151 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-12-09 16:55:17,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 16:55:17,151 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-12-09 16:55:17,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 16:55:17,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:17,152 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-09 16:55:17,152 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-09 16:55:17,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:17,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1974013919, now seen corresponding path program 1 times [2018-12-09 16:55:17,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:55:17,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:17,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:17,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:17,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:55:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:17,187 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-09 16:55:17,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:17,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 16:55:17,187 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:55:17,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 16:55:17,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 16:55:17,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:55:17,188 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 6 states. [2018-12-09 16:55:17,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:17,253 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-12-09 16:55:17,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 16:55:17,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-09 16:55:17,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:17,254 INFO L225 Difference]: With dead ends: 66 [2018-12-09 16:55:17,261 INFO L226 Difference]: Without dead ends: 66 [2018-12-09 16:55:17,262 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-09 16:55:17,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-09 16:55:17,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-09 16:55:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-09 16:55:17,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-12-09 16:55:17,264 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2018-12-09 16:55:17,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:17,265 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-12-09 16:55:17,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 16:55:17,265 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-12-09 16:55:17,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 16:55:17,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:17,265 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-09 16:55:17,266 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-09 16:55:17,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:17,267 INFO L82 PathProgramCache]: Analyzing trace with hash 498905083, now seen corresponding path program 1 times [2018-12-09 16:55:17,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:55:17,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:17,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:17,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:17,268 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:55:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:17,314 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-09 16:55:17,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:17,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:55:17,315 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:55:17,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 16:55:17,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 16:55:17,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:55:17,316 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 6 states. [2018-12-09 16:55:17,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:17,374 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-12-09 16:55:17,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 16:55:17,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-12-09 16:55:17,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:17,375 INFO L225 Difference]: With dead ends: 65 [2018-12-09 16:55:17,375 INFO L226 Difference]: Without dead ends: 65 [2018-12-09 16:55:17,375 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-09 16:55:17,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-09 16:55:17,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-09 16:55:17,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-09 16:55:17,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-12-09 16:55:17,377 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 27 [2018-12-09 16:55:17,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:17,377 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-12-09 16:55:17,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 16:55:17,377 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-12-09 16:55:17,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 16:55:17,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:17,378 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-09 16:55:17,378 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-09 16:55:17,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:17,379 INFO L82 PathProgramCache]: Analyzing trace with hash 861927359, now seen corresponding path program 1 times [2018-12-09 16:55:17,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:55:17,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:17,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:17,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:17,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:55:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:17,459 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-09 16:55:17,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:55:17,460 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:55:17,460 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-12-09 16:55:17,462 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-09 16:55:17,483 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:55:17,483 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:55:17,578 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:55:17,579 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-09 16:55:17,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:17,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:55:17,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:55:17,587 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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-09 16:55:17,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:17,593 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:55:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:17,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:55:17,680 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-09 16:55:17,683 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-09 16:55:17,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:17,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:17,690 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-09 16:55:17,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-12-09 16:55:17,720 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-09 16:55:17,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:17,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:17,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-12-09 16:55:17,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-09 16:55:17,783 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-09 16:55:17,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:17,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:17,801 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-09 16:55:17,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-12-09 16:55:17,829 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-09 16:55:17,831 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-09 16:55:17,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:17,843 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-09 16:55:17,843 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:17,851 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-09 16:55:17,851 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:17,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:17,858 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-09 16:55:17,859 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-12-09 16:55:17,869 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-09 16:55:17,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:55:17,939 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-09 16:55:17,940 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-09 16:55:17,941 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-09 16:55:17,942 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-09 16:55:17,950 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-09 16:55:17,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:44 [2018-12-09 16:55:17,988 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-09 16:55:18,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:55:18,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 18 [2018-12-09 16:55:18,003 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:55:18,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 16:55:18,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 16:55:18,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-12-09 16:55:18,004 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 16 states. [2018-12-09 16:55:18,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:18,349 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-12-09 16:55:18,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 16:55:18,349 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2018-12-09 16:55:18,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:18,350 INFO L225 Difference]: With dead ends: 71 [2018-12-09 16:55:18,350 INFO L226 Difference]: Without dead ends: 71 [2018-12-09 16:55:18,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2018-12-09 16:55:18,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-09 16:55:18,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-12-09 16:55:18,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-09 16:55:18,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-12-09 16:55:18,352 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 29 [2018-12-09 16:55:18,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:18,352 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-12-09 16:55:18,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 16:55:18,352 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-12-09 16:55:18,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 16:55:18,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:18,352 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-09 16:55:18,352 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-09 16:55:18,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:18,353 INFO L82 PathProgramCache]: Analyzing trace with hash 861927360, now seen corresponding path program 1 times [2018-12-09 16:55:18,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:55:18,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:18,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:18,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:18,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:55:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:18,455 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-09 16:55:18,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:55:18,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:55:18,455 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-12-09 16:55:18,455 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-09 16:55:18,456 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:55:18,456 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:55:18,483 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:55:18,483 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-09 16:55:18,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:18,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:55:18,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:55:18,484 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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-09 16:55:18,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:18,490 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:55:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:18,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:55:18,529 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-09 16:55:18,530 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-09 16:55:18,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:18,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:18,540 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-09 16:55:18,542 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-09 16:55:18,542 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:18,543 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:18,547 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-09 16:55:18,548 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-12-09 16:55:18,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:18,584 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-09 16:55:18,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:18,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:18,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:18,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 15 treesize of output 8 [2018-12-09 16:55:18,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:18,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:18,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-12-09 16:55:18,649 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-09 16:55:18,651 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-09 16:55:18,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:18,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:18,679 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-09 16:55:18,681 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-09 16:55:18,682 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:18,696 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:18,703 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-09 16:55:18,703 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2018-12-09 16:55:18,733 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-09 16:55:18,737 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-09 16:55:18,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:18,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:18,757 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-09 16:55:18,759 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-09 16:55:18,759 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:18,782 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-09 16:55:18,782 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:18,787 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:18,792 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-09 16:55:18,793 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2018-12-09 16:55:18,815 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-09 16:55:18,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:55:19,115 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-09 16:55:19,117 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-09 16:55:19,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:19,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:19,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, 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-09 16:55:19,123 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-09 16:55:19,123 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:19,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:19,127 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-09 16:55:19,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 16 treesize of output 14 [2018-12-09 16:55:19,128 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:19,131 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:19,182 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-09 16:55:19,184 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-09 16:55:19,184 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:19,187 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:19,188 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-09 16:55:19,190 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-09 16:55:19,190 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:19,193 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:19,215 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-09 16:55:19,215 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:66, output treesize:70 [2018-12-09 16:55:19,322 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:55:19,323 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:55:19,323 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-09 16:55:19,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:19,336 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:55:19,336 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:55:19,337 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-09 16:55:19,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:19,348 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-09 16:55:19,349 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:19,359 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:55:19,360 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:55:19,360 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-09 16:55:19,360 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:19,370 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-09 16:55:19,371 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:19,381 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-09 16:55:19,381 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:19,390 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-09 16:55:19,390 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 16 variables, input treesize:106, output treesize:12 [2018-12-09 16:55:19,428 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-09 16:55:19,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:55:19,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 25 [2018-12-09 16:55:19,443 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:55:19,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 16:55:19,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 16:55:19,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2018-12-09 16:55:19,444 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 17 states. [2018-12-09 16:55:20,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:20,287 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-12-09 16:55:20,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 16:55:20,287 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-12-09 16:55:20,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:20,287 INFO L225 Difference]: With dead ends: 70 [2018-12-09 16:55:20,287 INFO L226 Difference]: Without dead ends: 70 [2018-12-09 16:55:20,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2018-12-09 16:55:20,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-09 16:55:20,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-12-09 16:55:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 16:55:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-12-09 16:55:20,289 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 29 [2018-12-09 16:55:20,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:20,290 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-12-09 16:55:20,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 16:55:20,290 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-12-09 16:55:20,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 16:55:20,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:20,290 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-09 16:55:20,290 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-09 16:55:20,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:20,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1713811542, now seen corresponding path program 1 times [2018-12-09 16:55:20,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:55:20,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:20,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:20,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:20,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:55:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:55:20,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:20,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 16:55:20,323 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:55:20,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 16:55:20,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 16:55:20,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:55:20,324 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 7 states. [2018-12-09 16:55:20,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:20,407 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-12-09 16:55:20,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 16:55:20,408 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-12-09 16:55:20,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:20,409 INFO L225 Difference]: With dead ends: 67 [2018-12-09 16:55:20,409 INFO L226 Difference]: Without dead ends: 67 [2018-12-09 16:55:20,409 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-09 16:55:20,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-09 16:55:20,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-09 16:55:20,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-09 16:55:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-12-09 16:55:20,411 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 28 [2018-12-09 16:55:20,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:20,412 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-12-09 16:55:20,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 16:55:20,412 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-12-09 16:55:20,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 16:55:20,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:20,412 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-09 16:55:20,413 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-09 16:55:20,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:20,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1588550178, now seen corresponding path program 1 times [2018-12-09 16:55:20,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:55:20,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:20,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:20,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:20,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:55:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:20,473 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-09 16:55:20,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:20,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 16:55:20,474 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:55:20,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 16:55:20,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 16:55:20,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 16:55:20,474 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 8 states. [2018-12-09 16:55:20,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:20,579 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-12-09 16:55:20,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 16:55:20,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-12-09 16:55:20,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:20,580 INFO L225 Difference]: With dead ends: 66 [2018-12-09 16:55:20,580 INFO L226 Difference]: Without dead ends: 66 [2018-12-09 16:55:20,580 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-09 16:55:20,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-09 16:55:20,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-09 16:55:20,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-09 16:55:20,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-12-09 16:55:20,582 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 29 [2018-12-09 16:55:20,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:20,583 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-12-09 16:55:20,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 16:55:20,583 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-12-09 16:55:20,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 16:55:20,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:20,583 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-09 16:55:20,584 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-09 16:55:20,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:20,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1588550177, now seen corresponding path program 1 times [2018-12-09 16:55:20,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:55:20,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:20,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:20,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:20,585 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:55:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:55:20,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:20,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 16:55:20,606 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:55:20,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:55:20,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:55:20,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:55:20,607 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 3 states. [2018-12-09 16:55:20,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:20,635 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-12-09 16:55:20,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:55:20,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 16:55:20,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:20,636 INFO L225 Difference]: With dead ends: 61 [2018-12-09 16:55:20,636 INFO L226 Difference]: Without dead ends: 61 [2018-12-09 16:55:20,636 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-09 16:55:20,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-09 16:55:20,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-09 16:55:20,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 16:55:20,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-12-09 16:55:20,639 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 29 [2018-12-09 16:55:20,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:20,639 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-12-09 16:55:20,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:55:20,639 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-12-09 16:55:20,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 16:55:20,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:20,640 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-09 16:55:20,640 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr15REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION]=== [2018-12-09 16:55:20,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:20,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1699247644, now seen corresponding path program 1 times [2018-12-09 16:55:20,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:55:20,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:20,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:20,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:55:20,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:55:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 16:55:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 16:55:20,674 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 16:55:20,684 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-09 16:55:20,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:55:20 BoogieIcfgContainer [2018-12-09 16:55:20,696 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 16:55:20,697 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 16:55:20,697 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 16:55:20,697 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 16:55:20,697 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:55:15" (3/4) ... [2018-12-09 16:55:20,700 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 16:55:20,700 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 16:55:20,701 INFO L168 Benchmark]: Toolchain (without parser) took 5420.78 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 316.7 MB). Free memory was 952.4 MB in the beginning and 995.5 MB in the end (delta: -43.1 MB). Peak memory consumption was 273.6 MB. Max. memory is 11.5 GB. [2018-12-09 16:55:20,701 INFO L168 Benchmark]: CDTParser took 0.18 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-09 16:55:20,702 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -168.0 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2018-12-09 16:55:20,702 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.43 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-09 16:55:20,702 INFO L168 Benchmark]: Boogie Preprocessor took 17.03 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-09 16:55:20,702 INFO L168 Benchmark]: RCFGBuilder took 242.15 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: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. [2018-12-09 16:55:20,703 INFO L168 Benchmark]: TraceAbstraction took 4895.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 995.5 MB in the end (delta: 92.6 MB). Peak memory consumption was 272.9 MB. Max. memory is 11.5 GB. [2018-12-09 16:55:20,703 INFO L168 Benchmark]: Witness Printer took 3.31 ms. Allocated memory is still 1.3 GB. Free memory is still 995.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:55:20,705 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.18 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 242.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -168.0 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.43 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 17.03 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 242.15 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: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4895.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 995.5 MB in the end (delta: 92.6 MB). Peak memory consumption was 272.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.31 ms. Allocated memory is still 1.3 GB. Free memory is still 995.5 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, 4.8s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 2.3s 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.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 241 GetRequests, 101 SyntacticMatches, 12 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1.7s 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-09 16:55:21,961 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 16:55:21,962 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 16:55:21,968 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 16:55:21,968 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 16:55:21,969 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 16:55:21,969 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 16:55:21,970 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 16:55:21,971 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 16:55:21,971 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 16:55:21,972 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 16:55:21,972 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 16:55:21,972 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 16:55:21,973 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 16:55:21,973 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 16:55:21,973 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 16:55:21,974 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 16:55:21,975 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 16:55:21,975 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 16:55:21,976 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 16:55:21,977 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 16:55:21,977 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 16:55:21,978 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 16:55:21,979 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 16:55:21,979 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 16:55:21,979 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 16:55:21,980 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 16:55:21,980 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 16:55:21,980 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 16:55:21,981 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 16:55:21,981 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 16:55:21,981 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 16:55:21,981 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 16:55:21,982 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 16:55:21,982 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 16:55:21,982 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 16:55:21,983 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-09 16:55:21,990 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 16:55:21,990 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 16:55:21,990 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 16:55:21,991 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 16:55:21,991 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 16:55:21,991 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 16:55:21,991 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 16:55:21,991 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 16:55:21,991 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 16:55:21,991 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 16:55:21,991 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 16:55:21,992 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 16:55:21,992 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 16:55:21,992 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 16:55:21,992 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 16:55:21,992 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 16:55:21,992 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 16:55:21,992 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 16:55:21,992 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 16:55:21,992 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 16:55:21,992 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 16:55:21,992 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 16:55:21,993 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 16:55:21,993 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 16:55:21,993 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 16:55:21,993 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 16:55:21,993 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 16:55:21,993 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 16:55:21,993 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 16:55:21,993 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 16:55:21,993 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 16:55:21,993 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 16:55:21,994 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 16:55:21,994 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 16:55:21,994 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 16:55:21,994 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 16:55:21,994 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_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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-09 16:55:22,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 16:55:22,018 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 16:55:22,020 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 16:55:22,021 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 16:55:22,022 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 16:55:22,022 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/bin-2019/utaipan/../../sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i [2018-12-09 16:55:22,058 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/bin-2019/utaipan/data/fd49c9ec8/3622ee68e37e42e9810657c727133e88/FLAG4b0c2f787 [2018-12-09 16:55:22,419 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 16:55:22,419 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/sv-benchmarks/c/memsafety/test-0232_false-valid-memtrack.i [2018-12-09 16:55:22,425 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/bin-2019/utaipan/data/fd49c9ec8/3622ee68e37e42e9810657c727133e88/FLAG4b0c2f787 [2018-12-09 16:55:22,800 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/bin-2019/utaipan/data/fd49c9ec8/3622ee68e37e42e9810657c727133e88 [2018-12-09 16:55:22,805 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 16:55:22,806 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 16:55:22,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 16:55:22,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 16:55:22,812 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 16:55:22,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:55:22" (1/1) ... [2018-12-09 16:55:22,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a048df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:22, skipping insertion in model container [2018-12-09 16:55:22,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:55:22" (1/1) ... [2018-12-09 16:55:22,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 16:55:22,837 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 16:55:22,985 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:55:22,991 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 16:55:23,018 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:55:23,074 INFO L195 MainTranslator]: Completed translation [2018-12-09 16:55:23,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:23 WrapperNode [2018-12-09 16:55:23,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 16:55:23,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 16:55:23,075 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 16:55:23,075 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 16:55:23,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:23" (1/1) ... [2018-12-09 16:55:23,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:23" (1/1) ... [2018-12-09 16:55:23,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 16:55:23,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 16:55:23,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 16:55:23,094 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 16:55:23,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:23" (1/1) ... [2018-12-09 16:55:23,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:23" (1/1) ... [2018-12-09 16:55:23,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:23" (1/1) ... [2018-12-09 16:55:23,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:23" (1/1) ... [2018-12-09 16:55:23,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:23" (1/1) ... [2018-12-09 16:55:23,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:23" (1/1) ... [2018-12-09 16:55:23,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:23" (1/1) ... [2018-12-09 16:55:23,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 16:55:23,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 16:55:23,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 16:55:23,112 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 16:55:23,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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-09 16:55:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 16:55:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 16:55:23,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 16:55:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 16:55:23,143 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 16:55:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 16:55:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 16:55:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 16:55:23,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 16:55:23,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 16:55:23,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 16:55:23,144 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-12-09 16:55:23,144 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-12-09 16:55:23,424 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 16:55:23,424 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 16:55:23,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:55:23 BoogieIcfgContainer [2018-12-09 16:55:23,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 16:55:23,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 16:55:23,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 16:55:23,427 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 16:55:23,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:55:22" (1/3) ... [2018-12-09 16:55:23,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1efb6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:55:23, skipping insertion in model container [2018-12-09 16:55:23,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:55:23" (2/3) ... [2018-12-09 16:55:23,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1efb6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:55:23, skipping insertion in model container [2018-12-09 16:55:23,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:55:23" (3/3) ... [2018-12-09 16:55:23,429 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-memtrack.i [2018-12-09 16:55:23,435 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 16:55:23,439 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-12-09 16:55:23,449 INFO L257 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2018-12-09 16:55:23,464 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 16:55:23,465 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 16:55:23,465 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 16:55:23,465 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 16:55:23,465 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 16:55:23,465 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 16:55:23,465 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 16:55:23,465 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 16:55:23,465 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 16:55:23,475 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-12-09 16:55:23,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-09 16:55:23,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:23,481 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:55:23,482 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-12-09 16:55:23,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:23,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1493600360, now seen corresponding path program 1 times [2018-12-09 16:55:23,487 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:55:23,488 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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-09 16:55:23,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:23,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:55:23,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:55:23,542 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:55:23,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:23,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 16:55:23,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 16:55:23,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 16:55:23,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 16:55:23,557 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2018-12-09 16:55:23,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:23,569 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-12-09 16:55:23,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 16:55:23,570 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-12-09 16:55:23,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:23,578 INFO L225 Difference]: With dead ends: 84 [2018-12-09 16:55:23,578 INFO L226 Difference]: Without dead ends: 81 [2018-12-09 16:55:23,579 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-09 16:55:23,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-09 16:55:23,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-09 16:55:23,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-09 16:55:23,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2018-12-09 16:55:23,607 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 8 [2018-12-09 16:55:23,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:23,608 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2018-12-09 16:55:23,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 16:55:23,608 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2018-12-09 16:55:23,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 16:55:23,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:23,608 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:55:23,608 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-12-09 16:55:23,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:23,609 INFO L82 PathProgramCache]: Analyzing trace with hash 943125184, now seen corresponding path program 1 times [2018-12-09 16:55:23,609 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:55:23,609 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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-09 16:55:23,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:23,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:55:23,663 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-09 16:55:23,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:23,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:23,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 16:55:23,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:23,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:23,691 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-09 16:55:23,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:23,704 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-09 16:55:23,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-12-09 16:55:23,717 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-09 16:55:23,717 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:55:23,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:23,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:55:23,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:55:23,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:55:23,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:55:23,719 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 5 states. [2018-12-09 16:55:23,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:23,958 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-12-09 16:55:23,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:55:23,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-09 16:55:23,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:23,960 INFO L225 Difference]: With dead ends: 73 [2018-12-09 16:55:23,960 INFO L226 Difference]: Without dead ends: 73 [2018-12-09 16:55:23,960 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-09 16:55:23,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-09 16:55:23,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-09 16:55:23,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-09 16:55:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-12-09 16:55:23,966 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 9 [2018-12-09 16:55:23,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:23,966 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-12-09 16:55:23,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:55:23,966 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-12-09 16:55:23,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 16:55:23,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:23,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:55:23,967 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-12-09 16:55:23,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:23,967 INFO L82 PathProgramCache]: Analyzing trace with hash 943125185, now seen corresponding path program 1 times [2018-12-09 16:55:23,968 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:55:23,968 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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-09 16:55:23,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:24,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:55:24,012 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-09 16:55:24,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:24,020 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-09 16:55:24,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:24,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:24,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:55:24,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:24,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:24,055 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-09 16:55:24,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:24,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:24,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:24,074 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-09 16:55:24,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:24,081 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-09 16:55:24,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2018-12-09 16:55:24,093 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-09 16:55:24,093 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:55:24,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:24,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:55:24,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:55:24,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:55:24,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:55:24,095 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 5 states. [2018-12-09 16:55:24,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:24,380 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-12-09 16:55:24,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:55:24,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-09 16:55:24,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:24,382 INFO L225 Difference]: With dead ends: 89 [2018-12-09 16:55:24,382 INFO L226 Difference]: Without dead ends: 89 [2018-12-09 16:55:24,382 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-09 16:55:24,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-09 16:55:24,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2018-12-09 16:55:24,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-09 16:55:24,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2018-12-09 16:55:24,387 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 9 [2018-12-09 16:55:24,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:24,387 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2018-12-09 16:55:24,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:55:24,387 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2018-12-09 16:55:24,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 16:55:24,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:24,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:55:24,388 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-12-09 16:55:24,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:24,388 INFO L82 PathProgramCache]: Analyzing trace with hash -827890315, now seen corresponding path program 1 times [2018-12-09 16:55:24,388 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:55:24,388 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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-09 16:55:24,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:24,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:55:24,432 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-09 16:55:24,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:24,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:24,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 16:55:24,439 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-09 16:55:24,439 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:55:24,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:24,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 16:55:24,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:55:24,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:55:24,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:55:24,441 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 3 states. [2018-12-09 16:55:24,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:24,519 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-12-09 16:55:24,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:55:24,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 16:55:24,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:24,520 INFO L225 Difference]: With dead ends: 74 [2018-12-09 16:55:24,520 INFO L226 Difference]: Without dead ends: 74 [2018-12-09 16:55:24,520 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-09 16:55:24,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-09 16:55:24,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-09 16:55:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-09 16:55:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-12-09 16:55:24,523 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 10 [2018-12-09 16:55:24,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:24,523 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-12-09 16:55:24,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:55:24,523 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-12-09 16:55:24,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 16:55:24,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:24,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:55:24,524 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-12-09 16:55:24,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:24,524 INFO L82 PathProgramCache]: Analyzing trace with hash -827890314, now seen corresponding path program 1 times [2018-12-09 16:55:24,524 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:55:24,525 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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-09 16:55:24,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:24,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:55:24,570 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-09 16:55:24,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:24,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:24,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 16:55:24,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-09 16:55:24,582 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:55:24,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:24,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 16:55:24,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:55:24,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:55:24,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:55:24,584 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 3 states. [2018-12-09 16:55:24,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:24,668 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-12-09 16:55:24,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:55:24,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 16:55:24,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:24,669 INFO L225 Difference]: With dead ends: 70 [2018-12-09 16:55:24,669 INFO L226 Difference]: Without dead ends: 70 [2018-12-09 16:55:24,670 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-09 16:55:24,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-09 16:55:24,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-09 16:55:24,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-09 16:55:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-12-09 16:55:24,672 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 10 [2018-12-09 16:55:24,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:24,672 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-12-09 16:55:24,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:55:24,672 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-12-09 16:55:24,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 16:55:24,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:24,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:55:24,673 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-12-09 16:55:24,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:24,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1711716779, now seen corresponding path program 1 times [2018-12-09 16:55:24,673 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:55:24,674 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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-09 16:55:24,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:24,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:55:24,817 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-09 16:55:24,821 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-09 16:55:24,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:24,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:24,902 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-09 16:55:24,907 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-09 16:55:24,908 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:24,935 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-09 16:55:24,935 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:24,946 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:24,955 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-09 16:55:24,955 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2018-12-09 16:55:24,988 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-09 16:55:24,992 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-09 16:55:24,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:25,008 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-09 16:55:25,008 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:25,023 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-09 16:55:25,023 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:25,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:25,045 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-09 16:55:25,048 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-09 16:55:25,048 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:25,064 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-09 16:55:25,064 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:25,077 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-09 16:55:25,077 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:25,080 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:25,083 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-09 16:55:25,083 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:51, output treesize:7 [2018-12-09 16:55:25,096 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-09 16:55:25,096 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:55:25,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:25,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 16:55:25,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 16:55:25,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 16:55:25,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=37, Unknown=6, NotChecked=0, Total=56 [2018-12-09 16:55:25,097 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 8 states. [2018-12-09 16:55:25,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:25,605 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2018-12-09 16:55:25,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 16:55:25,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-09 16:55:25,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:25,606 INFO L225 Difference]: With dead ends: 78 [2018-12-09 16:55:25,606 INFO L226 Difference]: Without dead ends: 78 [2018-12-09 16:55:25,607 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-09 16:55:25,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-09 16:55:25,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-12-09 16:55:25,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-09 16:55:25,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-12-09 16:55:25,612 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 15 [2018-12-09 16:55:25,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:25,613 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-12-09 16:55:25,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 16:55:25,613 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-12-09 16:55:25,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 16:55:25,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:25,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:55:25,613 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-12-09 16:55:25,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:25,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1523890714, now seen corresponding path program 1 times [2018-12-09 16:55:25,614 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:55:25,614 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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-09 16:55:25,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:25,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:55:25,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:25,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:55:25,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:25,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:25,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:25,737 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-09 16:55:25,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:25,757 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-09 16:55:25,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-12-09 16:55:25,780 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-09 16:55:25,780 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:55:25,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:25,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 16:55:25,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 16:55:25,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 16:55:25,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:55:25,783 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 7 states. [2018-12-09 16:55:25,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:25,957 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2018-12-09 16:55:25,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 16:55:25,957 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-12-09 16:55:25,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:25,958 INFO L225 Difference]: With dead ends: 78 [2018-12-09 16:55:25,958 INFO L226 Difference]: Without dead ends: 78 [2018-12-09 16:55:25,958 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-09 16:55:25,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-09 16:55:25,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-09 16:55:25,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-09 16:55:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2018-12-09 16:55:25,962 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 16 [2018-12-09 16:55:25,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:25,963 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2018-12-09 16:55:25,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 16:55:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2018-12-09 16:55:25,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 16:55:25,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:25,963 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-09 16:55:25,963 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-12-09 16:55:25,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:25,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1744964280, now seen corresponding path program 1 times [2018-12-09 16:55:25,964 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:55:25,964 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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-09 16:55:25,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:26,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:55:26,038 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-09 16:55:26,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:26,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:26,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-09 16:55:26,054 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-09 16:55:26,056 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-09 16:55:26,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:26,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:26,061 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-09 16:55:26,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-09 16:55:26,080 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-09 16:55:26,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-09 16:55:26,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:26,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:26,083 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-09 16:55:26,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-12-09 16:55:26,094 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-09 16:55:26,094 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:55:26,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:26,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 16:55:26,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 16:55:26,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 16:55:26,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 16:55:26,096 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 8 states. [2018-12-09 16:55:26,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:26,367 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-12-09 16:55:26,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 16:55:26,367 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-12-09 16:55:26,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:26,368 INFO L225 Difference]: With dead ends: 84 [2018-12-09 16:55:26,368 INFO L226 Difference]: Without dead ends: 84 [2018-12-09 16:55:26,368 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-09 16:55:26,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-09 16:55:26,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2018-12-09 16:55:26,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-09 16:55:26,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-12-09 16:55:26,372 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 23 [2018-12-09 16:55:26,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:26,372 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-12-09 16:55:26,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 16:55:26,372 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-12-09 16:55:26,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 16:55:26,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:26,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] [2018-12-09 16:55:26,373 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-12-09 16:55:26,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:26,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1744964281, now seen corresponding path program 1 times [2018-12-09 16:55:26,374 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:55:26,374 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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-09 16:55:26,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:26,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:55:26,472 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-09 16:55:26,474 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-09 16:55:26,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:26,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:26,488 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-09 16:55:26,490 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-09 16:55:26,490 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:26,492 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:26,499 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-09 16:55:26,500 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-12-09 16:55:26,533 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-09 16:55:26,535 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-09 16:55:26,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:26,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:26,545 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-09 16:55:26,547 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-09 16:55:26,547 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:26,549 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:26,554 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-09 16:55:26,554 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-09 16:55:26,572 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-09 16:55:26,572 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:55:26,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:26,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 16:55:26,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 16:55:26,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 16:55:26,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 16:55:26,575 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 8 states. [2018-12-09 16:55:27,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:27,115 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-12-09 16:55:27,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 16:55:27,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-12-09 16:55:27,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:27,117 INFO L225 Difference]: With dead ends: 86 [2018-12-09 16:55:27,117 INFO L226 Difference]: Without dead ends: 86 [2018-12-09 16:55:27,117 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-09 16:55:27,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-09 16:55:27,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2018-12-09 16:55:27,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-09 16:55:27,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-12-09 16:55:27,121 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 23 [2018-12-09 16:55:27,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:27,121 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-12-09 16:55:27,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 16:55:27,121 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-12-09 16:55:27,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 16:55:27,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:27,122 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-09 16:55:27,122 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-12-09 16:55:27,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:27,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1891685230, now seen corresponding path program 1 times [2018-12-09 16:55:27,122 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:55:27,123 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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-09 16:55:27,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:27,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:55:27,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-09 16:55:27,226 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-09 16:55:27,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:27,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:27,231 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-09 16:55:27,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-12-09 16:55:27,247 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-09 16:55:27,248 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-09 16:55:27,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:27,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:27,250 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-09 16:55:27,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-12-09 16:55:27,259 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-09 16:55:27,259 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:55:27,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:27,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 16:55:27,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 16:55:27,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 16:55:27,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:55:27,261 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 7 states. [2018-12-09 16:55:27,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:27,457 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-12-09 16:55:27,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 16:55:27,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-12-09 16:55:27,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:27,458 INFO L225 Difference]: With dead ends: 70 [2018-12-09 16:55:27,458 INFO L226 Difference]: Without dead ends: 70 [2018-12-09 16:55:27,458 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-09 16:55:27,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-09 16:55:27,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-09 16:55:27,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-09 16:55:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-12-09 16:55:27,461 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 25 [2018-12-09 16:55:27,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:27,462 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-12-09 16:55:27,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 16:55:27,462 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-12-09 16:55:27,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 16:55:27,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:27,463 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-09 16:55:27,463 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-12-09 16:55:27,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:27,463 INFO L82 PathProgramCache]: Analyzing trace with hash -2053284277, now seen corresponding path program 1 times [2018-12-09 16:55:27,464 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:55:27,464 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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-09 16:55:27,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:27,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:55:27,544 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-09 16:55:27,545 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-09 16:55:27,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:27,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:27,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:27,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-09 16:55:27,564 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-09 16:55:27,566 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-09 16:55:27,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:27,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:27,569 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-09 16:55:27,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-09 16:55:27,577 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-09 16:55:27,577 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:55:27,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:27,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 16:55:27,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 16:55:27,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 16:55:27,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:55:27,580 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 7 states. [2018-12-09 16:55:27,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:27,744 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-12-09 16:55:27,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 16:55:27,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-09 16:55:27,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:27,745 INFO L225 Difference]: With dead ends: 69 [2018-12-09 16:55:27,745 INFO L226 Difference]: Without dead ends: 69 [2018-12-09 16:55:27,745 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-09 16:55:27,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-09 16:55:27,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-09 16:55:27,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-09 16:55:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2018-12-09 16:55:27,747 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 26 [2018-12-09 16:55:27,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:27,748 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2018-12-09 16:55:27,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 16:55:27,748 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-12-09 16:55:27,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 16:55:27,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:27,748 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-09 16:55:27,748 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-12-09 16:55:27,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:27,749 INFO L82 PathProgramCache]: Analyzing trace with hash 772696921, now seen corresponding path program 1 times [2018-12-09 16:55:27,749 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:55:27,749 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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-09 16:55:27,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:27,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:55:27,835 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-09 16:55:27,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:27,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:27,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-09 16:55:27,852 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-09 16:55:27,854 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-09 16:55:27,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:27,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:27,859 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-09 16:55:27,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-09 16:55:27,879 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-09 16:55:27,880 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-09 16:55:27,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:27,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:27,883 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-09 16:55:27,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-12-09 16:55:27,890 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-09 16:55:27,890 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:55:27,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:27,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 16:55:27,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 16:55:27,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 16:55:27,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 16:55:27,893 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 8 states. [2018-12-09 16:55:28,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:28,166 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-12-09 16:55:28,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 16:55:28,167 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-12-09 16:55:28,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:28,167 INFO L225 Difference]: With dead ends: 68 [2018-12-09 16:55:28,167 INFO L226 Difference]: Without dead ends: 68 [2018-12-09 16:55:28,167 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-09 16:55:28,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-09 16:55:28,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-09 16:55:28,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 16:55:28,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-12-09 16:55:28,170 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 27 [2018-12-09 16:55:28,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:28,170 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-12-09 16:55:28,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 16:55:28,170 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-12-09 16:55:28,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 16:55:28,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:28,171 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-09 16:55:28,171 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-12-09 16:55:28,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:28,171 INFO L82 PathProgramCache]: Analyzing trace with hash 634278383, now seen corresponding path program 1 times [2018-12-09 16:55:28,171 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:55:28,171 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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-09 16:55:28,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:28,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:55:28,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 16:55:28,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:28,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:28,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-12-09 16:55:28,302 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-09 16:55:28,304 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-09 16:55:28,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:28,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:28,308 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-09 16:55:28,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-09 16:55:28,337 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-09 16:55:28,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:28,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:28,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2018-12-09 16:55:28,396 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-09 16:55:28,399 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-09 16:55:28,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:28,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:28,434 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-09 16:55:28,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2018-12-09 16:55:28,472 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-09 16:55:28,475 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-09 16:55:28,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:28,491 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-09 16:55:28,492 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:28,506 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-09 16:55:28,506 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:28,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:28,513 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-09 16:55:28,513 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:13 [2018-12-09 16:55:28,530 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-09 16:55:28,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:55:28,697 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-09 16:55:28,699 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-09 16:55:28,700 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-09 16:55:28,701 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-09 16:55:28,717 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-09 16:55:28,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:50 [2018-12-09 16:55:28,849 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-09 16:55:28,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:28,883 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-09 16:55:28,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:28,917 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-09 16:55:28,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-12-09 16:55:28,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-12-09 16:55:28,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:28,926 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-09 16:55:28,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:28,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 16:55:28,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2018-12-09 16:55:28,944 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-09 16:55:28,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:55:28,948 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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-09 16:55:28,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:29,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:55:29,007 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-09 16:55:29,009 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-09 16:55:29,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:29,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:29,014 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-09 16:55:29,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-12-09 16:55:29,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:29,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:29,039 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-09 16:55:29,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:29,046 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-09 16:55:29,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:25 [2018-12-09 16:55:29,151 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-09 16:55:29,155 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-09 16:55:29,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:29,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:29,201 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-09 16:55:29,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-12-09 16:55:29,256 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-09 16:55:29,259 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-09 16:55:29,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:29,283 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-09 16:55:29,283 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:29,303 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-09 16:55:29,303 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:29,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:29,312 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-09 16:55:29,313 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:43, output treesize:17 [2018-12-09 16:55:29,344 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-09 16:55:29,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:55:29,507 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-09 16:55:29,509 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-09 16:55:29,510 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-09 16:55:29,512 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-09 16:55:29,530 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-09 16:55:29,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:87 [2018-12-09 16:55:29,656 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-09 16:55:29,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 16:55:29,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 9] total 23 [2018-12-09 16:55:29,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 16:55:29,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 16:55:29,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2018-12-09 16:55:29,682 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 24 states. [2018-12-09 16:55:31,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:31,104 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-12-09 16:55:31,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 16:55:31,104 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2018-12-09 16:55:31,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:31,105 INFO L225 Difference]: With dead ends: 72 [2018-12-09 16:55:31,105 INFO L226 Difference]: Without dead ends: 72 [2018-12-09 16:55:31,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=201, Invalid=855, Unknown=0, NotChecked=0, Total=1056 [2018-12-09 16:55:31,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-09 16:55:31,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2018-12-09 16:55:31,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-09 16:55:31,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-12-09 16:55:31,107 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 28 [2018-12-09 16:55:31,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:31,107 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-12-09 16:55:31,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 16:55:31,107 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-12-09 16:55:31,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 16:55:31,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:31,107 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-09 16:55:31,108 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-12-09 16:55:31,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:31,108 INFO L82 PathProgramCache]: Analyzing trace with hash 634278384, now seen corresponding path program 1 times [2018-12-09 16:55:31,108 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:55:31,108 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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-09 16:55:31,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:31,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:55:31,224 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-09 16:55:31,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:31,237 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-09 16:55:31,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:31,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:31,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-12-09 16:55:31,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:31,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:31,264 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-09 16:55:31,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:31,282 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-09 16:55:31,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:31,295 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-09 16:55:31,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2018-12-09 16:55:31,347 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-09 16:55:31,349 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-09 16:55:31,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:31,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:31,373 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-09 16:55:31,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-09 16:55:31,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:31,378 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:31,389 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-09 16:55:31,389 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:43 [2018-12-09 16:55:31,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:31,476 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-09 16:55:31,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:31,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:31,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:31,498 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-09 16:55:31,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:31,519 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-09 16:55:31,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:46 [2018-12-09 16:55:31,607 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-09 16:55:31,611 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-09 16:55:31,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:31,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:31,682 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-09 16:55:31,687 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-09 16:55:31,687 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:31,723 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-09 16:55:31,723 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:31,733 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:31,744 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-09 16:55:31,745 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:62, output treesize:54 [2018-12-09 16:55:31,797 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-09 16:55:31,801 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-09 16:55:31,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:31,825 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-09 16:55:31,825 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:31,849 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-09 16:55:31,849 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:31,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:31,886 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-09 16:55:31,889 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-09 16:55:31,889 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:31,920 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-09 16:55:31,920 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:31,933 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:31,940 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-09 16:55:31,941 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:68, output treesize:22 [2018-12-09 16:55:31,976 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-09 16:55:31,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:55:33,143 WARN L180 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-12-09 16:55:33,146 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-09 16:55:33,148 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-09 16:55:33,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:33,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:33,156 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-09 16:55:33,158 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-09 16:55:33,159 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:33,162 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:33,164 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-09 16:55:33,166 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-09 16:55:33,167 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:33,170 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:33,350 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-09 16:55:33,353 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-09 16:55:33,353 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-09 16:55:33,369 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-09 16:55:33,372 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-09 16:55:33,376 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-09 16:55:33,376 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-09 16:55:33,388 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-09 16:55:33,558 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-09 16:55:33,560 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-09 16:55:33,562 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:33,566 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:33,568 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-09 16:55:33,573 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-09 16:55:33,574 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:33,578 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:33,704 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-09 16:55:33,706 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-09 16:55:33,707 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-09 16:55:33,718 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-09 16:55:33,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 24 treesize of output 22 [2018-12-09 16:55:33,723 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-09 16:55:33,723 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-09 16:55:33,733 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-09 16:55:33,864 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-09 16:55:33,864 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 7 variables, input treesize:104, output treesize:132 [2018-12-09 16:55:34,181 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 59 [2018-12-09 16:55:34,187 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:55:34,188 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:55:34,188 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-09 16:55:34,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:34,265 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:55:34,266 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:55:34,266 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-09 16:55:34,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:34,342 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:55:34,342 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:55:34,342 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-09 16:55:34,343 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:34,410 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:55:34,411 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:55:34,411 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-09 16:55:34,411 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:34,481 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:55:34,481 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:55:34,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2018-12-09 16:55:34,482 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:34,544 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-09 16:55:34,544 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 12 variables, input treesize:104, output treesize:47 [2018-12-09 16:55:34,990 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-09 16:55:34,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:55:34,993 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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-09 16:55:35,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:35,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:55:35,033 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-09 16:55:35,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:35,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:35,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-12-09 16:55:35,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:35,107 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-09 16:55:35,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:35,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:35,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:35,125 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-09 16:55:35,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:35,138 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-09 16:55:35,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2018-12-09 16:55:35,158 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-09 16:55:35,160 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-09 16:55:35,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:35,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:35,181 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-09 16:55:35,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-09 16:55:35,184 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:35,187 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:35,199 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-09 16:55:35,199 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:43 [2018-12-09 16:55:35,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:35,280 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-09 16:55:35,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:35,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:35,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:35,301 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-09 16:55:35,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:35,317 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-09 16:55:35,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:43 [2018-12-09 16:55:35,500 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-09 16:55:35,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 24 treesize of output 23 [2018-12-09 16:55:35,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:35,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:35,591 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-09 16:55:35,595 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-09 16:55:35,596 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:35,645 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:35,658 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-09 16:55:35,659 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:62, output treesize:54 [2018-12-09 16:55:35,744 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-09 16:55:35,747 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-09 16:55:35,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:35,770 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-09 16:55:35,770 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:35,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:35,804 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-09 16:55:35,808 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-09 16:55:35,808 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:35,821 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:35,827 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-09 16:55:35,827 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:68, output treesize:20 [2018-12-09 16:55:35,854 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-09 16:55:35,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:55:36,077 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2018-12-09 16:55:36,680 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-12-09 16:55:36,683 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-09 16:55:36,685 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-09 16:55:36,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:36,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:36,692 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-09 16:55:36,695 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-09 16:55:36,697 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:36,706 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:36,708 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-09 16:55:36,711 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-09 16:55:36,712 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:36,715 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:36,867 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-09 16:55:36,868 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-09 16:55:36,869 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:36,872 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:36,874 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-09 16:55:36,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-09 16:55:36,877 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:36,880 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:37,002 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-09 16:55:37,005 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-09 16:55:37,005 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-09 16:55:37,016 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-09 16:55:37,018 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-09 16:55:37,021 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-09 16:55:37,022 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-09 16:55:37,033 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-09 16:55:37,168 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-09 16:55:37,171 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-09 16:55:37,171 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-09 16:55:37,182 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-09 16:55:37,184 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-09 16:55:37,187 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-09 16:55:37,187 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-09 16:55:37,198 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-09 16:55:37,326 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-09 16:55:37,326 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 7 variables, input treesize:104, output treesize:132 [2018-12-09 16:55:37,508 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 16:55:37,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:37,573 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:55:37,573 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:55:37,574 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-09 16:55:37,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:37,633 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:55:37,634 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:55:37,634 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-09 16:55:37,635 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:37,693 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-09 16:55:37,693 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:132, output treesize:66 [2018-12-09 16:55:38,065 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:55:38,065 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:55:38,066 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-09 16:55:38,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:38,124 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:55:38,125 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:55:38,125 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-09 16:55:38,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:38,178 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-09 16:55:38,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:73 [2018-12-09 16:55:38,415 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-09 16:55:38,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 16:55:38,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 11, 11] total 28 [2018-12-09 16:55:38,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-09 16:55:38,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-09 16:55:38,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2018-12-09 16:55:38,433 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 29 states. [2018-12-09 16:55:39,446 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 50 [2018-12-09 16:55:40,110 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 49 [2018-12-09 16:55:41,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:41,535 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-12-09 16:55:41,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 16:55:41,536 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-12-09 16:55:41,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:41,537 INFO L225 Difference]: With dead ends: 68 [2018-12-09 16:55:41,537 INFO L226 Difference]: Without dead ends: 68 [2018-12-09 16:55:41,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 75 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 16:55:41,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-09 16:55:41,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-12-09 16:55:41,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-09 16:55:41,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-12-09 16:55:41,540 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 28 [2018-12-09 16:55:41,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:41,540 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-12-09 16:55:41,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-09 16:55:41,540 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-12-09 16:55:41,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 16:55:41,540 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:41,541 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-09 16:55:41,541 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-12-09 16:55:41,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:41,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1816199154, now seen corresponding path program 1 times [2018-12-09 16:55:41,541 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:55:41,541 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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-09 16:55:41,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:41,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:55:41,653 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-09 16:55:41,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:41,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:41,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 16:55:41,673 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-09 16:55:41,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:41,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:41,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2018-12-09 16:55:41,684 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-09 16:55:41,685 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-09 16:55:41,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:41,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:41,692 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-09 16:55:41,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-12-09 16:55:41,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:41,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:41,705 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-09 16:55:41,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:41,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:41,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2018-12-09 16:55:41,725 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-09 16:55:41,726 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-09 16:55:41,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:41,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:41,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:55:41,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-12-09 16:55:41,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:55:41,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-09 16:55:41,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:55:41,747 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-09 16:55:41,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-09 16:55:41,761 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-09 16:55:41,761 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:55:41,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:41,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 16:55:41,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 16:55:41,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 16:55:41,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 16:55:41,764 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 9 states. [2018-12-09 16:55:46,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:46,118 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-12-09 16:55:46,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 16:55:46,119 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-12-09 16:55:46,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:46,119 INFO L225 Difference]: With dead ends: 81 [2018-12-09 16:55:46,119 INFO L226 Difference]: Without dead ends: 81 [2018-12-09 16:55:46,119 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-09 16:55:46,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-09 16:55:46,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 65. [2018-12-09 16:55:46,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-09 16:55:46,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-12-09 16:55:46,121 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 28 [2018-12-09 16:55:46,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:46,121 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-12-09 16:55:46,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 16:55:46,121 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-12-09 16:55:46,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 16:55:46,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:46,121 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-09 16:55:46,121 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-12-09 16:55:46,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:46,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1816199153, now seen corresponding path program 1 times [2018-12-09 16:55:46,122 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:55:46,122 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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-09 16:55:46,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:55:46,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:55:46,167 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-09 16:55:46,167 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:55:46,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:55:46,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 16:55:46,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:55:46,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:55:46,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:55:46,169 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 3 states. [2018-12-09 16:55:46,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:55:46,271 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-12-09 16:55:46,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:55:46,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-09 16:55:46,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:55:46,271 INFO L225 Difference]: With dead ends: 60 [2018-12-09 16:55:46,272 INFO L226 Difference]: Without dead ends: 60 [2018-12-09 16:55:46,272 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-09 16:55:46,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-09 16:55:46,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-09 16:55:46,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 16:55:46,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-12-09 16:55:46,273 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 28 [2018-12-09 16:55:46,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:55:46,273 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-12-09 16:55:46,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:55:46,273 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-12-09 16:55:46,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 16:55:46,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:55:46,274 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-09 16:55:46,274 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr24ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2018-12-09 16:55:46,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:55:46,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1660103724, now seen corresponding path program 1 times [2018-12-09 16:55:46,274 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:55:46,274 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baadeb57-4371-42ce-a54e-fe9ea1f65bfe/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-09 16:55:46,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:55:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 16:55:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 16:55:46,540 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 16:55:46,549 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-09 16:55:46,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:55:46 BoogieIcfgContainer [2018-12-09 16:55:46,560 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 16:55:46,561 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 16:55:46,561 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 16:55:46,561 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 16:55:46,561 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:55:23" (3/4) ... [2018-12-09 16:55:46,564 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 16:55:46,564 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 16:55:46,564 INFO L168 Benchmark]: Toolchain (without parser) took 23759.13 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 330.3 MB). Free memory was 938.0 MB in the beginning and 1.2 GB in the end (delta: -212.3 MB). Peak memory consumption was 118.0 MB. Max. memory is 11.5 GB. [2018-12-09 16:55:46,564 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-09 16:55:46,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. [2018-12-09 16:55:46,565 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.77 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: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-09 16:55:46,565 INFO L168 Benchmark]: Boogie Preprocessor took 18.26 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-09 16:55:46,565 INFO L168 Benchmark]: RCFGBuilder took 312.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2018-12-09 16:55:46,565 INFO L168 Benchmark]: TraceAbstraction took 23135.33 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 199.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -69.7 MB). Peak memory consumption was 129.5 MB. Max. memory is 11.5 GB. [2018-12-09 16:55:46,565 INFO L168 Benchmark]: Witness Printer took 2.96 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:55:46,566 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 266.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.77 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: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.26 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 312.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23135.33 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 199.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -69.7 MB). Peak memory consumption was 129.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.96 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 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, 23.1s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 11.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 677 SDtfs, 932 SDslu, 1797 SDs, 0 SdLazy, 2599 SolverSat, 147 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 504 GetRequests, 348 SyntacticMatches, 11 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 6.0s 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.6s 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...