./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4f897414-dff1-49d7-8961-f85ec58979b7/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4f897414-dff1-49d7-8961-f85ec58979b7/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4f897414-dff1-49d7-8961-f85ec58979b7/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4f897414-dff1-49d7-8961-f85ec58979b7/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4f897414-dff1-49d7-8961-f85ec58979b7/bin-2019/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4f897414-dff1-49d7-8961-f85ec58979b7/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-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a74485b04ec8988328f8bc8f67ebe898d81e7141 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 15:34:18,200 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 15:34:18,201 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 15:34:18,207 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 15:34:18,207 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 15:34:18,208 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 15:34:18,209 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 15:34:18,209 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 15:34:18,210 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 15:34:18,211 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 15:34:18,211 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 15:34:18,211 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 15:34:18,212 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 15:34:18,212 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 15:34:18,213 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 15:34:18,213 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 15:34:18,214 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 15:34:18,215 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 15:34:18,215 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 15:34:18,216 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 15:34:18,217 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 15:34:18,217 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 15:34:18,219 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 15:34:18,219 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 15:34:18,219 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 15:34:18,219 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 15:34:18,220 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 15:34:18,220 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 15:34:18,221 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 15:34:18,221 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 15:34:18,222 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 15:34:18,222 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 15:34:18,222 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 15:34:18,222 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 15:34:18,223 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 15:34:18,223 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 15:34:18,223 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4f897414-dff1-49d7-8961-f85ec58979b7/bin-2019/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2018-12-02 15:34:18,231 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 15:34:18,231 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 15:34:18,232 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 15:34:18,232 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 15:34:18,232 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 15:34:18,232 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 15:34:18,232 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 15:34:18,232 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 15:34:18,232 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 15:34:18,233 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 15:34:18,233 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 15:34:18,233 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 15:34:18,233 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 15:34:18,233 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 15:34:18,233 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 15:34:18,234 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 15:34:18,234 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 15:34:18,234 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 15:34:18,234 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 15:34:18,234 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 15:34:18,234 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 15:34:18,234 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 15:34:18,234 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 15:34:18,235 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 15:34:18,235 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 15:34:18,235 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 15:34:18,235 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 15:34:18,235 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 15:34:18,235 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 15:34:18,235 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 15:34:18,235 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 15:34:18,236 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 15:34:18,236 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 15:34:18,236 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 15:34:18,236 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 15:34:18,236 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_4f897414-dff1-49d7-8961-f85ec58979b7/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-memcleanup) ) 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 -> a74485b04ec8988328f8bc8f67ebe898d81e7141 [2018-12-02 15:34:18,253 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 15:34:18,260 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 15:34:18,262 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 15:34:18,263 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 15:34:18,263 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 15:34:18,264 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4f897414-dff1-49d7-8961-f85ec58979b7/bin-2019/utaipan/../../sv-benchmarks/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i [2018-12-02 15:34:18,299 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f897414-dff1-49d7-8961-f85ec58979b7/bin-2019/utaipan/data/9572b7303/8f870284c70d411486aa2983cf0e5e17/FLAG821f8f635 [2018-12-02 15:34:18,661 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 15:34:18,661 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4f897414-dff1-49d7-8961-f85ec58979b7/sv-benchmarks/c/list-properties/alternating_list_false-unreach-call_false-valid-memcleanup.i [2018-12-02 15:34:18,667 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f897414-dff1-49d7-8961-f85ec58979b7/bin-2019/utaipan/data/9572b7303/8f870284c70d411486aa2983cf0e5e17/FLAG821f8f635 [2018-12-02 15:34:19,035 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4f897414-dff1-49d7-8961-f85ec58979b7/bin-2019/utaipan/data/9572b7303/8f870284c70d411486aa2983cf0e5e17 [2018-12-02 15:34:19,038 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 15:34:19,040 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 15:34:19,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 15:34:19,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 15:34:19,045 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 15:34:19,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:34:19" (1/1) ... [2018-12-02 15:34:19,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@523e2e99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:19, skipping insertion in model container [2018-12-02 15:34:19,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:34:19" (1/1) ... [2018-12-02 15:34:19,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 15:34:19,070 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 15:34:19,208 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:34:19,214 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 15:34:19,268 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:34:19,291 INFO L195 MainTranslator]: Completed translation [2018-12-02 15:34:19,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:19 WrapperNode [2018-12-02 15:34:19,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 15:34:19,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 15:34:19,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 15:34:19,292 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 15:34:19,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:19" (1/1) ... [2018-12-02 15:34:19,305 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:19" (1/1) ... [2018-12-02 15:34:19,309 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 15:34:19,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 15:34:19,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 15:34:19,309 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 15:34:19,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:19" (1/1) ... [2018-12-02 15:34:19,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:19" (1/1) ... [2018-12-02 15:34:19,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:19" (1/1) ... [2018-12-02 15:34:19,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:19" (1/1) ... [2018-12-02 15:34:19,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:19" (1/1) ... [2018-12-02 15:34:19,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:19" (1/1) ... [2018-12-02 15:34:19,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:19" (1/1) ... [2018-12-02 15:34:19,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 15:34:19,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 15:34:19,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 15:34:19,327 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 15:34:19,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f897414-dff1-49d7-8961-f85ec58979b7/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 15:34:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-02 15:34:19,357 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-02 15:34:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 15:34:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 15:34:19,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 15:34:19,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 15:34:19,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 15:34:19,358 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 15:34:19,358 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 15:34:19,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 15:34:19,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 15:34:19,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 15:34:19,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 15:34:19,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 15:34:19,558 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 15:34:19,558 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-02 15:34:19,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:34:19 BoogieIcfgContainer [2018-12-02 15:34:19,559 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 15:34:19,559 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 15:34:19,559 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 15:34:19,562 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 15:34:19,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:34:19" (1/3) ... [2018-12-02 15:34:19,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc19a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:34:19, skipping insertion in model container [2018-12-02 15:34:19,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:19" (2/3) ... [2018-12-02 15:34:19,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc19a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:34:19, skipping insertion in model container [2018-12-02 15:34:19,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:34:19" (3/3) ... [2018-12-02 15:34:19,564 INFO L112 eAbstractionObserver]: Analyzing ICFG alternating_list_false-unreach-call_false-valid-memcleanup.i [2018-12-02 15:34:19,570 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 15:34:19,574 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-12-02 15:34:19,583 INFO L257 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2018-12-02 15:34:19,603 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 15:34:19,603 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 15:34:19,603 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 15:34:19,603 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 15:34:19,603 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 15:34:19,603 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 15:34:19,603 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 15:34:19,603 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 15:34:19,612 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-12-02 15:34:19,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 15:34:19,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:34:19,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:34:19,619 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION]=== [2018-12-02 15:34:19,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:34:19,622 INFO L82 PathProgramCache]: Analyzing trace with hash 703952005, now seen corresponding path program 1 times [2018-12-02 15:34:19,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:34:19,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:19,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:34:19,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:19,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:34:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:34:19,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:34:19,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:34:19,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 15:34:19,696 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:34:19,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 15:34:19,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 15:34:19,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 15:34:19,708 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-12-02 15:34:19,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:34:19,719 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2018-12-02 15:34:19,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 15:34:19,720 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-02 15:34:19,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:34:19,725 INFO L225 Difference]: With dead ends: 76 [2018-12-02 15:34:19,725 INFO L226 Difference]: Without dead ends: 68 [2018-12-02 15:34:19,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 15:34:19,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-02 15:34:19,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-02 15:34:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-02 15:34:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-12-02 15:34:19,748 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 10 [2018-12-02 15:34:19,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:34:19,748 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-12-02 15:34:19,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 15:34:19,748 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-12-02 15:34:19,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 15:34:19,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:34:19,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:34:19,749 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION]=== [2018-12-02 15:34:19,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:34:19,749 INFO L82 PathProgramCache]: Analyzing trace with hash 347640025, now seen corresponding path program 1 times [2018-12-02 15:34:19,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:34:19,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:19,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:34:19,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:19,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:34:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:34:19,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:34:19,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:34:19,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:34:19,791 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:34:19,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 15:34:19,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:34:19,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:34:19,793 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 4 states. [2018-12-02 15:34:19,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:34:19,892 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-12-02 15:34:19,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 15:34:19,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-02 15:34:19,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:34:19,893 INFO L225 Difference]: With dead ends: 85 [2018-12-02 15:34:19,893 INFO L226 Difference]: Without dead ends: 85 [2018-12-02 15:34:19,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-02 15:34:19,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-02 15:34:19,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2018-12-02 15:34:19,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-02 15:34:19,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2018-12-02 15:34:19,899 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 11 [2018-12-02 15:34:19,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:34:19,900 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2018-12-02 15:34:19,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 15:34:19,900 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-12-02 15:34:19,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 15:34:19,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:34:19,900 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:34:19,901 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION]=== [2018-12-02 15:34:19,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:34:19,901 INFO L82 PathProgramCache]: Analyzing trace with hash 347640026, now seen corresponding path program 1 times [2018-12-02 15:34:19,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:34:19,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:19,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:34:19,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:19,902 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:34:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:34:19,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:34:19,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:34:19,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:34:19,939 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:34:19,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 15:34:19,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:34:19,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:34:19,939 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 4 states. [2018-12-02 15:34:20,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:34:20,032 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-12-02 15:34:20,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 15:34:20,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-02 15:34:20,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:34:20,033 INFO L225 Difference]: With dead ends: 93 [2018-12-02 15:34:20,033 INFO L226 Difference]: Without dead ends: 93 [2018-12-02 15:34:20,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-02 15:34:20,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-02 15:34:20,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2018-12-02 15:34:20,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-02 15:34:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2018-12-02 15:34:20,036 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 11 [2018-12-02 15:34:20,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:34:20,036 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2018-12-02 15:34:20,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 15:34:20,037 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2018-12-02 15:34:20,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 15:34:20,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:34:20,037 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:34:20,037 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION]=== [2018-12-02 15:34:20,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:34:20,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1047491972, now seen corresponding path program 1 times [2018-12-02 15:34:20,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:34:20,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:20,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:34:20,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:20,038 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:34:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:34:20,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:34:20,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:34:20,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 15:34:20,079 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:34:20,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:34:20,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:34:20,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:34:20,080 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 5 states. [2018-12-02 15:34:20,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:34:20,164 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2018-12-02 15:34:20,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 15:34:20,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-02 15:34:20,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:34:20,165 INFO L225 Difference]: With dead ends: 122 [2018-12-02 15:34:20,165 INFO L226 Difference]: Without dead ends: 119 [2018-12-02 15:34:20,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-12-02 15:34:20,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-02 15:34:20,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 106. [2018-12-02 15:34:20,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-02 15:34:20,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2018-12-02 15:34:20,173 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 20 [2018-12-02 15:34:20,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:34:20,173 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2018-12-02 15:34:20,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:34:20,173 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2018-12-02 15:34:20,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 15:34:20,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:34:20,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:34:20,174 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION]=== [2018-12-02 15:34:20,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:34:20,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1047539668, now seen corresponding path program 1 times [2018-12-02 15:34:20,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:34:20,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:20,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:34:20,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:20,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:34:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:34:20,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-12-02 15:34:20,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:34:20,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 15:34:20,211 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:34:20,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:34:20,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:34:20,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:34:20,212 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand 5 states. [2018-12-02 15:34:20,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:34:20,270 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2018-12-02 15:34:20,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 15:34:20,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-02 15:34:20,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:34:20,271 INFO L225 Difference]: With dead ends: 116 [2018-12-02 15:34:20,271 INFO L226 Difference]: Without dead ends: 116 [2018-12-02 15:34:20,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 15:34:20,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-02 15:34:20,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2018-12-02 15:34:20,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-02 15:34:20,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2018-12-02 15:34:20,275 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 20 [2018-12-02 15:34:20,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:34:20,276 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2018-12-02 15:34:20,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:34:20,276 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2018-12-02 15:34:20,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 15:34:20,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:34:20,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:34:20,276 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION]=== [2018-12-02 15:34:20,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:34:20,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1979155278, now seen corresponding path program 1 times [2018-12-02 15:34:20,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:34:20,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:20,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:34:20,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:20,277 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:34:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:34:20,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:34:20,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:34:20,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:34:20,291 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:34:20,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:34:20,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:34:20,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:34:20,292 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand 3 states. [2018-12-02 15:34:20,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:34:20,299 INFO L93 Difference]: Finished difference Result 159 states and 181 transitions. [2018-12-02 15:34:20,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:34:20,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-02 15:34:20,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:34:20,300 INFO L225 Difference]: With dead ends: 159 [2018-12-02 15:34:20,300 INFO L226 Difference]: Without dead ends: 159 [2018-12-02 15:34:20,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:34:20,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-02 15:34:20,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 120. [2018-12-02 15:34:20,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-02 15:34:20,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2018-12-02 15:34:20,305 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 20 [2018-12-02 15:34:20,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:34:20,305 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2018-12-02 15:34:20,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:34:20,306 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2018-12-02 15:34:20,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 15:34:20,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:34:20,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:34:20,306 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION]=== [2018-12-02 15:34:20,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:34:20,306 INFO L82 PathProgramCache]: Analyzing trace with hash 2019987388, now seen corresponding path program 1 times [2018-12-02 15:34:20,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:34:20,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:20,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:34:20,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:20,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:34:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:34:20,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:34:20,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:34:20,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 15:34:20,338 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:34:20,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 15:34:20,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:34:20,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:34:20,339 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand 6 states. [2018-12-02 15:34:20,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:34:20,441 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2018-12-02 15:34:20,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 15:34:20,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-02 15:34:20,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:34:20,442 INFO L225 Difference]: With dead ends: 127 [2018-12-02 15:34:20,442 INFO L226 Difference]: Without dead ends: 127 [2018-12-02 15:34:20,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 15:34:20,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-02 15:34:20,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 102. [2018-12-02 15:34:20,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-02 15:34:20,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2018-12-02 15:34:20,446 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 20 [2018-12-02 15:34:20,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:34:20,446 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2018-12-02 15:34:20,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 15:34:20,446 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2018-12-02 15:34:20,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 15:34:20,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:34:20,447 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:34:20,447 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION]=== [2018-12-02 15:34:20,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:34:20,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1886008504, now seen corresponding path program 1 times [2018-12-02 15:34:20,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:34:20,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:20,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:34:20,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:20,448 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:34:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:34:20,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:34:20,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:34:20,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:34:20,486 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:34:20,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 15:34:20,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:34:20,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:34:20,486 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand 6 states. [2018-12-02 15:34:20,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:34:20,582 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2018-12-02 15:34:20,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 15:34:20,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-02 15:34:20,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:34:20,583 INFO L225 Difference]: With dead ends: 108 [2018-12-02 15:34:20,583 INFO L226 Difference]: Without dead ends: 108 [2018-12-02 15:34:20,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-12-02 15:34:20,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-02 15:34:20,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 101. [2018-12-02 15:34:20,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-02 15:34:20,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2018-12-02 15:34:20,586 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 21 [2018-12-02 15:34:20,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:34:20,587 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2018-12-02 15:34:20,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 15:34:20,587 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2018-12-02 15:34:20,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 15:34:20,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:34:20,587 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:34:20,588 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION]=== [2018-12-02 15:34:20,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:34:20,588 INFO L82 PathProgramCache]: Analyzing trace with hash 744049830, now seen corresponding path program 1 times [2018-12-02 15:34:20,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:34:20,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:20,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:34:20,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:20,589 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:34:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:34:20,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:34:20,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:34:20,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:34:20,615 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:34:20,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 15:34:20,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:34:20,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:34:20,616 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 6 states. [2018-12-02 15:34:20,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:34:20,727 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2018-12-02 15:34:20,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 15:34:20,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-02 15:34:20,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:34:20,728 INFO L225 Difference]: With dead ends: 103 [2018-12-02 15:34:20,728 INFO L226 Difference]: Without dead ends: 103 [2018-12-02 15:34:20,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 15:34:20,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-02 15:34:20,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2018-12-02 15:34:20,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-02 15:34:20,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2018-12-02 15:34:20,731 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 21 [2018-12-02 15:34:20,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:34:20,731 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2018-12-02 15:34:20,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 15:34:20,732 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2018-12-02 15:34:20,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 15:34:20,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:34:20,732 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:34:20,732 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION]=== [2018-12-02 15:34:20,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:34:20,732 INFO L82 PathProgramCache]: Analyzing trace with hash 744049831, now seen corresponding path program 1 times [2018-12-02 15:34:20,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:34:20,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:20,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:34:20,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:20,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:34:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:34:20,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:34:20,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:34:20,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:34:20,794 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:34:20,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 15:34:20,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:34:20,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:34:20,794 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 6 states. [2018-12-02 15:34:20,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:34:20,923 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2018-12-02 15:34:20,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 15:34:20,923 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-02 15:34:20,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:34:20,923 INFO L225 Difference]: With dead ends: 112 [2018-12-02 15:34:20,924 INFO L226 Difference]: Without dead ends: 112 [2018-12-02 15:34:20,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-02 15:34:20,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-02 15:34:20,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 86. [2018-12-02 15:34:20,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-02 15:34:20,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2018-12-02 15:34:20,926 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 21 [2018-12-02 15:34:20,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:34:20,926 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2018-12-02 15:34:20,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 15:34:20,926 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2018-12-02 15:34:20,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 15:34:20,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:34:20,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:34:20,927 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION]=== [2018-12-02 15:34:20,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:34:20,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1663278663, now seen corresponding path program 1 times [2018-12-02 15:34:20,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:34:20,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:20,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:34:20,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:20,928 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:34:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:34:20,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:34:20,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:34:20,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 15:34:20,971 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 15:34:20,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 15:34:20,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 15:34:20,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:34:20,972 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 7 states. [2018-12-02 15:34:21,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:34:21,075 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-12-02 15:34:21,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 15:34:21,075 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-12-02 15:34:21,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:34:21,075 INFO L225 Difference]: With dead ends: 105 [2018-12-02 15:34:21,075 INFO L226 Difference]: Without dead ends: 98 [2018-12-02 15:34:21,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-12-02 15:34:21,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-02 15:34:21,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 82. [2018-12-02 15:34:21,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-02 15:34:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-12-02 15:34:21,077 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 22 [2018-12-02 15:34:21,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:34:21,077 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-12-02 15:34:21,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 15:34:21,078 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-12-02 15:34:21,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 15:34:21,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:34:21,078 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:34:21,078 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION]=== [2018-12-02 15:34:21,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:34:21,078 INFO L82 PathProgramCache]: Analyzing trace with hash -12537769, now seen corresponding path program 1 times [2018-12-02 15:34:21,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:34:21,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:21,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:34:21,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:21,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:34:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:34:21,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:34:21,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:34:21,180 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 15:34:21,180 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-02 15:34:21,182 INFO L205 CegarAbsIntRunner]: [0], [1], [10], [16], [18], [23], [26], [28], [31], [32], [35], [43], [49], [51], [54], [57], [61], [64], [69], [74], [106], [111], [116], [131], [133], [136], [137], [138], [139] [2018-12-02 15:34:21,201 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 15:34:21,201 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 15:34:21,308 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 15:34:21,309 INFO L272 AbstractInterpreter]: Visited 29 different actions 35 times. Merged at 5 different actions 5 times. Never widened. Performed 233 root evaluator evaluations with a maximum evaluation depth of 3. Performed 233 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 31 variables. [2018-12-02 15:34:21,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:34:21,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 15:34:21,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:34:21,317 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f897414-dff1-49d7-8961-f85ec58979b7/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:34:21,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:34:21,323 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 15:34:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:34:21,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:34:21,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 15:34:21,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:21,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:21,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 15:34:21,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 15:34:21,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 15:34:21,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:21,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:21,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:21,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2018-12-02 15:34:21,425 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:34:21,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:34:21,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:34:21,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:21,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:21,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-12-02 15:34:21,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 15:34:21,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 15:34:21,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:21,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:21,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-12-02 15:34:21,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:34:21,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-02 15:34:21,481 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:21,484 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:21,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:21,490 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2018-12-02 15:34:21,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 15:34:21,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-02 15:34:21,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:21,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:21,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:21,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2018-12-02 15:34:21,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-02 15:34:21,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 15:34:21,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:21,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:21,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 15:34:21,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-12-02 15:34:21,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-02 15:34:21,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 15:34:21,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:21,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 15:34:21,591 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:21,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:21,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:21,595 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-12-02 15:34:21,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:34:21,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:34:21,725 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:34:21,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:34:21,728 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:21,736 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:21,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 15:34:21,741 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:23 [2018-12-02 15:34:21,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-12-02 15:34:21,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-02 15:34:21,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:21,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:21,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-12-02 15:34:21,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-12-02 15:34:21,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-12-02 15:34:21,833 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:21,835 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:34:21,835 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:34:21,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-02 15:34:21,836 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:21,847 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 15:34:21,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 15:34:21,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-02 15:34:21,872 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:44, output treesize:58 [2018-12-02 15:34:21,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:34:21,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 15:34:21,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 32 [2018-12-02 15:34:21,961 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 15:34:21,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 15:34:21,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 15:34:21,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2018-12-02 15:34:21,962 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 21 states. [2018-12-02 15:34:22,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:34:22,416 INFO L93 Difference]: Finished difference Result 179 states and 200 transitions. [2018-12-02 15:34:22,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 15:34:22,416 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2018-12-02 15:34:22,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:34:22,417 INFO L225 Difference]: With dead ends: 179 [2018-12-02 15:34:22,417 INFO L226 Difference]: Without dead ends: 179 [2018-12-02 15:34:22,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=306, Invalid=1500, Unknown=0, NotChecked=0, Total=1806 [2018-12-02 15:34:22,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-02 15:34:22,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 96. [2018-12-02 15:34:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-02 15:34:22,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2018-12-02 15:34:22,420 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 30 [2018-12-02 15:34:22,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:34:22,420 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2018-12-02 15:34:22,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 15:34:22,421 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2018-12-02 15:34:22,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 15:34:22,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:34:22,421 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:34:22,421 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION]=== [2018-12-02 15:34:22,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:34:22,422 INFO L82 PathProgramCache]: Analyzing trace with hash 959957647, now seen corresponding path program 1 times [2018-12-02 15:34:22,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:34:22,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:22,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:34:22,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:22,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:34:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:34:22,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:34:22,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:34:22,544 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 15:34:22,544 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-02 15:34:22,544 INFO L205 CegarAbsIntRunner]: [0], [1], [10], [16], [18], [23], [26], [28], [31], [32], [35], [43], [49], [51], [54], [57], [61], [64], [69], [70], [76], [79], [80], [87], [99], [102], [137], [138], [139] [2018-12-02 15:34:22,545 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 15:34:22,546 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 15:34:22,607 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 15:34:22,607 INFO L272 AbstractInterpreter]: Visited 29 different actions 39 times. Merged at 9 different actions 9 times. Never widened. Performed 269 root evaluator evaluations with a maximum evaluation depth of 3. Performed 269 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 32 variables. [2018-12-02 15:34:22,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:34:22,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 15:34:22,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:34:22,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f897414-dff1-49d7-8961-f85ec58979b7/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:34:22,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:34:22,621 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 15:34:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:34:22,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:34:22,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 15:34:22,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:22,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:22,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 15:34:22,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 15:34:22,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 15:34:22,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:22,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:22,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:22,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-02 15:34:22,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:34:22,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:34:22,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:34:22,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:22,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:22,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2018-12-02 15:34:22,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 15:34:22,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 15:34:22,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:22,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:22,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-12-02 15:34:22,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:34:22,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-02 15:34:22,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:22,758 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:22,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:22,769 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:30 [2018-12-02 15:34:22,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 15:34:22,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-02 15:34:22,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:22,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:22,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:22,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-12-02 15:34:22,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-02 15:34:22,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 15:34:22,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:22,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:22,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 15:34:22,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2018-12-02 15:34:22,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-02 15:34:22,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 15:34:22,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:22,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 15:34:22,867 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:22,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:22,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:22,872 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-12-02 15:34:22,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:34:22,879 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:34:22,929 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:34:22,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:34:22,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:34:22,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2018-12-02 15:34:22,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-12-02 15:34:22,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-12-02 15:34:22,984 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:34:22,984 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:34:22,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-02 15:34:22,985 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:22,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-12-02 15:34:22,986 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:22,991 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 15:34:22,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 15:34:23,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-12-02 15:34:23,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-02 15:34:23,002 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:23,002 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:23,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-02 15:34:23,018 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:32, output treesize:48 [2018-12-02 15:34:23,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:34:23,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 15:34:23,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 8] total 27 [2018-12-02 15:34:23,068 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 15:34:23,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 15:34:23,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 15:34:23,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2018-12-02 15:34:23,068 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 21 states. [2018-12-02 15:34:23,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:34:23,526 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2018-12-02 15:34:23,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 15:34:23,526 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2018-12-02 15:34:23,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:34:23,527 INFO L225 Difference]: With dead ends: 133 [2018-12-02 15:34:23,527 INFO L226 Difference]: Without dead ends: 126 [2018-12-02 15:34:23,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=369, Invalid=1353, Unknown=0, NotChecked=0, Total=1722 [2018-12-02 15:34:23,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-02 15:34:23,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 92. [2018-12-02 15:34:23,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-02 15:34:23,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2018-12-02 15:34:23,529 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 30 [2018-12-02 15:34:23,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:34:23,529 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2018-12-02 15:34:23,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 15:34:23,529 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2018-12-02 15:34:23,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 15:34:23,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:34:23,530 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:34:23,531 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION]=== [2018-12-02 15:34:23,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:34:23,531 INFO L82 PathProgramCache]: Analyzing trace with hash 319118564, now seen corresponding path program 1 times [2018-12-02 15:34:23,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:34:23,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:23,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:34:23,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:23,532 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:34:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:34:23,707 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:34:23,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:34:23,707 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 15:34:23,707 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-12-02 15:34:23,707 INFO L205 CegarAbsIntRunner]: [0], [1], [10], [16], [18], [23], [26], [28], [31], [32], [35], [37], [38], [41], [43], [49], [51], [54], [57], [61], [64], [69], [74], [106], [111], [116], [131], [133], [136], [137], [138], [139] [2018-12-02 15:34:23,708 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 15:34:23,708 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 15:34:23,782 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 15:34:23,783 INFO L272 AbstractInterpreter]: Visited 32 different actions 61 times. Merged at 15 different actions 25 times. Never widened. Performed 541 root evaluator evaluations with a maximum evaluation depth of 3. Performed 541 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 4 different actions. Largest state had 31 variables. [2018-12-02 15:34:23,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:34:23,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 15:34:23,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:34:23,784 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f897414-dff1-49d7-8961-f85ec58979b7/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-12-02 15:34:23,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:34:23,790 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 15:34:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:34:23,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:34:23,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 15:34:23,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:23,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:23,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 15:34:23,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 15:34:23,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 15:34:23,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:23,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:23,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:23,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2018-12-02 15:34:23,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:34:23,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:34:23,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:34:23,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:23,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:23,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-12-02 15:34:23,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-12-02 15:34:23,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:34:23,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-02 15:34:23,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:23,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:23,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 15:34:23,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 15:34:23,917 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:23,919 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:23,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:23,925 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2018-12-02 15:34:23,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 15:34:23,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 4 [2018-12-02 15:34:23,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:23,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:23,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:23,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2018-12-02 15:34:23,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-02 15:34:23,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 15:34:23,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:23,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:23,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:23,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-12-02 15:34:24,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:34:24,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:34:24,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:34:24,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:24,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:24,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-12-02 15:34:24,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 15:34:24,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 15:34:24,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:24,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:24,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-02 15:34:24,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:34:24,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-02 15:34:24,054 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:24,058 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:24,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:24,065 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 [2018-12-02 15:34:24,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 15:34:24,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-02 15:34:24,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:24,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:24,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 15:34:24,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:26 [2018-12-02 15:34:24,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2018-12-02 15:34:24,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-12-02 15:34:24,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:24,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:34:24,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2018-12-02 15:34:24,183 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 15:34:24,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 15:34:24,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-02 15:34:24,207 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:37, output treesize:56 [2018-12-02 15:34:24,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-02 15:34:24,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 15:34:24,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:24,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 15:34:24,278 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:24,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:24,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:24,284 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-12-02 15:34:24,303 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:34:24,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:34:24,469 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:34:24,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:34:24,472 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:24,474 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:24,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 15:34:24,478 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:23 [2018-12-02 15:34:24,683 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:34:24,683 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:34:24,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-12-02 15:34:24,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:24,707 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:34:24,707 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:34:24,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-12-02 15:34:24,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:24,710 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:34:24,710 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:34:24,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2018-12-02 15:34:24,711 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:24,729 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:34:24,732 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:34:24,733 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:34:24,738 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:34:24,751 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:24,752 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:24,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-02 15:34:24,765 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:88, output treesize:57 [2018-12-02 15:34:26,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-12-02 15:34:26,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-02 15:34:26,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:26,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:26,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-12-02 15:34:26,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-12-02 15:34:26,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-12-02 15:34:26,902 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:26,903 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:34:26,903 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:34:26,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-02 15:34:26,904 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:26,910 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 15:34:26,918 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 15:34:26,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-12-02 15:34:26,936 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:58, output treesize:71 [2018-12-02 15:34:27,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:34:27,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 15:34:27,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 18] total 47 [2018-12-02 15:34:27,032 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 15:34:27,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-02 15:34:27,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-02 15:34:27,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=1893, Unknown=1, NotChecked=0, Total=2162 [2018-12-02 15:34:27,033 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 31 states. [2018-12-02 15:34:28,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:34:28,466 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2018-12-02 15:34:28,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-02 15:34:28,467 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 40 [2018-12-02 15:34:28,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:34:28,467 INFO L225 Difference]: With dead ends: 92 [2018-12-02 15:34:28,468 INFO L226 Difference]: Without dead ends: 92 [2018-12-02 15:34:28,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1181 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=658, Invalid=3631, Unknown=1, NotChecked=0, Total=4290 [2018-12-02 15:34:28,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-02 15:34:28,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-12-02 15:34:28,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-02 15:34:28,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-12-02 15:34:28,473 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 40 [2018-12-02 15:34:28,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:34:28,473 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-12-02 15:34:28,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-02 15:34:28,474 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-12-02 15:34:28,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 15:34:28,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:34:28,475 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:34:28,475 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION]=== [2018-12-02 15:34:28,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:34:28,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1291613980, now seen corresponding path program 1 times [2018-12-02 15:34:28,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 15:34:28,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:28,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:34:28,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:34:28,477 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 15:34:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:34:28,630 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:34:28,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:34:28,631 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 15:34:28,631 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-12-02 15:34:28,631 INFO L205 CegarAbsIntRunner]: [0], [1], [10], [16], [18], [23], [26], [28], [31], [32], [35], [37], [38], [41], [43], [49], [51], [54], [57], [61], [64], [69], [70], [76], [79], [80], [87], [99], [102], [137], [138], [139] [2018-12-02 15:34:28,632 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 15:34:28,632 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 15:34:28,672 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 15:34:28,672 INFO L272 AbstractInterpreter]: Visited 32 different actions 65 times. Merged at 19 different actions 29 times. Never widened. Performed 577 root evaluator evaluations with a maximum evaluation depth of 3. Performed 577 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 5 different actions. Largest state had 32 variables. [2018-12-02 15:34:28,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:34:28,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 15:34:28,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:34:28,673 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f897414-dff1-49d7-8961-f85ec58979b7/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:34:28,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:34:28,679 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 15:34:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:34:28,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:34:28,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 15:34:28,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:28,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:28,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 15:34:28,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 15:34:28,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 15:34:28,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:28,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:28,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:28,749 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-02 15:34:28,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:34:28,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:34:28,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-02 15:34:28,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:28,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:28,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:34 [2018-12-02 15:34:28,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-12-02 15:34:28,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:34:28,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-02 15:34:28,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:28,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:28,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 15:34:28,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 15:34:28,821 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:28,823 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:28,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:28,834 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:46 [2018-12-02 15:34:28,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-12-02 15:34:28,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-12-02 15:34:28,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:28,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:28,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:28,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:28 [2018-12-02 15:34:28,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-02 15:34:28,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 15:34:28,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:28,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:28,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:28,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-12-02 15:34:28,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:34:28,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:34:28,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:34:28,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 15:34:28,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:28,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:28,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:33 [2018-12-02 15:34:28,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-02 15:34:28,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:34:28,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-02 15:34:28,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:28,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:28,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 15:34:28,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 15:34:28,983 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:28,985 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:28,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:28,992 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:45 [2018-12-02 15:34:29,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-12-02 15:34:29,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2018-12-02 15:34:29,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:29,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:29,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 15:34:29,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:33 [2018-12-02 15:34:29,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-12-02 15:34:29,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 15:34:29,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:29,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:29,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-02 15:34:29,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-12-02 15:34:29,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-12-02 15:34:29,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 15:34:29,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:29,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 15:34:29,157 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:29,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 15:34:29,160 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:29,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:29,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:29,168 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:47, output treesize:3 [2018-12-02 15:34:29,179 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:34:29,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:34:29,232 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:34:29,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:34:29,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:34:29,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2018-12-02 15:34:29,379 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:34:29,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:34:29,383 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:34:29,386 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:34:29,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-02 15:34:29,397 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:66 [2018-12-02 15:34:29,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-12-02 15:34:29,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-02 15:34:29,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:29,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:34:29,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2018-12-02 15:34:29,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-12-02 15:34:29,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-12-02 15:34:29,519 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:29,521 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:34:29,521 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:34:29,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-12-02 15:34:29,522 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 15:34:29,531 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 15:34:29,545 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 15:34:29,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-12-02 15:34:29,579 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:62, output treesize:94 [2018-12-02 15:34:29,677 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:34:29,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 15:34:29,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 14] total 42 [2018-12-02 15:34:29,692 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 15:34:29,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-02 15:34:29,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-02 15:34:29,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1457, Unknown=0, NotChecked=0, Total=1722 [2018-12-02 15:34:29,693 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 30 states. [2018-12-02 15:34:30,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:34:30,925 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-12-02 15:34:30,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-02 15:34:30,926 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 40 [2018-12-02 15:34:30,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:34:30,926 INFO L225 Difference]: With dead ends: 79 [2018-12-02 15:34:30,926 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 15:34:30,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1333 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=920, Invalid=3910, Unknown=0, NotChecked=0, Total=4830 [2018-12-02 15:34:30,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 15:34:30,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 15:34:30,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 15:34:30,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 15:34:30,927 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-12-02 15:34:30,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:34:30,927 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 15:34:30,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-02 15:34:30,927 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 15:34:30,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 15:34:30,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:34:30 BoogieIcfgContainer [2018-12-02 15:34:30,930 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 15:34:30,930 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 15:34:30,930 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 15:34:30,930 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 15:34:30,931 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:34:19" (3/4) ... [2018-12-02 15:34:30,933 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 15:34:30,936 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 15:34:30,936 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-12-02 15:34:30,936 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 15:34:30,939 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-02 15:34:30,939 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 15:34:30,939 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 15:34:30,963 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4f897414-dff1-49d7-8961-f85ec58979b7/bin-2019/utaipan/witness.graphml [2018-12-02 15:34:30,963 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 15:34:30,964 INFO L168 Benchmark]: Toolchain (without parser) took 11925.46 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 354.4 MB). Free memory was 950.6 MB in the beginning and 900.0 MB in the end (delta: 50.6 MB). Peak memory consumption was 405.0 MB. Max. memory is 11.5 GB. [2018-12-02 15:34:30,965 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:34:30,965 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2018-12-02 15:34:30,965 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.50 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.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-02 15:34:30,965 INFO L168 Benchmark]: Boogie Preprocessor took 17.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:34:30,965 INFO L168 Benchmark]: RCFGBuilder took 231.48 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: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. [2018-12-02 15:34:30,965 INFO L168 Benchmark]: TraceAbstraction took 11370.86 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 223.3 MB). Free memory was 1.1 GB in the beginning and 900.0 MB in the end (delta: 181.2 MB). Peak memory consumption was 404.5 MB. Max. memory is 11.5 GB. [2018-12-02 15:34:30,965 INFO L168 Benchmark]: Witness Printer took 33.11 ms. Allocated memory is still 1.4 GB. Free memory is still 900.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:34:30,966 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 250.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.50 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.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 231.48 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: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11370.86 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 223.3 MB). Free memory was 1.1 GB in the beginning and 900.0 MB in the end (delta: 181.2 MB). Peak memory consumption was 404.5 MB. Max. memory is 11.5 GB. * Witness Printer took 33.11 ms. Allocated memory is still 1.4 GB. Free memory is still 900.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 655]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 655]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 664]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 663]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 663]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 643]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 642]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 634]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 664]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 645]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 645]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 643]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 27 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 78 locations, 27 error locations. SAFE Result, 11.3s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 707 SDtfs, 1553 SDslu, 2373 SDs, 0 SdLazy, 2898 SolverSat, 425 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 489 GetRequests, 210 SyntacticMatches, 8 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3500 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 284 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 477 NumberOfCodeBlocks, 477 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 594 ConstructedInterpolants, 86 QuantifiedInterpolants, 228088 SizeOfPredicates, 87 NumberOfNonLiveVariables, 646 ConjunctsInSsa, 155 ConjunctsInUnsatCore, 23 InterpolantComputations, 11 PerfectInterpolantSequences, 13/97 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...