./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/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 b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/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 b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 13:46:42,202 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:46:42,203 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:46:42,210 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:46:42,210 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:46:42,211 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:46:42,212 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:46:42,213 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:46:42,214 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:46:42,214 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:46:42,215 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:46:42,215 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:46:42,216 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:46:42,217 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:46:42,217 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:46:42,218 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:46:42,219 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:46:42,220 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:46:42,221 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:46:42,222 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:46:42,223 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:46:42,223 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:46:42,224 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:46:42,225 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:46:42,225 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:46:42,225 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:46:42,226 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:46:42,226 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:46:42,227 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:46:42,227 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:46:42,228 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:46:42,228 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:46:42,228 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:46:42,228 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:46:42,229 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:46:42,229 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:46:42,230 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-18 13:46:42,237 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:46:42,237 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:46:42,238 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 13:46:42,238 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 13:46:42,238 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 13:46:42,238 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 13:46:42,238 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 13:46:42,238 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 13:46:42,238 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 13:46:42,239 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 13:46:42,239 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 13:46:42,239 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 13:46:42,239 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 13:46:42,239 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 13:46:42,240 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 13:46:42,240 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:46:42,240 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 13:46:42,240 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 13:46:42,240 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:46:42,240 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 13:46:42,240 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:46:42,241 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-18 13:46:42,241 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-18 13:46:42,241 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-18 13:46:42,241 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 13:46:42,241 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 13:46:42,241 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:46:42,241 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:46:42,241 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:46:42,242 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 13:46:42,242 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 13:46:42,242 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 13:46:42,242 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:46:42,242 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 13:46:42,242 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 13:46:42,242 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 13:46:42,242 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 13:46:42,243 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_a4ff574c-84fc-4849-84e3-972e67726aa3/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 -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2018-11-18 13:46:42,265 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:46:42,275 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:46:42,277 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:46:42,278 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:46:42,278 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:46:42,279 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-18 13:46:42,322 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/data/6405e5d4f/1cbb80e4eb7b4ca0a48ee537ed6a1284/FLAG67c6cae7c [2018-11-18 13:46:42,655 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:46:42,655 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-18 13:46:42,665 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/data/6405e5d4f/1cbb80e4eb7b4ca0a48ee537ed6a1284/FLAG67c6cae7c [2018-11-18 13:46:42,674 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/data/6405e5d4f/1cbb80e4eb7b4ca0a48ee537ed6a1284 [2018-11-18 13:46:42,676 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:46:42,676 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:46:42,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:46:42,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:46:42,679 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:46:42,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:46:42" (1/1) ... [2018-11-18 13:46:42,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e459b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:42, skipping insertion in model container [2018-11-18 13:46:42,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:46:42" (1/1) ... [2018-11-18 13:46:42,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:46:42,714 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:46:42,897 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:46:42,904 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:46:42,937 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:46:43,010 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:46:43,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:43 WrapperNode [2018-11-18 13:46:43,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:46:43,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:46:43,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:46:43,012 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:46:43,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:43" (1/1) ... [2018-11-18 13:46:43,026 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:43" (1/1) ... [2018-11-18 13:46:43,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:46:43,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:46:43,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:46:43,033 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:46:43,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:43" (1/1) ... [2018-11-18 13:46:43,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:43" (1/1) ... [2018-11-18 13:46:43,042 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:43" (1/1) ... [2018-11-18 13:46:43,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:43" (1/1) ... [2018-11-18 13:46:43,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:43" (1/1) ... [2018-11-18 13:46:43,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:43" (1/1) ... [2018-11-18 13:46:43,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:43" (1/1) ... [2018-11-18 13:46:43,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:46:43,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:46:43,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:46:43,056 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:46:43,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 13:46:43,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 13:46:43,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 13:46:43,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 13:46:43,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 13:46:43,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 13:46:43,094 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 13:46:43,094 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 13:46:43,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 13:46:43,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 13:46:43,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 13:46:43,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:46:43,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:46:43,485 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:46:43,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:46:43 BoogieIcfgContainer [2018-11-18 13:46:43,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:46:43,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 13:46:43,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 13:46:43,490 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 13:46:43,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:46:42" (1/3) ... [2018-11-18 13:46:43,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d9107e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:46:43, skipping insertion in model container [2018-11-18 13:46:43,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:43" (2/3) ... [2018-11-18 13:46:43,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d9107e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:46:43, skipping insertion in model container [2018-11-18 13:46:43,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:46:43" (3/3) ... [2018-11-18 13:46:43,493 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-18 13:46:43,501 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 13:46:43,511 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-11-18 13:46:43,524 INFO L257 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2018-11-18 13:46:43,546 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 13:46:43,547 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-18 13:46:43,547 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 13:46:43,547 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:46:43,547 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:46:43,547 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 13:46:43,547 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:46:43,547 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 13:46:43,562 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2018-11-18 13:46:43,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 13:46:43,570 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:43,570 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:43,572 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION]=== [2018-11-18 13:46:43,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:43,577 INFO L82 PathProgramCache]: Analyzing trace with hash -803775151, now seen corresponding path program 1 times [2018-11-18 13:46:43,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:46:43,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:43,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:43,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:43,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:46:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:43,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:43,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:43,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:46:43,701 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:46:43,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:43,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:43,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:43,713 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 3 states. [2018-11-18 13:46:43,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:43,860 INFO L93 Difference]: Finished difference Result 182 states and 189 transitions. [2018-11-18 13:46:43,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:43,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-18 13:46:43,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:43,867 INFO L225 Difference]: With dead ends: 182 [2018-11-18 13:46:43,867 INFO L226 Difference]: Without dead ends: 178 [2018-11-18 13:46:43,868 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:43,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-18 13:46:43,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 153. [2018-11-18 13:46:43,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-18 13:46:43,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 158 transitions. [2018-11-18 13:46:43,894 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 158 transitions. Word has length 7 [2018-11-18 13:46:43,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:43,894 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 158 transitions. [2018-11-18 13:46:43,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:43,894 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 158 transitions. [2018-11-18 13:46:43,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 13:46:43,895 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:43,895 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:43,895 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION]=== [2018-11-18 13:46:43,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:43,896 INFO L82 PathProgramCache]: Analyzing trace with hash -803775150, now seen corresponding path program 1 times [2018-11-18 13:46:43,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:46:43,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:43,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:43,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:43,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:46:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:43,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:43,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:43,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:46:43,946 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:46:43,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:43,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:43,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:43,948 INFO L87 Difference]: Start difference. First operand 153 states and 158 transitions. Second operand 3 states. [2018-11-18 13:46:44,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:44,032 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2018-11-18 13:46:44,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:44,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-18 13:46:44,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:44,033 INFO L225 Difference]: With dead ends: 150 [2018-11-18 13:46:44,034 INFO L226 Difference]: Without dead ends: 150 [2018-11-18 13:46:44,034 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:44,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-18 13:46:44,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-11-18 13:46:44,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-18 13:46:44,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 155 transitions. [2018-11-18 13:46:44,042 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 155 transitions. Word has length 7 [2018-11-18 13:46:44,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:44,042 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 155 transitions. [2018-11-18 13:46:44,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:44,042 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 155 transitions. [2018-11-18 13:46:44,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 13:46:44,042 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:44,042 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:44,043 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION]=== [2018-11-18 13:46:44,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:44,043 INFO L82 PathProgramCache]: Analyzing trace with hash 260864917, now seen corresponding path program 1 times [2018-11-18 13:46:44,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:46:44,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:44,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:44,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:44,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:46:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:44,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:44,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:44,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:46:44,071 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:46:44,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:44,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:44,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:44,071 INFO L87 Difference]: Start difference. First operand 150 states and 155 transitions. Second operand 3 states. [2018-11-18 13:46:44,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:44,161 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2018-11-18 13:46:44,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:44,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-18 13:46:44,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:44,162 INFO L225 Difference]: With dead ends: 150 [2018-11-18 13:46:44,162 INFO L226 Difference]: Without dead ends: 150 [2018-11-18 13:46:44,162 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:44,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-18 13:46:44,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2018-11-18 13:46:44,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-18 13:46:44,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 153 transitions. [2018-11-18 13:46:44,166 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 153 transitions. Word has length 11 [2018-11-18 13:46:44,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:44,167 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 153 transitions. [2018-11-18 13:46:44,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:44,167 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 153 transitions. [2018-11-18 13:46:44,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 13:46:44,167 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:44,167 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:44,167 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION]=== [2018-11-18 13:46:44,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:44,168 INFO L82 PathProgramCache]: Analyzing trace with hash 260864918, now seen corresponding path program 1 times [2018-11-18 13:46:44,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:46:44,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:44,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:44,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:44,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:46:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:44,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:44,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:44,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:46:44,212 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:46:44,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:44,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:44,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:44,212 INFO L87 Difference]: Start difference. First operand 146 states and 153 transitions. Second operand 3 states. [2018-11-18 13:46:44,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:44,280 INFO L93 Difference]: Finished difference Result 159 states and 165 transitions. [2018-11-18 13:46:44,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:44,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-18 13:46:44,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:44,282 INFO L225 Difference]: With dead ends: 159 [2018-11-18 13:46:44,282 INFO L226 Difference]: Without dead ends: 159 [2018-11-18 13:46:44,282 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:44,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-18 13:46:44,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 150. [2018-11-18 13:46:44,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-18 13:46:44,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 157 transitions. [2018-11-18 13:46:44,288 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 157 transitions. Word has length 11 [2018-11-18 13:46:44,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:44,288 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 157 transitions. [2018-11-18 13:46:44,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:44,288 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 157 transitions. [2018-11-18 13:46:44,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 13:46:44,289 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:44,289 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:44,289 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION]=== [2018-11-18 13:46:44,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:44,290 INFO L82 PathProgramCache]: Analyzing trace with hash -306180954, now seen corresponding path program 1 times [2018-11-18 13:46:44,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:46:44,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:44,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:44,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:44,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:46:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:44,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:44,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:44,338 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:46:44,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 13:46:44,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:46:44,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:46:44,339 INFO L87 Difference]: Start difference. First operand 150 states and 157 transitions. Second operand 4 states. [2018-11-18 13:46:44,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:44,450 INFO L93 Difference]: Finished difference Result 153 states and 161 transitions. [2018-11-18 13:46:44,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:46:44,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-18 13:46:44,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:44,451 INFO L225 Difference]: With dead ends: 153 [2018-11-18 13:46:44,451 INFO L226 Difference]: Without dead ends: 153 [2018-11-18 13:46:44,451 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:46:44,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-18 13:46:44,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 138. [2018-11-18 13:46:44,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-18 13:46:44,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 147 transitions. [2018-11-18 13:46:44,455 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 147 transitions. Word has length 18 [2018-11-18 13:46:44,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:44,455 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 147 transitions. [2018-11-18 13:46:44,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 13:46:44,455 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 147 transitions. [2018-11-18 13:46:44,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 13:46:44,456 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:44,456 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:44,456 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION]=== [2018-11-18 13:46:44,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:44,456 INFO L82 PathProgramCache]: Analyzing trace with hash -306180953, now seen corresponding path program 1 times [2018-11-18 13:46:44,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:46:44,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:44,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:44,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:44,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:46:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:44,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:44,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:44,496 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:46:44,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 13:46:44,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:46:44,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:46:44,497 INFO L87 Difference]: Start difference. First operand 138 states and 147 transitions. Second operand 4 states. [2018-11-18 13:46:44,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:44,611 INFO L93 Difference]: Finished difference Result 174 states and 184 transitions. [2018-11-18 13:46:44,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:46:44,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-18 13:46:44,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:44,612 INFO L225 Difference]: With dead ends: 174 [2018-11-18 13:46:44,612 INFO L226 Difference]: Without dead ends: 174 [2018-11-18 13:46:44,612 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:46:44,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-18 13:46:44,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 148. [2018-11-18 13:46:44,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-18 13:46:44,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-11-18 13:46:44,617 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 18 [2018-11-18 13:46:44,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:44,617 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-11-18 13:46:44,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 13:46:44,617 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-11-18 13:46:44,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 13:46:44,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:44,618 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:44,618 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION]=== [2018-11-18 13:46:44,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:44,618 INFO L82 PathProgramCache]: Analyzing trace with hash 2112846953, now seen corresponding path program 1 times [2018-11-18 13:46:44,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:46:44,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:44,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:44,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:44,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:46:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:44,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:44,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:44,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:46:44,669 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:46:44,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:46:44,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:46:44,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:46:44,670 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 5 states. [2018-11-18 13:46:44,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:44,821 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2018-11-18 13:46:44,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:46:44,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-18 13:46:44,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:44,822 INFO L225 Difference]: With dead ends: 197 [2018-11-18 13:46:44,822 INFO L226 Difference]: Without dead ends: 197 [2018-11-18 13:46:44,823 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:46:44,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-18 13:46:44,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 147. [2018-11-18 13:46:44,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-18 13:46:44,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2018-11-18 13:46:44,827 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 20 [2018-11-18 13:46:44,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:44,827 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2018-11-18 13:46:44,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:46:44,827 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2018-11-18 13:46:44,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 13:46:44,828 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:44,828 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:44,830 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION]=== [2018-11-18 13:46:44,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:44,830 INFO L82 PathProgramCache]: Analyzing trace with hash 2112846954, now seen corresponding path program 1 times [2018-11-18 13:46:44,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:46:44,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:44,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:44,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:44,831 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:46:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:44,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:44,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:44,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:46:44,886 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:46:44,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:46:44,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:46:44,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:46:44,887 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand 5 states. [2018-11-18 13:46:45,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:45,046 INFO L93 Difference]: Finished difference Result 219 states and 236 transitions. [2018-11-18 13:46:45,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:46:45,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-18 13:46:45,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:45,047 INFO L225 Difference]: With dead ends: 219 [2018-11-18 13:46:45,048 INFO L226 Difference]: Without dead ends: 219 [2018-11-18 13:46:45,048 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-18 13:46:45,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-18 13:46:45,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 146. [2018-11-18 13:46:45,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-18 13:46:45,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2018-11-18 13:46:45,052 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 20 [2018-11-18 13:46:45,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:45,052 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2018-11-18 13:46:45,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:46:45,052 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2018-11-18 13:46:45,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 13:46:45,053 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:45,053 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:45,053 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION]=== [2018-11-18 13:46:45,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:45,054 INFO L82 PathProgramCache]: Analyzing trace with hash -945772501, now seen corresponding path program 1 times [2018-11-18 13:46:45,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:46:45,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:45,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:45,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:45,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:46:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:45,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:45,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:45,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 13:46:45,151 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:46:45,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 13:46:45,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 13:46:45,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 13:46:45,152 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. Second operand 9 states. [2018-11-18 13:46:45,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:45,429 INFO L93 Difference]: Finished difference Result 159 states and 169 transitions. [2018-11-18 13:46:45,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 13:46:45,430 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-11-18 13:46:45,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:45,431 INFO L225 Difference]: With dead ends: 159 [2018-11-18 13:46:45,431 INFO L226 Difference]: Without dead ends: 159 [2018-11-18 13:46:45,431 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-11-18 13:46:45,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-18 13:46:45,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 145. [2018-11-18 13:46:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-18 13:46:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2018-11-18 13:46:45,434 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 24 [2018-11-18 13:46:45,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:45,435 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2018-11-18 13:46:45,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 13:46:45,435 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2018-11-18 13:46:45,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 13:46:45,435 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:45,435 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:45,436 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION]=== [2018-11-18 13:46:45,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:45,436 INFO L82 PathProgramCache]: Analyzing trace with hash -945772500, now seen corresponding path program 1 times [2018-11-18 13:46:45,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:46:45,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:45,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:45,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:45,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:46:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:45,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:45,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:45,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 13:46:45,600 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:46:45,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 13:46:45,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 13:46:45,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-18 13:46:45,600 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand 10 states. [2018-11-18 13:46:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:46,045 INFO L93 Difference]: Finished difference Result 174 states and 185 transitions. [2018-11-18 13:46:46,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 13:46:46,050 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-18 13:46:46,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:46,050 INFO L225 Difference]: With dead ends: 174 [2018-11-18 13:46:46,050 INFO L226 Difference]: Without dead ends: 174 [2018-11-18 13:46:46,051 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-11-18 13:46:46,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-18 13:46:46,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 150. [2018-11-18 13:46:46,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-18 13:46:46,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2018-11-18 13:46:46,053 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 24 [2018-11-18 13:46:46,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:46,053 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2018-11-18 13:46:46,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 13:46:46,054 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-11-18 13:46:46,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 13:46:46,054 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:46,054 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:46,054 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION]=== [2018-11-18 13:46:46,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:46,055 INFO L82 PathProgramCache]: Analyzing trace with hash -642909323, now seen corresponding path program 1 times [2018-11-18 13:46:46,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:46:46,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:46,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:46,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:46,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:46:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:46,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:46,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:46,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 13:46:46,090 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:46:46,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 13:46:46,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:46:46,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:46:46,091 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand 6 states. [2018-11-18 13:46:46,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:46,239 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2018-11-18 13:46:46,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 13:46:46,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-18 13:46:46,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:46,240 INFO L225 Difference]: With dead ends: 177 [2018-11-18 13:46:46,240 INFO L226 Difference]: Without dead ends: 177 [2018-11-18 13:46:46,240 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-18 13:46:46,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-18 13:46:46,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 150. [2018-11-18 13:46:46,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-18 13:46:46,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2018-11-18 13:46:46,242 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 31 [2018-11-18 13:46:46,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:46,243 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2018-11-18 13:46:46,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 13:46:46,243 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2018-11-18 13:46:46,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 13:46:46,243 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:46,244 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:46,244 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION]=== [2018-11-18 13:46:46,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:46,244 INFO L82 PathProgramCache]: Analyzing trace with hash -893945774, now seen corresponding path program 1 times [2018-11-18 13:46:46,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:46:46,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:46,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:46,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:46,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:46:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:46,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:46,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:46,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:46:46,274 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:46:46,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:46:46,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:46:46,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:46:46,275 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand 5 states. [2018-11-18 13:46:46,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:46,406 INFO L93 Difference]: Finished difference Result 225 states and 240 transitions. [2018-11-18 13:46:46,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:46:46,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-18 13:46:46,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:46,407 INFO L225 Difference]: With dead ends: 225 [2018-11-18 13:46:46,407 INFO L226 Difference]: Without dead ends: 225 [2018-11-18 13:46:46,408 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:46:46,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-11-18 13:46:46,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 149. [2018-11-18 13:46:46,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-18 13:46:46,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 158 transitions. [2018-11-18 13:46:46,410 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 158 transitions. Word has length 31 [2018-11-18 13:46:46,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:46,410 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 158 transitions. [2018-11-18 13:46:46,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:46:46,410 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 158 transitions. [2018-11-18 13:46:46,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 13:46:46,411 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:46,411 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:46,411 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION]=== [2018-11-18 13:46:46,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:46,412 INFO L82 PathProgramCache]: Analyzing trace with hash -893945773, now seen corresponding path program 1 times [2018-11-18 13:46:46,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:46:46,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:46,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:46,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:46,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:46:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:46,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:46,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:46,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:46:46,475 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:46:46,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:46:46,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:46:46,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:46:46,476 INFO L87 Difference]: Start difference. First operand 149 states and 158 transitions. Second operand 5 states. [2018-11-18 13:46:46,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:46,682 INFO L93 Difference]: Finished difference Result 247 states and 264 transitions. [2018-11-18 13:46:46,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:46:46,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-18 13:46:46,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:46,684 INFO L225 Difference]: With dead ends: 247 [2018-11-18 13:46:46,684 INFO L226 Difference]: Without dead ends: 247 [2018-11-18 13:46:46,684 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-18 13:46:46,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-18 13:46:46,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 148. [2018-11-18 13:46:46,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-18 13:46:46,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 157 transitions. [2018-11-18 13:46:46,688 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 157 transitions. Word has length 31 [2018-11-18 13:46:46,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:46,688 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 157 transitions. [2018-11-18 13:46:46,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:46:46,688 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 157 transitions. [2018-11-18 13:46:46,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 13:46:46,689 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:46,689 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:46,692 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION]=== [2018-11-18 13:46:46,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:46,693 INFO L82 PathProgramCache]: Analyzing trace with hash -356253094, now seen corresponding path program 1 times [2018-11-18 13:46:46,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:46:46,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:46,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:46,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:46,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:46:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:46,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:46,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:46:46,777 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:46:46,777 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-11-18 13:46:46,780 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [15], [16], [19], [22], [25], [29], [31], [34], [148], [152], [157], [161], [169], [170], [177], [181], [189], [195], [196], [197], [245], [247], [250], [302], [303], [304] [2018-11-18 13:46:46,806 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:46:46,807 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:46:46,926 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 13:46:46,926 INFO L272 AbstractInterpreter]: Visited 32 different actions 32 times. Never merged. Never widened. Performed 176 root evaluator evaluations with a maximum evaluation depth of 3. Performed 176 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-11-18 13:46:46,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:46,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 13:46:46,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:46:46,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:46:46,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:46,948 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 13:46:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:46,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:46:47,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:46:47,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:46:47,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:47,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:47,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:46:47,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:46:47,049 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:47,051 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:47,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:47,070 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-11-18 13:46:47,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-11-18 13:46:47,102 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:46:47,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 13:46:47,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:47,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:47,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-11-18 13:46:47,134 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:46:47,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 13:46:47,136 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:47,150 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:47,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:47,174 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:33 [2018-11-18 13:46:47,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-18 13:46:47,213 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:46:47,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-18 13:46:47,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:47,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:47,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-18 13:46:47,226 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:46:47,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-18 13:46:47,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:47,229 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:47,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:47,231 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-11-18 13:46:47,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:47,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:46:47,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:47,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 13:46:47,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 8 [2018-11-18 13:46:47,283 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 13:46:47,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 13:46:47,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 13:46:47,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 13:46:47,284 INFO L87 Difference]: Start difference. First operand 148 states and 157 transitions. Second operand 8 states. [2018-11-18 13:46:47,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:47,488 INFO L93 Difference]: Finished difference Result 213 states and 226 transitions. [2018-11-18 13:46:47,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 13:46:47,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-11-18 13:46:47,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:47,488 INFO L225 Difference]: With dead ends: 213 [2018-11-18 13:46:47,489 INFO L226 Difference]: Without dead ends: 213 [2018-11-18 13:46:47,489 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 9 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-18 13:46:47,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-11-18 13:46:47,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 167. [2018-11-18 13:46:47,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-18 13:46:47,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 178 transitions. [2018-11-18 13:46:47,492 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 178 transitions. Word has length 34 [2018-11-18 13:46:47,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:47,493 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 178 transitions. [2018-11-18 13:46:47,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 13:46:47,493 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 178 transitions. [2018-11-18 13:46:47,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 13:46:47,494 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:47,494 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:47,494 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION]=== [2018-11-18 13:46:47,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:47,494 INFO L82 PathProgramCache]: Analyzing trace with hash 919904020, now seen corresponding path program 1 times [2018-11-18 13:46:47,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:46:47,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:47,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:47,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:47,496 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:46:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:47,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:47,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:47,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 13:46:47,556 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:46:47,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 13:46:47,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 13:46:47,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 13:46:47,556 INFO L87 Difference]: Start difference. First operand 167 states and 178 transitions. Second operand 8 states. [2018-11-18 13:46:47,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:47,743 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2018-11-18 13:46:47,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 13:46:47,743 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-11-18 13:46:47,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:47,744 INFO L225 Difference]: With dead ends: 167 [2018-11-18 13:46:47,744 INFO L226 Difference]: Without dead ends: 167 [2018-11-18 13:46:47,744 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-11-18 13:46:47,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-18 13:46:47,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2018-11-18 13:46:47,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-18 13:46:47,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 177 transitions. [2018-11-18 13:46:47,748 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 177 transitions. Word has length 35 [2018-11-18 13:46:47,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:47,748 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 177 transitions. [2018-11-18 13:46:47,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 13:46:47,748 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 177 transitions. [2018-11-18 13:46:47,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 13:46:47,749 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:47,749 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:47,749 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION]=== [2018-11-18 13:46:47,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:47,749 INFO L82 PathProgramCache]: Analyzing trace with hash 919904021, now seen corresponding path program 1 times [2018-11-18 13:46:47,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:46:47,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:47,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:47,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:47,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:46:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:47,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:47,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 13:46:47,849 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:46:47,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 13:46:47,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 13:46:47,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 13:46:47,849 INFO L87 Difference]: Start difference. First operand 166 states and 177 transitions. Second operand 9 states. [2018-11-18 13:46:48,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:48,087 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2018-11-18 13:46:48,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 13:46:48,087 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-11-18 13:46:48,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:48,087 INFO L225 Difference]: With dead ends: 162 [2018-11-18 13:46:48,087 INFO L226 Difference]: Without dead ends: 162 [2018-11-18 13:46:48,088 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-11-18 13:46:48,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-18 13:46:48,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 140. [2018-11-18 13:46:48,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-18 13:46:48,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2018-11-18 13:46:48,090 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 35 [2018-11-18 13:46:48,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:48,090 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2018-11-18 13:46:48,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 13:46:48,090 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2018-11-18 13:46:48,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 13:46:48,091 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:48,091 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:48,091 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION]=== [2018-11-18 13:46:48,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:48,091 INFO L82 PathProgramCache]: Analyzing trace with hash -688290978, now seen corresponding path program 1 times [2018-11-18 13:46:48,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:46:48,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:48,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:48,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:48,092 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:46:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:48,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:48,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:46:48,156 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:46:48,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:46:48,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:46:48,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:46:48,156 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand 5 states. [2018-11-18 13:46:48,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:48,219 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2018-11-18 13:46:48,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:46:48,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-11-18 13:46:48,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:48,219 INFO L225 Difference]: With dead ends: 146 [2018-11-18 13:46:48,219 INFO L226 Difference]: Without dead ends: 146 [2018-11-18 13:46:48,220 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:46:48,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-18 13:46:48,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 139. [2018-11-18 13:46:48,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-18 13:46:48,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 147 transitions. [2018-11-18 13:46:48,221 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 147 transitions. Word has length 36 [2018-11-18 13:46:48,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:48,222 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 147 transitions. [2018-11-18 13:46:48,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:46:48,222 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 147 transitions. [2018-11-18 13:46:48,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 13:46:48,222 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:48,222 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:48,223 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION]=== [2018-11-18 13:46:48,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:48,223 INFO L82 PathProgramCache]: Analyzing trace with hash -271564881, now seen corresponding path program 1 times [2018-11-18 13:46:48,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:46:48,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:48,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:48,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:48,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:46:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:48,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:46:48,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:48,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 13:46:48,264 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:46:48,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 13:46:48,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:46:48,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:46:48,264 INFO L87 Difference]: Start difference. First operand 139 states and 147 transitions. Second operand 6 states. [2018-11-18 13:46:48,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:48,397 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2018-11-18 13:46:48,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 13:46:48,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-11-18 13:46:48,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:48,398 INFO L225 Difference]: With dead ends: 152 [2018-11-18 13:46:48,398 INFO L226 Difference]: Without dead ends: 152 [2018-11-18 13:46:48,398 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-18 13:46:48,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-18 13:46:48,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 139. [2018-11-18 13:46:48,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-18 13:46:48,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 146 transitions. [2018-11-18 13:46:48,400 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 146 transitions. Word has length 37 [2018-11-18 13:46:48,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:48,401 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 146 transitions. [2018-11-18 13:46:48,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 13:46:48,401 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 146 transitions. [2018-11-18 13:46:48,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 13:46:48,401 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:48,401 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:48,402 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION]=== [2018-11-18 13:46:48,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:48,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1417661533, now seen corresponding path program 1 times [2018-11-18 13:46:48,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:46:48,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:48,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:48,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:48,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:46:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:48,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:48,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:46:48,458 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:46:48,458 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-11-18 13:46:48,458 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [15], [16], [19], [22], [25], [29], [31], [34], [148], [152], [157], [161], [169], [170], [177], [181], [189], [193], [195], [196], [245], [247], [250], [256], [262], [263], [268], [269], [272], [274], [276], [278], [302], [303], [304] [2018-11-18 13:46:48,460 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:46:48,460 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:46:48,500 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 13:46:48,500 INFO L272 AbstractInterpreter]: Visited 41 different actions 41 times. Never merged. Never widened. Performed 216 root evaluator evaluations with a maximum evaluation depth of 3. Performed 216 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 34 variables. [2018-11-18 13:46:48,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:48,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 13:46:48,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:46:48,502 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:46:48,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:48,510 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 13:46:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:48,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:46:48,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 13:46:48,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 13:46:48,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:48,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:48,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:48,534 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-18 13:46:48,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-18 13:46:48,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-18 13:46:48,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:48,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:48,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:48,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-18 13:46:48,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:46:48,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:46:48,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:46:48,602 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:46:48,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 9 [2018-11-18 13:46:48,603 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:46:48,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 13:46:48,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:46:48,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 13:46:48,603 INFO L87 Difference]: Start difference. First operand 139 states and 146 transitions. Second operand 4 states. [2018-11-18 13:46:48,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:48,645 INFO L93 Difference]: Finished difference Result 206 states and 217 transitions. [2018-11-18 13:46:48,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:46:48,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-11-18 13:46:48,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:48,647 INFO L225 Difference]: With dead ends: 206 [2018-11-18 13:46:48,647 INFO L226 Difference]: Without dead ends: 206 [2018-11-18 13:46:48,647 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-18 13:46:48,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-11-18 13:46:48,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 195. [2018-11-18 13:46:48,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-18 13:46:48,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 212 transitions. [2018-11-18 13:46:48,651 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 212 transitions. Word has length 42 [2018-11-18 13:46:48,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:48,652 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 212 transitions. [2018-11-18 13:46:48,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 13:46:48,652 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 212 transitions. [2018-11-18 13:46:48,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 13:46:48,652 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:48,652 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:48,653 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION]=== [2018-11-18 13:46:48,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:48,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1501583991, now seen corresponding path program 1 times [2018-11-18 13:46:48,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:46:48,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:48,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:48,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:48,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:46:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:48,796 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:48,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:46:48,796 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:46:48,796 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-11-18 13:46:48,797 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [15], [16], [19], [22], [25], [29], [31], [34], [148], [152], [157], [161], [169], [170], [177], [181], [189], [193], [195], [196], [245], [247], [250], [256], [262], [263], [264], [286], [287], [290], [292], [294], [302], [303], [304] [2018-11-18 13:46:48,799 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:46:48,799 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:46:48,843 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 13:46:48,843 INFO L272 AbstractInterpreter]: Visited 41 different actions 41 times. Never merged. Never widened. Performed 220 root evaluator evaluations with a maximum evaluation depth of 3. Performed 220 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 34 variables. [2018-11-18 13:46:48,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:48,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 13:46:48,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:46:48,866 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:46:48,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:48,873 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 13:46:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:48,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:46:48,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 13:46:48,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 13:46:48,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:48,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:48,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:48,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-18 13:46:49,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-18 13:46:49,016 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:46:49,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-18 13:46:49,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:49,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:49,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 13:46:49,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 13:46:49,027 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:49,030 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:49,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:49,034 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:10 [2018-11-18 13:46:49,079 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:49,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:46:49,197 INFO L477 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 23 treesize of output 27 [2018-11-18 13:46:49,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-18 13:46:49,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:49,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-11-18 13:46:49,218 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:49,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:46:49,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:46:49,235 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:43, output treesize:31 [2018-11-18 13:46:49,261 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:49,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 13:46:49,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 10] total 23 [2018-11-18 13:46:49,277 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 13:46:49,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 13:46:49,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 13:46:49,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2018-11-18 13:46:49,278 INFO L87 Difference]: Start difference. First operand 195 states and 212 transitions. Second operand 17 states. [2018-11-18 13:46:49,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:49,780 INFO L93 Difference]: Finished difference Result 271 states and 297 transitions. [2018-11-18 13:46:49,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 13:46:49,780 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-11-18 13:46:49,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:49,781 INFO L225 Difference]: With dead ends: 271 [2018-11-18 13:46:49,781 INFO L226 Difference]: Without dead ends: 271 [2018-11-18 13:46:49,782 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=989, Unknown=0, NotChecked=0, Total=1190 [2018-11-18 13:46:49,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-11-18 13:46:49,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 215. [2018-11-18 13:46:49,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-11-18 13:46:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 235 transitions. [2018-11-18 13:46:49,786 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 235 transitions. Word has length 44 [2018-11-18 13:46:49,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:49,786 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 235 transitions. [2018-11-18 13:46:49,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 13:46:49,786 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 235 transitions. [2018-11-18 13:46:49,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 13:46:49,786 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:49,786 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:49,787 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr8REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION]=== [2018-11-18 13:46:49,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:49,787 INFO L82 PathProgramCache]: Analyzing trace with hash -695537071, now seen corresponding path program 1 times [2018-11-18 13:46:49,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:46:49,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:49,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:49,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:49,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:46:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:46:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:46:49,817 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 13:46:49,833 WARN L387 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-11-18 13:46:49,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 01:46:49 BoogieIcfgContainer [2018-11-18 13:46:49,852 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 13:46:49,854 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:46:49,854 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:46:49,854 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:46:49,855 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:46:43" (3/4) ... [2018-11-18 13:46:49,859 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 13:46:49,859 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:46:49,860 INFO L168 Benchmark]: Toolchain (without parser) took 7183.74 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 341.3 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -185.7 MB). Peak memory consumption was 155.6 MB. Max. memory is 11.5 GB. [2018-11-18 13:46:49,861 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:46:49,861 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 955.5 MB in the beginning and 1.2 GB in the end (delta: -196.5 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:46:49,861 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:46:49,862 INFO L168 Benchmark]: Boogie Preprocessor took 22.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-18 13:46:49,862 INFO L168 Benchmark]: RCFGBuilder took 429.86 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: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. [2018-11-18 13:46:49,862 INFO L168 Benchmark]: TraceAbstraction took 6365.89 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -40.1 MB). Peak memory consumption was 138.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:46:49,863 INFO L168 Benchmark]: Witness Printer took 5.48 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:46:49,865 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 334.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 955.5 MB in the beginning and 1.2 GB in the end (delta: -196.5 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 429.86 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: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6365.89 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -40.1 MB). Peak memory consumption was 138.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.48 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 985. Possible FailurePath: [L987] EXPR, FCALL malloc(sizeof(struct TSLL)) [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); VAL [malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L988] FCALL null->next = ((void*)0) VAL [malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L989] FCALL null->prev = ((void*)0) VAL [malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L990] FCALL null->colour = BLACK VAL [malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L992] EXPR, FCALL malloc(sizeof(struct TSLL)) [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={14:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L993] FCALL list->next = null VAL [list={14:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L994] FCALL list->prev = null VAL [list={14:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L995] FCALL list->colour = BLACK VAL [list={14:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L997] struct TSLL* end = list; VAL [end={14:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={14:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={14:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1030] COND FALSE !(0) VAL [end={14:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1031] EXPR, FCALL end->colour VAL [end={14:0}, end->colour=1, list={14:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1031] COND FALSE !(0) VAL [end={14:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1032] COND TRUE null != end VAL [end={14:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1034] EXPR, FCALL end->colour VAL [end={14:0}, end->colour=1, list={14:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR, FCALL end->next VAL [end={14:0}, end->next={15:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1041] end = end->next [L1032] COND FALSE !(null != end) VAL [end={15:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1045] COND TRUE null != list VAL [end={15:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1047] EXPR, FCALL list->colour VAL [end={15:0}, list={14:0}, list->colour=1, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1047] COND FALSE !(RED == list->colour) [L1056] EXPR, FCALL list->next VAL [end={15:0}, list={14:0}, list->next={15:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1056] end = list->next [L1057] free(list) VAL [end={15:0}, list={14:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1057] free(list) [L1057] FCALL free(list) [L1058] list = end VAL [end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1045] COND FALSE !(null != list) VAL [end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1062] return 0; VAL [\result=0, end={15:0}, list={15:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 159 locations, 67 error locations. UNSAFE Result, 6.3s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1964 SDtfs, 2980 SDslu, 3951 SDs, 0 SdLazy, 5034 SolverSat, 237 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 415 GetRequests, 235 SyntacticMatches, 24 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 598 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 681 NumberOfCodeBlocks, 681 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 730 ConstructedInterpolants, 0 QuantifiedInterpolants, 186571 SizeOfPredicates, 35 NumberOfNonLiveVariables, 474 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 26 InterpolantComputations, 19 PerfectInterpolantSequences, 12/32 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-5842f4b [2018-11-18 13:46:51,299 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:46:51,300 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:46:51,308 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:46:51,308 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:46:51,308 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:46:51,309 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:46:51,310 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:46:51,311 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:46:51,312 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:46:51,312 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:46:51,313 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:46:51,313 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:46:51,314 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:46:51,315 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:46:51,316 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:46:51,316 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:46:51,317 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:46:51,319 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:46:51,320 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:46:51,321 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:46:51,322 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:46:51,324 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:46:51,324 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:46:51,324 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:46:51,325 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:46:51,325 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:46:51,326 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:46:51,327 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:46:51,328 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:46:51,328 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:46:51,328 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:46:51,328 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:46:51,329 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:46:51,329 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:46:51,329 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:46:51,330 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-11-18 13:46:51,341 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:46:51,341 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:46:51,342 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 13:46:51,342 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 13:46:51,342 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 13:46:51,342 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 13:46:51,342 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 13:46:51,342 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 13:46:51,342 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 13:46:51,342 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 13:46:51,343 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 13:46:51,343 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 13:46:51,343 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:46:51,343 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 13:46:51,343 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 13:46:51,343 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:46:51,344 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 13:46:51,344 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:46:51,344 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-18 13:46:51,344 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-18 13:46:51,344 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-18 13:46:51,344 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 13:46:51,344 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 13:46:51,344 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 13:46:51,345 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 13:46:51,345 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:46:51,345 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:46:51,345 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:46:51,345 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 13:46:51,345 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 13:46:51,345 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 13:46:51,345 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:46:51,345 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 13:46:51,345 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-18 13:46:51,345 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 13:46:51,345 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 13:46:51,348 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_a4ff574c-84fc-4849-84e3-972e67726aa3/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 -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2018-11-18 13:46:51,375 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:46:51,382 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:46:51,384 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:46:51,385 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:46:51,386 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:46:51,386 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-18 13:46:51,420 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/data/713133486/407066d3ee3744c88ce629eb0401e6e4/FLAG0a7ee88ab [2018-11-18 13:46:51,778 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:46:51,779 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-18 13:46:51,785 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/data/713133486/407066d3ee3744c88ce629eb0401e6e4/FLAG0a7ee88ab [2018-11-18 13:46:52,180 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/data/713133486/407066d3ee3744c88ce629eb0401e6e4 [2018-11-18 13:46:52,183 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:46:52,183 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:46:52,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:46:52,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:46:52,187 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:46:52,188 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:46:52" (1/1) ... [2018-11-18 13:46:52,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2de647a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:52, skipping insertion in model container [2018-11-18 13:46:52,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:46:52" (1/1) ... [2018-11-18 13:46:52,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:46:52,225 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:46:52,430 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:46:52,439 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:46:52,475 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:46:52,502 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:46:52,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:52 WrapperNode [2018-11-18 13:46:52,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:46:52,503 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:46:52,503 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:46:52,503 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:46:52,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:52" (1/1) ... [2018-11-18 13:46:52,567 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:52" (1/1) ... [2018-11-18 13:46:52,573 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:46:52,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:46:52,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:46:52,574 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:46:52,580 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:52" (1/1) ... [2018-11-18 13:46:52,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:52" (1/1) ... [2018-11-18 13:46:52,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:52" (1/1) ... [2018-11-18 13:46:52,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:52" (1/1) ... [2018-11-18 13:46:52,591 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:52" (1/1) ... [2018-11-18 13:46:52,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:52" (1/1) ... [2018-11-18 13:46:52,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:52" (1/1) ... [2018-11-18 13:46:52,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:46:52,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:46:52,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:46:52,600 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:46:52,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 13:46:52,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 13:46:52,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 13:46:52,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 13:46:52,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 13:46:52,633 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 13:46:52,634 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 13:46:52,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 13:46:52,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 13:46:52,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 13:46:52,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 13:46:52,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:46:52,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:46:53,150 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:46:53,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:46:53 BoogieIcfgContainer [2018-11-18 13:46:53,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:46:53,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 13:46:53,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 13:46:53,154 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 13:46:53,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:46:52" (1/3) ... [2018-11-18 13:46:53,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a9c2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:46:53, skipping insertion in model container [2018-11-18 13:46:53,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:52" (2/3) ... [2018-11-18 13:46:53,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a9c2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:46:53, skipping insertion in model container [2018-11-18 13:46:53,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:46:53" (3/3) ... [2018-11-18 13:46:53,157 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-18 13:46:53,162 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 13:46:53,167 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-11-18 13:46:53,176 INFO L257 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2018-11-18 13:46:53,191 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 13:46:53,192 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 13:46:53,192 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-18 13:46:53,192 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 13:46:53,192 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:46:53,192 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:46:53,192 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 13:46:53,192 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:46:53,192 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 13:46:53,202 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2018-11-18 13:46:53,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 13:46:53,207 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:53,208 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:53,209 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION]=== [2018-11-18 13:46:53,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:53,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1716123279, now seen corresponding path program 1 times [2018-11-18 13:46:53,215 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:46:53,215 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:46:53,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:53,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:46:53,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 13:46:53,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:53,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:53,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 13:46:53,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:53,317 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 13:46:53,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:53,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:46:53,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:53,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:53,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:53,332 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 3 states. [2018-11-18 13:46:53,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:53,577 INFO L93 Difference]: Finished difference Result 180 states and 187 transitions. [2018-11-18 13:46:53,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:53,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-18 13:46:53,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:53,586 INFO L225 Difference]: With dead ends: 180 [2018-11-18 13:46:53,586 INFO L226 Difference]: Without dead ends: 176 [2018-11-18 13:46:53,587 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:53,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-18 13:46:53,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 151. [2018-11-18 13:46:53,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-18 13:46:53,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 156 transitions. [2018-11-18 13:46:53,618 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 156 transitions. Word has length 7 [2018-11-18 13:46:53,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:53,618 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 156 transitions. [2018-11-18 13:46:53,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:53,618 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 156 transitions. [2018-11-18 13:46:53,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 13:46:53,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:53,619 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:53,619 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION]=== [2018-11-18 13:46:53,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:53,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1716123280, now seen corresponding path program 1 times [2018-11-18 13:46:53,619 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:46:53,619 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:46:53,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:53,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:46:53,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 13:46:53,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:53,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:53,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 13:46:53,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:53,672 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 13:46:53,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:53,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:46:53,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:53,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:53,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:53,674 INFO L87 Difference]: Start difference. First operand 151 states and 156 transitions. Second operand 3 states. [2018-11-18 13:46:53,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:53,889 INFO L93 Difference]: Finished difference Result 148 states and 153 transitions. [2018-11-18 13:46:53,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:53,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-18 13:46:53,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:53,891 INFO L225 Difference]: With dead ends: 148 [2018-11-18 13:46:53,891 INFO L226 Difference]: Without dead ends: 148 [2018-11-18 13:46:53,892 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:53,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-18 13:46:53,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-11-18 13:46:53,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-18 13:46:53,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 153 transitions. [2018-11-18 13:46:53,903 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 153 transitions. Word has length 7 [2018-11-18 13:46:53,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:53,904 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 153 transitions. [2018-11-18 13:46:53,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:53,904 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 153 transitions. [2018-11-18 13:46:53,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 13:46:53,904 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:53,905 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:53,905 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION]=== [2018-11-18 13:46:53,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:53,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1405860397, now seen corresponding path program 1 times [2018-11-18 13:46:53,906 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:46:53,906 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:46:53,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:53,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:46:53,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 13:46:53,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:53,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:46:53,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-11-18 13:46:53,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:53,993 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 13:46:53,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:53,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:53,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 13:46:53,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:46:53,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:46:53,995 INFO L87 Difference]: Start difference. First operand 148 states and 153 transitions. Second operand 4 states. [2018-11-18 13:46:54,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:54,151 INFO L93 Difference]: Finished difference Result 148 states and 153 transitions. [2018-11-18 13:46:54,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:46:54,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-18 13:46:54,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:54,152 INFO L225 Difference]: With dead ends: 148 [2018-11-18 13:46:54,152 INFO L226 Difference]: Without dead ends: 148 [2018-11-18 13:46:54,152 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:46:54,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-18 13:46:54,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2018-11-18 13:46:54,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-18 13:46:54,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 151 transitions. [2018-11-18 13:46:54,158 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 151 transitions. Word has length 11 [2018-11-18 13:46:54,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:54,158 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 151 transitions. [2018-11-18 13:46:54,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 13:46:54,159 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 151 transitions. [2018-11-18 13:46:54,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 13:46:54,159 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:54,159 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:54,159 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION]=== [2018-11-18 13:46:54,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:54,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1405860396, now seen corresponding path program 1 times [2018-11-18 13:46:54,160 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:46:54,160 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:46:54,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:54,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:46:54,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 13:46:54,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:54,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:54,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 13:46:54,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:54,219 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 13:46:54,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:54,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:46:54,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:54,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:54,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:54,220 INFO L87 Difference]: Start difference. First operand 144 states and 151 transitions. Second operand 3 states. [2018-11-18 13:46:54,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:54,415 INFO L93 Difference]: Finished difference Result 157 states and 163 transitions. [2018-11-18 13:46:54,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:54,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-18 13:46:54,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:54,416 INFO L225 Difference]: With dead ends: 157 [2018-11-18 13:46:54,416 INFO L226 Difference]: Without dead ends: 157 [2018-11-18 13:46:54,416 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:54,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-18 13:46:54,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 148. [2018-11-18 13:46:54,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-18 13:46:54,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 155 transitions. [2018-11-18 13:46:54,423 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 155 transitions. Word has length 11 [2018-11-18 13:46:54,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:54,423 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 155 transitions. [2018-11-18 13:46:54,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:54,424 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 155 transitions. [2018-11-18 13:46:54,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 13:46:54,424 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:54,424 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:54,425 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION]=== [2018-11-18 13:46:54,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:54,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1236731835, now seen corresponding path program 1 times [2018-11-18 13:46:54,426 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:46:54,426 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:46:54,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:54,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:46:54,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 13:46:54,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:54,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:54,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 13:46:54,542 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:46:54,543 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:46:54,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-18 13:46:54,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:54,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:46:54,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2018-11-18 13:46:54,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:54,564 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 13:46:54,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:54,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:46:54,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:46:54,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:46:54,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:46:54,566 INFO L87 Difference]: Start difference. First operand 148 states and 155 transitions. Second operand 5 states. [2018-11-18 13:46:54,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:54,864 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2018-11-18 13:46:54,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:46:54,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-18 13:46:54,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:54,865 INFO L225 Difference]: With dead ends: 151 [2018-11-18 13:46:54,865 INFO L226 Difference]: Without dead ends: 151 [2018-11-18 13:46:54,865 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:46:54,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-18 13:46:54,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 136. [2018-11-18 13:46:54,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-18 13:46:54,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2018-11-18 13:46:54,869 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 17 [2018-11-18 13:46:54,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:54,870 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2018-11-18 13:46:54,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:46:54,870 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2018-11-18 13:46:54,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 13:46:54,870 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:54,870 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:54,871 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION]=== [2018-11-18 13:46:54,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:54,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1236731836, now seen corresponding path program 1 times [2018-11-18 13:46:54,871 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:46:54,871 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:46:54,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:54,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:46:54,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 13:46:54,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:54,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 13:46:54,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:54,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:54,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-18 13:46:54,979 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:46:54,980 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:46:54,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 13:46:54,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:54,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-18 13:46:54,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:55,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:46:55,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-11-18 13:46:55,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:55,018 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 13:46:55,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:55,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:46:55,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:46:55,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:46:55,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:46:55,020 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand 5 states. [2018-11-18 13:46:55,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:55,509 INFO L93 Difference]: Finished difference Result 167 states and 177 transitions. [2018-11-18 13:46:55,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:46:55,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-18 13:46:55,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:55,510 INFO L225 Difference]: With dead ends: 167 [2018-11-18 13:46:55,510 INFO L226 Difference]: Without dead ends: 167 [2018-11-18 13:46:55,511 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:46:55,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-18 13:46:55,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 145. [2018-11-18 13:46:55,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-18 13:46:55,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2018-11-18 13:46:55,515 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 17 [2018-11-18 13:46:55,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:55,515 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2018-11-18 13:46:55,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:46:55,516 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2018-11-18 13:46:55,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 13:46:55,516 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:55,516 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:55,517 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION]=== [2018-11-18 13:46:55,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:55,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1206647266, now seen corresponding path program 1 times [2018-11-18 13:46:55,517 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:46:55,517 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:46:55,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:55,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:46:55,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 13:46:55,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:55,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:55,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 13:46:55,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:46:55,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:46:55,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:55,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:55,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:55,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-11-18 13:46:55,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-18 13:46:55,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-18 13:46:55,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:55,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:55,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:55,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2018-11-18 13:46:55,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:55,640 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 13:46:55,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:55,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:46:55,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:46:55,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:46:55,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:46:55,643 INFO L87 Difference]: Start difference. First operand 145 states and 157 transitions. Second operand 5 states. [2018-11-18 13:46:55,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:55,972 INFO L93 Difference]: Finished difference Result 194 states and 210 transitions. [2018-11-18 13:46:55,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:46:55,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-18 13:46:55,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:55,973 INFO L225 Difference]: With dead ends: 194 [2018-11-18 13:46:55,973 INFO L226 Difference]: Without dead ends: 194 [2018-11-18 13:46:55,973 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:46:55,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-18 13:46:55,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 144. [2018-11-18 13:46:55,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-18 13:46:55,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2018-11-18 13:46:55,977 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 19 [2018-11-18 13:46:55,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:55,977 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2018-11-18 13:46:55,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:46:55,977 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2018-11-18 13:46:55,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 13:46:55,979 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:55,979 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:55,979 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION]=== [2018-11-18 13:46:55,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:55,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1206647265, now seen corresponding path program 1 times [2018-11-18 13:46:55,980 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:46:55,980 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:46:55,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:56,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:46:56,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 13:46:56,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:56,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:56,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 13:46:56,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:46:56,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:46:56,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:56,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:56,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:46:56,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:46:56,086 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:56,088 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:56,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:56,094 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-11-18 13:46:56,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 13:46:56,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 13:46:56,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:56,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:56,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-18 13:46:56,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-18 13:46:56,116 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:56,118 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:56,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:56,121 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-11-18 13:46:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:56,130 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 13:46:56,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:56,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:46:56,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:46:56,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:46:56,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:46:56,133 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand 5 states. [2018-11-18 13:46:56,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:56,545 INFO L93 Difference]: Finished difference Result 216 states and 233 transitions. [2018-11-18 13:46:56,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:46:56,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-18 13:46:56,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:56,546 INFO L225 Difference]: With dead ends: 216 [2018-11-18 13:46:56,546 INFO L226 Difference]: Without dead ends: 216 [2018-11-18 13:46:56,547 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-18 13:46:56,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-11-18 13:46:56,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 143. [2018-11-18 13:46:56,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-18 13:46:56,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2018-11-18 13:46:56,550 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 19 [2018-11-18 13:46:56,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:56,550 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2018-11-18 13:46:56,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:46:56,551 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2018-11-18 13:46:56,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 13:46:56,551 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:56,551 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:56,551 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION]=== [2018-11-18 13:46:56,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:56,551 INFO L82 PathProgramCache]: Analyzing trace with hash -464595168, now seen corresponding path program 1 times [2018-11-18 13:46:56,552 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:46:56,552 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:46:56,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:56,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:46:56,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 13:46:56,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:56,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:46:56,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-11-18 13:46:56,660 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:46:56,661 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:46:56,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-18 13:46:56,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:56,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:56,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-11-18 13:46:56,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:46:56,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:46:56,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:56,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:56,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:56,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-11-18 13:46:56,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-11-18 13:46:56,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-18 13:46:56,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:56,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:56,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:46:56,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-11-18 13:46:56,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-11-18 13:46:56,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-11-18 13:46:56,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:56,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 13:46:56,808 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:56,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:56,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:46:56,816 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-11-18 13:46:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:56,849 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 13:46:56,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:56,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 13:46:56,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 13:46:56,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 13:46:56,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-11-18 13:46:56,855 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand 11 states. [2018-11-18 13:46:57,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:57,707 INFO L93 Difference]: Finished difference Result 198 states and 212 transitions. [2018-11-18 13:46:57,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 13:46:57,707 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-11-18 13:46:57,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:57,708 INFO L225 Difference]: With dead ends: 198 [2018-11-18 13:46:57,708 INFO L226 Difference]: Without dead ends: 198 [2018-11-18 13:46:57,708 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2018-11-18 13:46:57,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-18 13:46:57,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 142. [2018-11-18 13:46:57,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-18 13:46:57,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2018-11-18 13:46:57,711 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 152 transitions. Word has length 23 [2018-11-18 13:46:57,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:57,712 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 152 transitions. [2018-11-18 13:46:57,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 13:46:57,712 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2018-11-18 13:46:57,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 13:46:57,712 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:57,712 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:57,713 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION]=== [2018-11-18 13:46:57,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:57,713 INFO L82 PathProgramCache]: Analyzing trace with hash -464595167, now seen corresponding path program 1 times [2018-11-18 13:46:57,713 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:46:57,713 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:46:57,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:57,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:46:57,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 13:46:57,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:57,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:57,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 13:46:57,838 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:46:57,840 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:46:57,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 13:46:57,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:57,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 13:46:57,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:57,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:57,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-11-18 13:46:57,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:46:57,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:46:57,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:57,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:57,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:46:57,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:46:57,902 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:57,904 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:57,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:57,913 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-11-18 13:46:57,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-11-18 13:46:57,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-18 13:46:57,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:57,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:58,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-18 13:46:58,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-18 13:46:58,032 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:58,041 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:58,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:46:58,056 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-11-18 13:46:58,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-18 13:46:58,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 13:46:58,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:58,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 13:46:58,118 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:58,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:58,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-11-18 13:46:58,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 13:46:58,140 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:58,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-18 13:46:58,152 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:58,155 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:58,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:58,160 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-11-18 13:46:58,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:58,186 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 13:46:58,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:58,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 13:46:58,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 13:46:58,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 13:46:58,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-18 13:46:58,189 INFO L87 Difference]: Start difference. First operand 142 states and 152 transitions. Second operand 10 states. [2018-11-18 13:46:59,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:59,222 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2018-11-18 13:46:59,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 13:46:59,223 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-18 13:46:59,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:59,224 INFO L225 Difference]: With dead ends: 170 [2018-11-18 13:46:59,224 INFO L226 Difference]: Without dead ends: 170 [2018-11-18 13:46:59,224 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2018-11-18 13:46:59,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-18 13:46:59,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 147. [2018-11-18 13:46:59,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-18 13:46:59,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2018-11-18 13:46:59,228 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 23 [2018-11-18 13:46:59,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:59,228 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2018-11-18 13:46:59,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 13:46:59,228 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2018-11-18 13:46:59,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 13:46:59,229 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:59,229 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:59,229 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION]=== [2018-11-18 13:46:59,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:59,230 INFO L82 PathProgramCache]: Analyzing trace with hash 525285157, now seen corresponding path program 1 times [2018-11-18 13:46:59,230 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:46:59,230 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:46:59,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:59,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:46:59,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 13:46:59,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:59,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:59,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 13:46:59,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:46:59,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:46:59,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:59,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:59,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:59,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-11-18 13:46:59,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-18 13:46:59,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-18 13:46:59,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:59,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:59,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:59,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-18 13:46:59,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:59,344 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 13:46:59,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:59,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:46:59,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:46:59,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:46:59,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:46:59,347 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand 5 states. [2018-11-18 13:46:59,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:59,729 INFO L93 Difference]: Finished difference Result 220 states and 237 transitions. [2018-11-18 13:46:59,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:46:59,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-18 13:46:59,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:59,730 INFO L225 Difference]: With dead ends: 220 [2018-11-18 13:46:59,730 INFO L226 Difference]: Without dead ends: 220 [2018-11-18 13:46:59,730 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:46:59,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-11-18 13:46:59,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 146. [2018-11-18 13:46:59,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-18 13:46:59,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2018-11-18 13:46:59,734 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 29 [2018-11-18 13:46:59,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:59,734 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2018-11-18 13:46:59,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:46:59,734 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2018-11-18 13:46:59,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 13:46:59,734 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:59,735 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:46:59,735 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION]=== [2018-11-18 13:46:59,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:59,735 INFO L82 PathProgramCache]: Analyzing trace with hash 525285158, now seen corresponding path program 1 times [2018-11-18 13:46:59,735 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:46:59,735 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:46:59,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:59,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:46:59,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 13:46:59,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:59,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:59,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 13:46:59,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:46:59,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:46:59,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:59,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:59,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:46:59,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:46:59,852 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:59,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:59,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:59,859 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-11-18 13:46:59,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 13:46:59,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 13:46:59,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:59,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:59,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-18 13:46:59,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-18 13:46:59,888 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:46:59,890 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:59,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:46:59,894 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-11-18 13:46:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:59,901 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 13:46:59,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:59,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:46:59,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:46:59,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:46:59,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:46:59,904 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. Second operand 5 states. [2018-11-18 13:47:00,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:47:00,328 INFO L93 Difference]: Finished difference Result 242 states and 261 transitions. [2018-11-18 13:47:00,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:47:00,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-18 13:47:00,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:47:00,329 INFO L225 Difference]: With dead ends: 242 [2018-11-18 13:47:00,329 INFO L226 Difference]: Without dead ends: 242 [2018-11-18 13:47:00,330 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-18 13:47:00,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-11-18 13:47:00,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 145. [2018-11-18 13:47:00,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-18 13:47:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2018-11-18 13:47:00,333 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 29 [2018-11-18 13:47:00,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:47:00,333 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2018-11-18 13:47:00,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:47:00,333 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2018-11-18 13:47:00,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 13:47:00,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:47:00,334 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:47:00,334 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION]=== [2018-11-18 13:47:00,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:47:00,334 INFO L82 PathProgramCache]: Analyzing trace with hash -753499553, now seen corresponding path program 1 times [2018-11-18 13:47:00,335 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:47:00,335 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:47:00,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:47:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:47:00,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:47:00,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:47:00,392 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 13:47:00,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:47:00,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:47:00,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:47:00,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:47:00,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:47:00,393 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand 3 states. [2018-11-18 13:47:00,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:47:00,530 INFO L93 Difference]: Finished difference Result 154 states and 164 transitions. [2018-11-18 13:47:00,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:47:00,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 13:47:00,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:47:00,531 INFO L225 Difference]: With dead ends: 154 [2018-11-18 13:47:00,531 INFO L226 Difference]: Without dead ends: 154 [2018-11-18 13:47:00,531 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:47:00,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-18 13:47:00,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 145. [2018-11-18 13:47:00,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-18 13:47:00,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2018-11-18 13:47:00,534 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 30 [2018-11-18 13:47:00,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:47:00,534 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2018-11-18 13:47:00,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:47:00,534 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2018-11-18 13:47:00,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 13:47:00,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:47:00,535 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:47:00,535 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION]=== [2018-11-18 13:47:00,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:47:00,536 INFO L82 PathProgramCache]: Analyzing trace with hash -709880978, now seen corresponding path program 1 times [2018-11-18 13:47:00,536 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:47:00,536 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:47:00,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:47:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:47:00,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:47:00,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:47:00,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:47:00,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:00,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:00,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:47:00,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:47:00,652 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:00,654 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:00,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:00,661 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-11-18 13:47:00,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-18 13:47:00,687 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:47:00,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 13:47:00,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:00,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:00,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-18 13:47:00,723 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:47:00,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 13:47:00,724 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:00,729 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:00,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:00,741 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-11-18 13:47:00,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-18 13:47:00,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-11-18 13:47:00,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:00,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:00,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-18 13:47:00,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-18 13:47:00,829 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:00,830 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:00,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:00,835 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:10 [2018-11-18 13:47:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:47:00,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:47:00,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:47:00,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:47:00,936 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:47:00,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:47:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:47:00,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:47:00,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:47:00,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:47:00,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:00,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:00,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:47:00,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:47:00,982 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:00,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:00,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:00,989 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-11-18 13:47:00,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-18 13:47:01,000 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:47:01,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 13:47:01,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:01,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:01,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-18 13:47:01,036 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:47:01,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 13:47:01,037 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:01,049 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:01,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:01,064 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-11-18 13:47:01,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-18 13:47:01,128 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:47:01,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-18 13:47:01,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:01,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:01,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-18 13:47:01,151 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:47:01,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-18 13:47:01,151 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:01,159 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:01,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:01,163 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-11-18 13:47:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:47:01,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:47:01,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:47:01,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 13:47:01,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7, 6] total 15 [2018-11-18 13:47:01,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 13:47:01,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 13:47:01,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-11-18 13:47:01,208 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand 15 states. [2018-11-18 13:47:02,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:47:02,067 INFO L93 Difference]: Finished difference Result 209 states and 222 transitions. [2018-11-18 13:47:02,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 13:47:02,067 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-11-18 13:47:02,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:47:02,068 INFO L225 Difference]: With dead ends: 209 [2018-11-18 13:47:02,068 INFO L226 Difference]: Without dead ends: 209 [2018-11-18 13:47:02,068 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2018-11-18 13:47:02,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-18 13:47:02,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 163. [2018-11-18 13:47:02,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-18 13:47:02,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 174 transitions. [2018-11-18 13:47:02,071 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 174 transitions. Word has length 33 [2018-11-18 13:47:02,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:47:02,072 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 174 transitions. [2018-11-18 13:47:02,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 13:47:02,072 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 174 transitions. [2018-11-18 13:47:02,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 13:47:02,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:47:02,073 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:47:02,073 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION]=== [2018-11-18 13:47:02,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:47:02,073 INFO L82 PathProgramCache]: Analyzing trace with hash -386282521, now seen corresponding path program 1 times [2018-11-18 13:47:02,073 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:47:02,073 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:47:02,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:47:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:47:02,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:47:02,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-18 13:47:02,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 13:47:02,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:02,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:02,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:02,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:7, output treesize:1 [2018-11-18 13:47:02,217 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:47:02,219 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:47:02,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-18 13:47:02,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:02,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:02,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-11-18 13:47:02,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:47:02,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:47:02,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:02,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:02,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:02,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:24 [2018-11-18 13:47:02,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-11-18 13:47:02,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-18 13:47:02,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:02,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:02,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:47:02,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-11-18 13:47:02,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-11-18 13:47:02,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 13:47:02,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:02,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-18 13:47:02,332 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:02,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:02,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:47:02,340 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:44, output treesize:16 [2018-11-18 13:47:02,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:47:02,365 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 13:47:02,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:47:02,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 13:47:02,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 13:47:02,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 13:47:02,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-18 13:47:02,372 INFO L87 Difference]: Start difference. First operand 163 states and 174 transitions. Second operand 9 states. [2018-11-18 13:47:03,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:47:03,049 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2018-11-18 13:47:03,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 13:47:03,049 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-18 13:47:03,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:47:03,050 INFO L225 Difference]: With dead ends: 169 [2018-11-18 13:47:03,050 INFO L226 Difference]: Without dead ends: 169 [2018-11-18 13:47:03,050 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2018-11-18 13:47:03,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-18 13:47:03,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 162. [2018-11-18 13:47:03,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-18 13:47:03,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2018-11-18 13:47:03,054 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 33 [2018-11-18 13:47:03,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:47:03,054 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2018-11-18 13:47:03,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 13:47:03,054 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2018-11-18 13:47:03,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 13:47:03,055 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:47:03,055 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:47:03,055 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION]=== [2018-11-18 13:47:03,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:47:03,056 INFO L82 PathProgramCache]: Analyzing trace with hash -386282520, now seen corresponding path program 1 times [2018-11-18 13:47:03,056 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:47:03,056 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:47:03,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:47:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:47:03,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:47:03,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 13:47:03,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 13:47:03,208 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:47:03,209 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:47:03,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-18 13:47:03,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-11-18 13:47:03,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:47:03,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:47:03,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-11-18 13:47:03,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-11-18 13:47:03,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-18 13:47:03,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:47:03,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-11-18 13:47:03,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-11-18 13:47:03,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 13:47:03,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-11-18 13:47:03,335 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:47:03,346 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-11-18 13:47:03,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 13:47:03,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,391 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:47:03,392 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 13:47:03,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-18 13:47:03,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:13 [2018-11-18 13:47:03,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:47:03,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:47:03,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 13:47:03,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 13:47:03,439 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,441 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,448 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-11-18 13:47:03,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-18 13:47:03,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-18 13:47:03,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2018-11-18 13:47:03,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-18 13:47:03,555 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,570 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:47:03,583 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-11-18 13:47:03,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-18 13:47:03,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 13:47:03,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 13:47:03,639 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-11-18 13:47:03,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-18 13:47:03,661 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 13:47:03,670 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,674 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:03,678 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-11-18 13:47:03,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:47:03,716 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 13:47:03,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:47:03,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-18 13:47:03,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 13:47:03,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 13:47:03,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-18 13:47:03,718 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand 16 states. [2018-11-18 13:47:05,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:47:05,460 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2018-11-18 13:47:05,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-18 13:47:05,460 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-11-18 13:47:05,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:47:05,461 INFO L225 Difference]: With dead ends: 175 [2018-11-18 13:47:05,461 INFO L226 Difference]: Without dead ends: 175 [2018-11-18 13:47:05,462 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=318, Invalid=1088, Unknown=0, NotChecked=0, Total=1406 [2018-11-18 13:47:05,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-18 13:47:05,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 137. [2018-11-18 13:47:05,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-18 13:47:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 147 transitions. [2018-11-18 13:47:05,466 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 147 transitions. Word has length 33 [2018-11-18 13:47:05,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:47:05,466 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 147 transitions. [2018-11-18 13:47:05,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 13:47:05,466 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 147 transitions. [2018-11-18 13:47:05,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 13:47:05,467 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:47:05,467 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:47:05,467 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION]=== [2018-11-18 13:47:05,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:47:05,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1222271182, now seen corresponding path program 1 times [2018-11-18 13:47:05,467 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:47:05,468 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:47:05,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:47:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:47:05,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:47:05,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-18 13:47:05,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-18 13:47:05,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:05,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:05,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:05,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-18 13:47:05,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:47:05,531 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 13:47:05,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:47:05,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:47:05,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:47:05,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:47:05,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:47:05,533 INFO L87 Difference]: Start difference. First operand 137 states and 147 transitions. Second operand 5 states. [2018-11-18 13:47:05,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:47:05,748 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2018-11-18 13:47:05,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:47:05,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-18 13:47:05,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:47:05,749 INFO L225 Difference]: With dead ends: 143 [2018-11-18 13:47:05,749 INFO L226 Difference]: Without dead ends: 143 [2018-11-18 13:47:05,749 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:47:05,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-18 13:47:05,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 136. [2018-11-18 13:47:05,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-18 13:47:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 144 transitions. [2018-11-18 13:47:05,751 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 144 transitions. Word has length 35 [2018-11-18 13:47:05,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:47:05,751 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 144 transitions. [2018-11-18 13:47:05,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:47:05,751 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2018-11-18 13:47:05,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 13:47:05,751 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:47:05,751 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:47:05,752 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION]=== [2018-11-18 13:47:05,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:47:05,752 INFO L82 PathProgramCache]: Analyzing trace with hash 354917977, now seen corresponding path program 1 times [2018-11-18 13:47:05,752 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:47:05,752 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:47:05,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:47:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:47:05,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:47:05,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 13:47:05,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:05,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:05,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 13:47:05,828 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:47:05,828 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:47:05,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 13:47:05,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:05,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:05,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-18 13:47:05,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-18 13:47:05,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 13:47:05,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:05,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:05,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:05,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:12, output treesize:4 [2018-11-18 13:47:05,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:47:05,840 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 13:47:05,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:47:05,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:47:05,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 13:47:05,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:47:05,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:47:05,842 INFO L87 Difference]: Start difference. First operand 136 states and 144 transitions. Second operand 4 states. [2018-11-18 13:47:05,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:47:05,993 INFO L93 Difference]: Finished difference Result 166 states and 174 transitions. [2018-11-18 13:47:05,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:47:05,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-18 13:47:05,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:47:05,995 INFO L225 Difference]: With dead ends: 166 [2018-11-18 13:47:05,995 INFO L226 Difference]: Without dead ends: 166 [2018-11-18 13:47:05,995 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:47:05,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-18 13:47:05,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 136. [2018-11-18 13:47:05,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-18 13:47:05,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 143 transitions. [2018-11-18 13:47:05,999 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 143 transitions. Word has length 36 [2018-11-18 13:47:05,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:47:05,999 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 143 transitions. [2018-11-18 13:47:05,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 13:47:05,999 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 143 transitions. [2018-11-18 13:47:05,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-18 13:47:05,999 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:47:05,999 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:47:06,000 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION]=== [2018-11-18 13:47:06,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:47:06,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1997400177, now seen corresponding path program 1 times [2018-11-18 13:47:06,000 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:47:06,000 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:47:06,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:47:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:47:06,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:47:06,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 13:47:06,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 13:47:06,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:06,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:06,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:06,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-18 13:47:06,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-18 13:47:06,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-18 13:47:06,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:06,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:06,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:06,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-18 13:47:06,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:47:06,101 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 13:47:06,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:47:06,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:47:06,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 13:47:06,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:47:06,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:47:06,103 INFO L87 Difference]: Start difference. First operand 136 states and 143 transitions. Second operand 4 states. [2018-11-18 13:47:06,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:47:06,240 INFO L93 Difference]: Finished difference Result 201 states and 212 transitions. [2018-11-18 13:47:06,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:47:06,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-11-18 13:47:06,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:47:06,242 INFO L225 Difference]: With dead ends: 201 [2018-11-18 13:47:06,242 INFO L226 Difference]: Without dead ends: 201 [2018-11-18 13:47:06,242 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:47:06,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-18 13:47:06,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 190. [2018-11-18 13:47:06,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-11-18 13:47:06,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 207 transitions. [2018-11-18 13:47:06,245 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 207 transitions. Word has length 41 [2018-11-18 13:47:06,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:47:06,245 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 207 transitions. [2018-11-18 13:47:06,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 13:47:06,246 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 207 transitions. [2018-11-18 13:47:06,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 13:47:06,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:47:06,247 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:47:06,247 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION]=== [2018-11-18 13:47:06,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:47:06,247 INFO L82 PathProgramCache]: Analyzing trace with hash 284672331, now seen corresponding path program 1 times [2018-11-18 13:47:06,247 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:47:06,247 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:47:06,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:47:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:47:06,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:47:06,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 13:47:06,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 13:47:06,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:06,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:06,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 13:47:06,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 13:47:06,367 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:06,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:06,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:06,379 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-11-18 13:47:06,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-18 13:47:06,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-18 13:47:06,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:06,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:06,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-18 13:47:06,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-18 13:47:06,521 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:06,523 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:06,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:06,529 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-11-18 13:47:06,599 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:47:06,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:47:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:47:06,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:47:06,757 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:47:06,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:47:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:47:06,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:47:06,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 13:47:06,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 13:47:06,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:06,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:06,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 13:47:06,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 13:47:06,822 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:06,826 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:06,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:06,837 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-11-18 13:47:07,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-18 13:47:07,060 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:47:07,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-18 13:47:07,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:07,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:07,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-18 13:47:07,082 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:47:07,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-18 13:47:07,083 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:47:07,086 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:07,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:47:07,090 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-11-18 13:47:07,094 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:47:07,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:47:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:47:07,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 13:47:07,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10, 9] total 20 [2018-11-18 13:47:07,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 13:47:07,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 13:47:07,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2018-11-18 13:47:07,133 INFO L87 Difference]: Start difference. First operand 190 states and 207 transitions. Second operand 20 states. [2018-11-18 13:47:08,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:47:08,381 INFO L93 Difference]: Finished difference Result 250 states and 270 transitions. [2018-11-18 13:47:08,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 13:47:08,382 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2018-11-18 13:47:08,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:47:08,382 INFO L225 Difference]: With dead ends: 250 [2018-11-18 13:47:08,383 INFO L226 Difference]: Without dead ends: 250 [2018-11-18 13:47:08,383 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 153 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=246, Invalid=876, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 13:47:08,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-18 13:47:08,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 210. [2018-11-18 13:47:08,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-18 13:47:08,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 230 transitions. [2018-11-18 13:47:08,386 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 230 transitions. Word has length 43 [2018-11-18 13:47:08,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:47:08,386 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 230 transitions. [2018-11-18 13:47:08,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 13:47:08,386 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 230 transitions. [2018-11-18 13:47:08,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 13:47:08,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:47:08,387 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:47:08,387 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr53REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION]=== [2018-11-18 13:47:08,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:47:08,387 INFO L82 PathProgramCache]: Analyzing trace with hash 234907131, now seen corresponding path program 1 times [2018-11-18 13:47:08,388 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:47:08,388 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4ff574c-84fc-4849-84e3-972e67726aa3/bin-2019/utaipan/cvc4nyu Starting monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:47:08,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:47:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:47:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:47:08,627 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 13:47:08,643 WARN L387 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-11-18 13:47:08,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 01:47:08 BoogieIcfgContainer [2018-11-18 13:47:08,663 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 13:47:08,664 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:47:08,664 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:47:08,664 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:47:08,664 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:46:53" (3/4) ... [2018-11-18 13:47:08,666 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 13:47:08,666 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:47:08,667 INFO L168 Benchmark]: Toolchain (without parser) took 16483.59 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.8 MB). Free memory was 946.5 MB in the beginning and 1.2 GB in the end (delta: -212.3 MB). Peak memory consumption was 106.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:47:08,667 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:47:08,667 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.35 ms. Allocated memory is still 1.0 GB. Free memory was 946.5 MB in the beginning and 925.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-18 13:47:08,667 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 925.0 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:47:08,668 INFO L168 Benchmark]: Boogie Preprocessor took 25.36 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:47:08,668 INFO L168 Benchmark]: RCFGBuilder took 551.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. [2018-11-18 13:47:08,668 INFO L168 Benchmark]: TraceAbstraction took 15512.31 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 209.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -108.2 MB). Peak memory consumption was 101.5 MB. Max. memory is 11.5 GB. [2018-11-18 13:47:08,668 INFO L168 Benchmark]: Witness Printer took 2.62 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:47:08,669 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 318.35 ms. Allocated memory is still 1.0 GB. Free memory was 946.5 MB in the beginning and 925.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 925.0 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.36 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 551.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15512.31 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 209.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -108.2 MB). Peak memory consumption was 101.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.62 ms. Allocated memory is still 1.3 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: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 985. Possible FailurePath: [L987] EXPR, FCALL malloc(sizeof(struct TSLL)) [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L988] FCALL null->next = ((void*)0) VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L989] FCALL null->prev = ((void*)0) VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L990] FCALL null->colour = BLACK VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L992] EXPR, FCALL malloc(sizeof(struct TSLL)) [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L993] FCALL list->next = null VAL [list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L994] FCALL list->prev = null VAL [list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L995] FCALL list->colour = BLACK VAL [list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L997] struct TSLL* end = list; VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1030] COND FALSE !(0) VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1031] EXPR, FCALL end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1031] COND FALSE !(0) VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1032] COND TRUE null != end VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1034] EXPR, FCALL end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR, FCALL end->next VAL [end={-2:0}, end->next={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1041] end = end->next [L1032] COND FALSE !(null != end) VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1045] COND TRUE null != list VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1047] EXPR, FCALL list->colour VAL [end={1:0}, list={-2:0}, list->colour=1, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1047] COND FALSE !(RED == list->colour) [L1056] EXPR, FCALL list->next VAL [end={1:0}, list={-2:0}, list->next={1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1056] end = list->next [L1057] free(list) VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1057] free(list) [L1057] FCALL free(list) [L1058] list = end VAL [end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1045] COND FALSE !(null != list) VAL [end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1062] return 0; VAL [\result=0, end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 157 locations, 67 error locations. UNSAFE Result, 15.4s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 10.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1896 SDtfs, 3351 SDslu, 3590 SDs, 0 SdLazy, 4819 SolverSat, 292 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 792 GetRequests, 598 SyntacticMatches, 7 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210occurred in iteration=20, 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, 20 MinimizatonAttempts, 636 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 616 NumberOfCodeBlocks, 616 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 698 ConstructedInterpolants, 25 QuantifiedInterpolants, 233022 SizeOfPredicates, 163 NumberOfNonLiveVariables, 2278 ConjunctsInSsa, 204 ConjunctsInUnsatCore, 26 InterpolantComputations, 18 PerfectInterpolantSequences, 12/36 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...