./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6617d65d-9a31-4ce4-961b-a6fabbb0fbfa/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6617d65d-9a31-4ce4-961b-a6fabbb0fbfa/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6617d65d-9a31-4ce4-961b-a6fabbb0fbfa/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6617d65d-9a31-4ce4-961b-a6fabbb0fbfa/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6617d65d-9a31-4ce4-961b-a6fabbb0fbfa/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6617d65d-9a31-4ce4-961b-a6fabbb0fbfa/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31de2fb67e84e52bb7705ac8720e6b139fef2d91 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 12:13:17,743 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:13:17,743 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:13:17,749 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:13:17,750 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:13:17,750 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:13:17,751 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:13:17,752 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:13:17,753 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:13:17,754 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:13:17,755 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:13:17,755 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:13:17,755 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:13:17,756 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:13:17,756 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:13:17,757 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:13:17,757 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:13:17,758 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:13:17,760 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:13:17,760 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:13:17,761 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:13:17,762 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:13:17,764 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:13:17,764 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:13:17,764 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:13:17,765 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:13:17,765 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:13:17,766 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:13:17,766 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:13:17,767 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:13:17,767 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:13:17,768 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:13:17,768 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:13:17,768 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:13:17,768 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:13:17,769 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:13:17,769 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6617d65d-9a31-4ce4-961b-a6fabbb0fbfa/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-18 12:13:17,777 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:13:17,777 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:13:17,778 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 12:13:17,778 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 12:13:17,778 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 12:13:17,778 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 12:13:17,778 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 12:13:17,778 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 12:13:17,779 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 12:13:17,779 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 12:13:17,779 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 12:13:17,779 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 12:13:17,779 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 12:13:17,780 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:13:17,780 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:13:17,780 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:13:17,780 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 12:13:17,780 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:13:17,780 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:13:17,780 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 12:13:17,781 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:13:17,781 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-18 12:13:17,781 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-18 12:13:17,781 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-18 12:13:17,781 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 12:13:17,781 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 12:13:17,781 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:13:17,782 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:13:17,782 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:13:17,782 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 12:13:17,782 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 12:13:17,782 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:13:17,782 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:13:17,782 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 12:13:17,782 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 12:13:17,783 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 12:13:17,783 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 12:13:17,783 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_6617d65d-9a31-4ce4-961b-a6fabbb0fbfa/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 31de2fb67e84e52bb7705ac8720e6b139fef2d91 [2018-11-18 12:13:17,807 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:13:17,816 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:13:17,818 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:13:17,820 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:13:17,820 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:13:17,820 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6617d65d-9a31-4ce4-961b-a6fabbb0fbfa/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-11-18 12:13:17,862 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6617d65d-9a31-4ce4-961b-a6fabbb0fbfa/bin-2019/utaipan/data/04dd09042/3671eb3510ac4193b0d19e472d3bf39a/FLAGd469b4652 [2018-11-18 12:13:18,322 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:13:18,323 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6617d65d-9a31-4ce4-961b-a6fabbb0fbfa/sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-11-18 12:13:18,332 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6617d65d-9a31-4ce4-961b-a6fabbb0fbfa/bin-2019/utaipan/data/04dd09042/3671eb3510ac4193b0d19e472d3bf39a/FLAGd469b4652 [2018-11-18 12:13:18,837 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6617d65d-9a31-4ce4-961b-a6fabbb0fbfa/bin-2019/utaipan/data/04dd09042/3671eb3510ac4193b0d19e472d3bf39a [2018-11-18 12:13:18,839 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:13:18,840 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:13:18,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:13:18,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:13:18,843 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:13:18,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:13:18" (1/1) ... [2018-11-18 12:13:18,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@795311a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:18, skipping insertion in model container [2018-11-18 12:13:18,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:13:18" (1/1) ... [2018-11-18 12:13:18,850 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:13:18,880 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:13:19,074 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:13:19,079 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:13:19,114 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:13:19,185 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:13:19,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:19 WrapperNode [2018-11-18 12:13:19,185 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:13:19,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:13:19,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:13:19,186 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:13:19,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:19" (1/1) ... [2018-11-18 12:13:19,201 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:19" (1/1) ... [2018-11-18 12:13:19,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:13:19,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:13:19,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:13:19,208 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:13:19,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:19" (1/1) ... [2018-11-18 12:13:19,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:19" (1/1) ... [2018-11-18 12:13:19,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:19" (1/1) ... [2018-11-18 12:13:19,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:19" (1/1) ... [2018-11-18 12:13:19,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:19" (1/1) ... [2018-11-18 12:13:19,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:19" (1/1) ... [2018-11-18 12:13:19,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:19" (1/1) ... [2018-11-18 12:13:19,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:13:19,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:13:19,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:13:19,241 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:13:19,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6617d65d-9a31-4ce4-961b-a6fabbb0fbfa/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:13:19,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:13:19,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 12:13:19,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 12:13:19,276 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 12:13:19,276 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 12:13:19,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 12:13:19,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 12:13:19,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 12:13:19,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:13:19,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:13:19,733 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:13:19,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:13:19 BoogieIcfgContainer [2018-11-18 12:13:19,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:13:19,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 12:13:19,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 12:13:19,736 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 12:13:19,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:13:18" (1/3) ... [2018-11-18 12:13:19,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f7e33b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:13:19, skipping insertion in model container [2018-11-18 12:13:19,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:19" (2/3) ... [2018-11-18 12:13:19,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f7e33b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:13:19, skipping insertion in model container [2018-11-18 12:13:19,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:13:19" (3/3) ... [2018-11-18 12:13:19,738 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-11-18 12:13:19,745 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 12:13:19,751 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-11-18 12:13:19,760 INFO L257 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2018-11-18 12:13:19,775 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 12:13:19,775 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-18 12:13:19,775 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 12:13:19,776 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:13:19,776 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:13:19,776 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 12:13:19,776 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:13:19,776 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 12:13:19,789 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states. [2018-11-18 12:13:19,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 12:13:19,794 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:19,795 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:13:19,796 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr36REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 12:13:19,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:19,800 INFO L82 PathProgramCache]: Analyzing trace with hash 672062751, now seen corresponding path program 1 times [2018-11-18 12:13:19,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:19,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:19,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:19,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:19,834 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:19,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:19,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:19,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:13:19,897 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:19,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:13:19,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:13:19,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:13:19,910 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 3 states. [2018-11-18 12:13:20,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:20,068 INFO L93 Difference]: Finished difference Result 186 states and 197 transitions. [2018-11-18 12:13:20,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:13:20,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-18 12:13:20,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:20,076 INFO L225 Difference]: With dead ends: 186 [2018-11-18 12:13:20,077 INFO L226 Difference]: Without dead ends: 182 [2018-11-18 12:13:20,078 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:13:20,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-18 12:13:20,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 177. [2018-11-18 12:13:20,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-18 12:13:20,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 190 transitions. [2018-11-18 12:13:20,111 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 190 transitions. Word has length 7 [2018-11-18 12:13:20,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:20,111 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 190 transitions. [2018-11-18 12:13:20,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:13:20,112 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 190 transitions. [2018-11-18 12:13:20,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 12:13:20,112 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:20,112 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:13:20,113 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr36REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 12:13:20,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:20,113 INFO L82 PathProgramCache]: Analyzing trace with hash 672062752, now seen corresponding path program 1 times [2018-11-18 12:13:20,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:20,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:20,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:20,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:20,115 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:20,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:20,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:20,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:13:20,163 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:20,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:13:20,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:13:20,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:13:20,165 INFO L87 Difference]: Start difference. First operand 177 states and 190 transitions. Second operand 3 states. [2018-11-18 12:13:20,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:20,272 INFO L93 Difference]: Finished difference Result 200 states and 212 transitions. [2018-11-18 12:13:20,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:13:20,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-18 12:13:20,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:20,274 INFO L225 Difference]: With dead ends: 200 [2018-11-18 12:13:20,274 INFO L226 Difference]: Without dead ends: 200 [2018-11-18 12:13:20,274 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:13:20,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-18 12:13:20,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 189. [2018-11-18 12:13:20,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-18 12:13:20,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 209 transitions. [2018-11-18 12:13:20,283 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 209 transitions. Word has length 7 [2018-11-18 12:13:20,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:20,284 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 209 transitions. [2018-11-18 12:13:20,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:13:20,284 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 209 transitions. [2018-11-18 12:13:20,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 12:13:20,284 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:20,284 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:13:20,285 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr36REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 12:13:20,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:20,285 INFO L82 PathProgramCache]: Analyzing trace with hash 891395470, now seen corresponding path program 1 times [2018-11-18 12:13:20,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:20,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:20,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:20,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:20,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:20,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:20,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:20,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:13:20,329 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:20,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:13:20,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:13:20,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:13:20,329 INFO L87 Difference]: Start difference. First operand 189 states and 209 transitions. Second operand 5 states. [2018-11-18 12:13:20,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:20,579 INFO L93 Difference]: Finished difference Result 325 states and 354 transitions. [2018-11-18 12:13:20,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:13:20,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-18 12:13:20,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:20,581 INFO L225 Difference]: With dead ends: 325 [2018-11-18 12:13:20,581 INFO L226 Difference]: Without dead ends: 325 [2018-11-18 12:13:20,581 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-18 12:13:20,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-11-18 12:13:20,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 188. [2018-11-18 12:13:20,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-18 12:13:20,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 208 transitions. [2018-11-18 12:13:20,590 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 208 transitions. Word has length 15 [2018-11-18 12:13:20,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:20,590 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 208 transitions. [2018-11-18 12:13:20,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:13:20,591 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 208 transitions. [2018-11-18 12:13:20,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 12:13:20,591 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:20,591 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:13:20,592 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr36REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 12:13:20,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:20,592 INFO L82 PathProgramCache]: Analyzing trace with hash 891395471, now seen corresponding path program 1 times [2018-11-18 12:13:20,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:20,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:20,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:20,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:20,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:20,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:20,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:20,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:13:20,651 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:20,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:13:20,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:13:20,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:13:20,652 INFO L87 Difference]: Start difference. First operand 188 states and 208 transitions. Second operand 5 states. [2018-11-18 12:13:20,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:20,883 INFO L93 Difference]: Finished difference Result 352 states and 391 transitions. [2018-11-18 12:13:20,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:13:20,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-18 12:13:20,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:20,885 INFO L225 Difference]: With dead ends: 352 [2018-11-18 12:13:20,885 INFO L226 Difference]: Without dead ends: 352 [2018-11-18 12:13:20,885 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-18 12:13:20,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-11-18 12:13:20,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 187. [2018-11-18 12:13:20,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-18 12:13:20,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 207 transitions. [2018-11-18 12:13:20,893 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 207 transitions. Word has length 15 [2018-11-18 12:13:20,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:20,893 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 207 transitions. [2018-11-18 12:13:20,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:13:20,893 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 207 transitions. [2018-11-18 12:13:20,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 12:13:20,893 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:20,893 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:13:20,894 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr36REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 12:13:20,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:20,894 INFO L82 PathProgramCache]: Analyzing trace with hash -220329468, now seen corresponding path program 1 times [2018-11-18 12:13:20,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:20,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:20,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:20,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:20,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:20,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:20,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:20,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 12:13:20,975 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:20,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 12:13:20,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 12:13:20,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 12:13:20,976 INFO L87 Difference]: Start difference. First operand 187 states and 207 transitions. Second operand 8 states. [2018-11-18 12:13:21,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:21,416 INFO L93 Difference]: Finished difference Result 327 states and 354 transitions. [2018-11-18 12:13:21,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 12:13:21,417 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-18 12:13:21,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:21,417 INFO L225 Difference]: With dead ends: 327 [2018-11-18 12:13:21,418 INFO L226 Difference]: Without dead ends: 327 [2018-11-18 12:13:21,418 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:13:21,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-11-18 12:13:21,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 186. [2018-11-18 12:13:21,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-18 12:13:21,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 206 transitions. [2018-11-18 12:13:21,424 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 206 transitions. Word has length 18 [2018-11-18 12:13:21,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:21,424 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 206 transitions. [2018-11-18 12:13:21,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 12:13:21,425 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 206 transitions. [2018-11-18 12:13:21,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 12:13:21,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:21,425 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:13:21,426 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr36REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 12:13:21,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:21,426 INFO L82 PathProgramCache]: Analyzing trace with hash -220329467, now seen corresponding path program 1 times [2018-11-18 12:13:21,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:21,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:21,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:21,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:21,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:21,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:21,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:21,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 12:13:21,526 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:21,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 12:13:21,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 12:13:21,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 12:13:21,527 INFO L87 Difference]: Start difference. First operand 186 states and 206 transitions. Second operand 8 states. [2018-11-18 12:13:22,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:22,063 INFO L93 Difference]: Finished difference Result 328 states and 355 transitions. [2018-11-18 12:13:22,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 12:13:22,064 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-18 12:13:22,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:22,065 INFO L225 Difference]: With dead ends: 328 [2018-11-18 12:13:22,065 INFO L226 Difference]: Without dead ends: 328 [2018-11-18 12:13:22,066 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:13:22,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-11-18 12:13:22,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 185. [2018-11-18 12:13:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-11-18 12:13:22,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 205 transitions. [2018-11-18 12:13:22,071 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 205 transitions. Word has length 18 [2018-11-18 12:13:22,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:22,071 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 205 transitions. [2018-11-18 12:13:22,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 12:13:22,071 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 205 transitions. [2018-11-18 12:13:22,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 12:13:22,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:22,072 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:13:22,072 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr36REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 12:13:22,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:22,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1456889351, now seen corresponding path program 1 times [2018-11-18 12:13:22,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:22,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:22,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:22,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:22,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:22,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:22,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:22,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:13:22,117 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:22,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:13:22,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:13:22,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:13:22,117 INFO L87 Difference]: Start difference. First operand 185 states and 205 transitions. Second operand 5 states. [2018-11-18 12:13:22,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:22,232 INFO L93 Difference]: Finished difference Result 277 states and 303 transitions. [2018-11-18 12:13:22,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:13:22,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-18 12:13:22,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:22,234 INFO L225 Difference]: With dead ends: 277 [2018-11-18 12:13:22,234 INFO L226 Difference]: Without dead ends: 277 [2018-11-18 12:13:22,234 INFO L604 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-11-18 12:13:22,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-11-18 12:13:22,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 189. [2018-11-18 12:13:22,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-18 12:13:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 209 transitions. [2018-11-18 12:13:22,240 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 209 transitions. Word has length 24 [2018-11-18 12:13:22,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:22,240 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 209 transitions. [2018-11-18 12:13:22,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:13:22,240 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 209 transitions. [2018-11-18 12:13:22,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 12:13:22,241 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:22,241 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:13:22,241 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr36REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 12:13:22,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:22,241 INFO L82 PathProgramCache]: Analyzing trace with hash 2075107874, now seen corresponding path program 1 times [2018-11-18 12:13:22,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:22,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:22,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:22,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:22,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:22,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:22,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:22,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:13:22,287 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:22,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:13:22,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:13:22,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:13:22,288 INFO L87 Difference]: Start difference. First operand 189 states and 209 transitions. Second operand 4 states. [2018-11-18 12:13:22,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:22,394 INFO L93 Difference]: Finished difference Result 193 states and 210 transitions. [2018-11-18 12:13:22,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:13:22,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-18 12:13:22,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:22,395 INFO L225 Difference]: With dead ends: 193 [2018-11-18 12:13:22,395 INFO L226 Difference]: Without dead ends: 193 [2018-11-18 12:13:22,395 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:13:22,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-18 12:13:22,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 181. [2018-11-18 12:13:22,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-18 12:13:22,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 201 transitions. [2018-11-18 12:13:22,398 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 201 transitions. Word has length 26 [2018-11-18 12:13:22,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:22,398 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 201 transitions. [2018-11-18 12:13:22,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:13:22,398 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 201 transitions. [2018-11-18 12:13:22,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 12:13:22,399 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:22,399 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:13:22,399 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr36REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 12:13:22,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:22,399 INFO L82 PathProgramCache]: Analyzing trace with hash 2075107875, now seen corresponding path program 1 times [2018-11-18 12:13:22,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:22,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:22,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:22,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:22,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:22,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:22,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:22,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:13:22,444 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:22,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:13:22,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:13:22,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:13:22,445 INFO L87 Difference]: Start difference. First operand 181 states and 201 transitions. Second operand 4 states. [2018-11-18 12:13:22,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:22,569 INFO L93 Difference]: Finished difference Result 237 states and 254 transitions. [2018-11-18 12:13:22,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:13:22,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-18 12:13:22,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:22,570 INFO L225 Difference]: With dead ends: 237 [2018-11-18 12:13:22,570 INFO L226 Difference]: Without dead ends: 237 [2018-11-18 12:13:22,570 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:13:22,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-11-18 12:13:22,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 210. [2018-11-18 12:13:22,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-18 12:13:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 241 transitions. [2018-11-18 12:13:22,574 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 241 transitions. Word has length 26 [2018-11-18 12:13:22,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:22,574 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 241 transitions. [2018-11-18 12:13:22,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:13:22,574 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 241 transitions. [2018-11-18 12:13:22,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 12:13:22,575 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:22,575 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:13:22,575 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr36REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 12:13:22,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:22,575 INFO L82 PathProgramCache]: Analyzing trace with hash 2074452613, now seen corresponding path program 1 times [2018-11-18 12:13:22,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:22,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:22,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:22,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:22,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:22,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:22,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:22,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:13:22,618 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:22,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:13:22,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:13:22,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:13:22,618 INFO L87 Difference]: Start difference. First operand 210 states and 241 transitions. Second operand 6 states. [2018-11-18 12:13:22,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:22,802 INFO L93 Difference]: Finished difference Result 308 states and 356 transitions. [2018-11-18 12:13:22,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 12:13:22,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-11-18 12:13:22,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:22,803 INFO L225 Difference]: With dead ends: 308 [2018-11-18 12:13:22,803 INFO L226 Difference]: Without dead ends: 308 [2018-11-18 12:13:22,803 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-18 12:13:22,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-18 12:13:22,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 209. [2018-11-18 12:13:22,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-11-18 12:13:22,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 240 transitions. [2018-11-18 12:13:22,808 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 240 transitions. Word has length 29 [2018-11-18 12:13:22,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:22,808 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 240 transitions. [2018-11-18 12:13:22,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:13:22,808 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 240 transitions. [2018-11-18 12:13:22,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 12:13:22,809 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:22,809 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:13:22,809 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr36REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 12:13:22,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:22,809 INFO L82 PathProgramCache]: Analyzing trace with hash 2074452614, now seen corresponding path program 1 times [2018-11-18 12:13:22,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:22,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:22,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:22,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:22,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:22,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:22,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:22,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:13:22,879 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:22,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:13:22,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:13:22,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:13:22,880 INFO L87 Difference]: Start difference. First operand 209 states and 240 transitions. Second operand 6 states. [2018-11-18 12:13:23,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:23,065 INFO L93 Difference]: Finished difference Result 328 states and 384 transitions. [2018-11-18 12:13:23,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 12:13:23,066 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-11-18 12:13:23,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:23,066 INFO L225 Difference]: With dead ends: 328 [2018-11-18 12:13:23,066 INFO L226 Difference]: Without dead ends: 328 [2018-11-18 12:13:23,067 INFO L604 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-11-18 12:13:23,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-11-18 12:13:23,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 195. [2018-11-18 12:13:23,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-18 12:13:23,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 225 transitions. [2018-11-18 12:13:23,070 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 225 transitions. Word has length 29 [2018-11-18 12:13:23,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:23,070 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 225 transitions. [2018-11-18 12:13:23,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:13:23,070 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 225 transitions. [2018-11-18 12:13:23,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 12:13:23,071 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:23,071 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:13:23,071 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr36REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 12:13:23,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:23,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1147011504, now seen corresponding path program 1 times [2018-11-18 12:13:23,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:23,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:23,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:23,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:23,075 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:23,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:23,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:23,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:13:23,113 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:23,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:13:23,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:13:23,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:13:23,114 INFO L87 Difference]: Start difference. First operand 195 states and 225 transitions. Second operand 4 states. [2018-11-18 12:13:23,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:23,164 INFO L93 Difference]: Finished difference Result 217 states and 233 transitions. [2018-11-18 12:13:23,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:13:23,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-11-18 12:13:23,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:23,165 INFO L225 Difference]: With dead ends: 217 [2018-11-18 12:13:23,165 INFO L226 Difference]: Without dead ends: 217 [2018-11-18 12:13:23,165 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:13:23,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-18 12:13:23,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 195. [2018-11-18 12:13:23,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-18 12:13:23,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 223 transitions. [2018-11-18 12:13:23,168 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 223 transitions. Word has length 35 [2018-11-18 12:13:23,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:23,168 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 223 transitions. [2018-11-18 12:13:23,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:13:23,168 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 223 transitions. [2018-11-18 12:13:23,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 12:13:23,169 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:23,169 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:13:23,169 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr36REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 12:13:23,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:23,170 INFO L82 PathProgramCache]: Analyzing trace with hash 2294846, now seen corresponding path program 1 times [2018-11-18 12:13:23,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:23,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:23,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:23,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:23,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:23,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:23,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:23,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:13:23,204 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:23,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:13:23,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:13:23,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:13:23,204 INFO L87 Difference]: Start difference. First operand 195 states and 223 transitions. Second operand 5 states. [2018-11-18 12:13:23,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:23,353 INFO L93 Difference]: Finished difference Result 314 states and 361 transitions. [2018-11-18 12:13:23,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:13:23,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-11-18 12:13:23,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:23,355 INFO L225 Difference]: With dead ends: 314 [2018-11-18 12:13:23,355 INFO L226 Difference]: Without dead ends: 314 [2018-11-18 12:13:23,355 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-18 12:13:23,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-11-18 12:13:23,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 194. [2018-11-18 12:13:23,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-18 12:13:23,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 222 transitions. [2018-11-18 12:13:23,358 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 222 transitions. Word has length 40 [2018-11-18 12:13:23,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:23,358 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 222 transitions. [2018-11-18 12:13:23,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:13:23,358 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 222 transitions. [2018-11-18 12:13:23,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 12:13:23,359 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:23,359 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:13:23,359 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr36REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 12:13:23,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:23,360 INFO L82 PathProgramCache]: Analyzing trace with hash 2294847, now seen corresponding path program 1 times [2018-11-18 12:13:23,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:23,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:23,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:23,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:23,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:23,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:23,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:23,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:13:23,396 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:23,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:13:23,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:13:23,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:13:23,397 INFO L87 Difference]: Start difference. First operand 194 states and 222 transitions. Second operand 5 states. [2018-11-18 12:13:23,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:23,566 INFO L93 Difference]: Finished difference Result 344 states and 398 transitions. [2018-11-18 12:13:23,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:13:23,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-11-18 12:13:23,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:23,568 INFO L225 Difference]: With dead ends: 344 [2018-11-18 12:13:23,568 INFO L226 Difference]: Without dead ends: 344 [2018-11-18 12:13:23,568 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-18 12:13:23,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-11-18 12:13:23,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 193. [2018-11-18 12:13:23,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-11-18 12:13:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 221 transitions. [2018-11-18 12:13:23,573 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 221 transitions. Word has length 40 [2018-11-18 12:13:23,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:23,574 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 221 transitions. [2018-11-18 12:13:23,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:13:23,574 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 221 transitions. [2018-11-18 12:13:23,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-18 12:13:23,574 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:23,575 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:13:23,575 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr36REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 12:13:23,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:23,575 INFO L82 PathProgramCache]: Analyzing trace with hash 314752449, now seen corresponding path program 1 times [2018-11-18 12:13:23,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:23,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:23,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:23,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:23,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:23,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:23,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:23,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 12:13:23,706 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:23,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 12:13:23,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 12:13:23,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-18 12:13:23,706 INFO L87 Difference]: Start difference. First operand 193 states and 221 transitions. Second operand 9 states. [2018-11-18 12:13:23,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:23,981 INFO L93 Difference]: Finished difference Result 313 states and 345 transitions. [2018-11-18 12:13:23,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 12:13:23,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-11-18 12:13:23,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:23,983 INFO L225 Difference]: With dead ends: 313 [2018-11-18 12:13:23,983 INFO L226 Difference]: Without dead ends: 313 [2018-11-18 12:13:23,983 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-11-18 12:13:23,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-11-18 12:13:23,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 233. [2018-11-18 12:13:23,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-18 12:13:23,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 265 transitions. [2018-11-18 12:13:23,987 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 265 transitions. Word has length 41 [2018-11-18 12:13:23,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:23,987 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 265 transitions. [2018-11-18 12:13:23,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 12:13:23,987 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 265 transitions. [2018-11-18 12:13:23,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 12:13:23,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:23,988 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:13:23,988 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr36REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 12:13:23,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:23,988 INFO L82 PathProgramCache]: Analyzing trace with hash -353590425, now seen corresponding path program 1 times [2018-11-18 12:13:23,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:23,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:23,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:23,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:23,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:24,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:24,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:24,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 12:13:24,064 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:24,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 12:13:24,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 12:13:24,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 12:13:24,065 INFO L87 Difference]: Start difference. First operand 233 states and 265 transitions. Second operand 8 states. [2018-11-18 12:13:24,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:24,307 INFO L93 Difference]: Finished difference Result 253 states and 288 transitions. [2018-11-18 12:13:24,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 12:13:24,308 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-11-18 12:13:24,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:24,309 INFO L225 Difference]: With dead ends: 253 [2018-11-18 12:13:24,309 INFO L226 Difference]: Without dead ends: 253 [2018-11-18 12:13:24,309 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:13:24,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-11-18 12:13:24,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 232. [2018-11-18 12:13:24,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-18 12:13:24,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 264 transitions. [2018-11-18 12:13:24,314 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 264 transitions. Word has length 43 [2018-11-18 12:13:24,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:24,314 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 264 transitions. [2018-11-18 12:13:24,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 12:13:24,314 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 264 transitions. [2018-11-18 12:13:24,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 12:13:24,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:24,315 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:13:24,315 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr36REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 12:13:24,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:24,315 INFO L82 PathProgramCache]: Analyzing trace with hash -353590424, now seen corresponding path program 1 times [2018-11-18 12:13:24,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:24,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:24,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:24,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:24,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:24,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:24,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:24,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 12:13:24,396 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:24,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 12:13:24,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 12:13:24,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 12:13:24,397 INFO L87 Difference]: Start difference. First operand 232 states and 264 transitions. Second operand 8 states. [2018-11-18 12:13:24,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:24,669 INFO L93 Difference]: Finished difference Result 252 states and 287 transitions. [2018-11-18 12:13:24,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 12:13:24,669 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-11-18 12:13:24,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:24,670 INFO L225 Difference]: With dead ends: 252 [2018-11-18 12:13:24,670 INFO L226 Difference]: Without dead ends: 252 [2018-11-18 12:13:24,670 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:13:24,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-11-18 12:13:24,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 231. [2018-11-18 12:13:24,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-11-18 12:13:24,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 263 transitions. [2018-11-18 12:13:24,673 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 263 transitions. Word has length 43 [2018-11-18 12:13:24,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:24,673 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 263 transitions. [2018-11-18 12:13:24,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 12:13:24,674 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 263 transitions. [2018-11-18 12:13:24,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 12:13:24,674 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:24,674 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:13:24,674 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr36REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 12:13:24,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:24,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1752261785, now seen corresponding path program 1 times [2018-11-18 12:13:24,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:24,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:24,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:24,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:24,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:24,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:24,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:13:24,746 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:13:24,746 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-11-18 12:13:24,749 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [12], [17], [21], [27], [30], [31], [56], [57], [60], [65], [66], [69], [75], [79], [85], [89], [91], [94], [203], [207], [212], [216], [224], [230], [231], [232], [234], [238], [242], [327], [332], [336], [342], [345], [444], [445], [446] [2018-11-18 12:13:24,778 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:13:24,778 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:13:24,950 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 12:13:24,951 INFO L272 AbstractInterpreter]: Visited 41 different actions 53 times. Merged at 12 different actions 12 times. Never widened. Performed 266 root evaluator evaluations with a maximum evaluation depth of 3. Performed 266 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-11-18 12:13:24,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:24,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 12:13:24,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:13:24,970 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6617d65d-9a31-4ce4-961b-a6fabbb0fbfa/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:13:24,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:24,990 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 12:13:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:25,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:13:25,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 12:13:25,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 12:13:25,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:13:25,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:13:25,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 12:13:25,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 12:13:25,092 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:13:25,094 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:13:25,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:13:25,098 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-11-18 12:13:25,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-18 12:13:25,115 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:13:25,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 12:13:25,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:13:25,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:13:25,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-18 12:13:25,132 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:13:25,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 12:13:25,133 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:13:25,137 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:13:25,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:13:25,168 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-11-18 12:13:25,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-18 12:13:25,206 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:13:25,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-18 12:13:25,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:13:25,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:13:25,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-18 12:13:25,219 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:13:25,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-18 12:13:25,220 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:13:25,222 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:13:25,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:13:25,226 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:7 [2018-11-18 12:13:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:25,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:13:25,257 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-18 12:13:25,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:13:25,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:13:25,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:1 [2018-11-18 12:13:25,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:25,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 12:13:25,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 10 [2018-11-18 12:13:25,287 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 12:13:25,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 12:13:25,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 12:13:25,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-18 12:13:25,288 INFO L87 Difference]: Start difference. First operand 231 states and 263 transitions. Second operand 10 states. [2018-11-18 12:13:25,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:25,636 INFO L93 Difference]: Finished difference Result 374 states and 408 transitions. [2018-11-18 12:13:25,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 12:13:25,637 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-11-18 12:13:25,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:25,638 INFO L225 Difference]: With dead ends: 374 [2018-11-18 12:13:25,638 INFO L226 Difference]: Without dead ends: 374 [2018-11-18 12:13:25,638 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 77 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-11-18 12:13:25,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-11-18 12:13:25,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 278. [2018-11-18 12:13:25,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-11-18 12:13:25,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 322 transitions. [2018-11-18 12:13:25,644 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 322 transitions. Word has length 43 [2018-11-18 12:13:25,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:25,644 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 322 transitions. [2018-11-18 12:13:25,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 12:13:25,644 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 322 transitions. [2018-11-18 12:13:25,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 12:13:25,645 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:25,645 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:13:25,645 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr36REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 12:13:25,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:25,645 INFO L82 PathProgramCache]: Analyzing trace with hash 700320899, now seen corresponding path program 1 times [2018-11-18 12:13:25,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:25,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:25,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:25,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:25,651 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:25,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:25,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:25,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 12:13:25,967 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:25,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 12:13:25,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 12:13:25,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-11-18 12:13:25,968 INFO L87 Difference]: Start difference. First operand 278 states and 322 transitions. Second operand 14 states. [2018-11-18 12:13:27,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:27,244 INFO L93 Difference]: Finished difference Result 683 states and 760 transitions. [2018-11-18 12:13:27,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-18 12:13:27,245 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-11-18 12:13:27,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:27,248 INFO L225 Difference]: With dead ends: 683 [2018-11-18 12:13:27,248 INFO L226 Difference]: Without dead ends: 683 [2018-11-18 12:13:27,248 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=279, Invalid=981, Unknown=0, NotChecked=0, Total=1260 [2018-11-18 12:13:27,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-11-18 12:13:27,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 324. [2018-11-18 12:13:27,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-11-18 12:13:27,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 373 transitions. [2018-11-18 12:13:27,258 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 373 transitions. Word has length 45 [2018-11-18 12:13:27,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:27,258 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 373 transitions. [2018-11-18 12:13:27,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 12:13:27,258 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 373 transitions. [2018-11-18 12:13:27,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 12:13:27,259 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:27,259 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:13:27,259 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr36REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 12:13:27,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:27,259 INFO L82 PathProgramCache]: Analyzing trace with hash 700320900, now seen corresponding path program 1 times [2018-11-18 12:13:27,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:27,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:27,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:27,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:27,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:27,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:27,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:27,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-18 12:13:27,499 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:27,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 12:13:27,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 12:13:27,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-11-18 12:13:27,499 INFO L87 Difference]: Start difference. First operand 324 states and 373 transitions. Second operand 16 states. [2018-11-18 12:13:28,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:28,520 INFO L93 Difference]: Finished difference Result 691 states and 755 transitions. [2018-11-18 12:13:28,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-18 12:13:28,521 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2018-11-18 12:13:28,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:28,522 INFO L225 Difference]: With dead ends: 691 [2018-11-18 12:13:28,522 INFO L226 Difference]: Without dead ends: 691 [2018-11-18 12:13:28,523 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=371, Invalid=1035, Unknown=0, NotChecked=0, Total=1406 [2018-11-18 12:13:28,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2018-11-18 12:13:28,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 331. [2018-11-18 12:13:28,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-11-18 12:13:28,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 379 transitions. [2018-11-18 12:13:28,528 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 379 transitions. Word has length 45 [2018-11-18 12:13:28,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:28,529 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 379 transitions. [2018-11-18 12:13:28,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 12:13:28,529 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 379 transitions. [2018-11-18 12:13:28,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 12:13:28,530 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:28,530 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:13:28,530 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr36REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 12:13:28,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:28,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1353229458, now seen corresponding path program 1 times [2018-11-18 12:13:28,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:28,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:28,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:28,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:28,532 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:28,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 12:13:28,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:13:28,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 12:13:28,585 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:13:28,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 12:13:28,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 12:13:28,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:13:28,586 INFO L87 Difference]: Start difference. First operand 331 states and 379 transitions. Second operand 7 states. [2018-11-18 12:13:28,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:28,707 INFO L93 Difference]: Finished difference Result 347 states and 395 transitions. [2018-11-18 12:13:28,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 12:13:28,708 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-11-18 12:13:28,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:28,709 INFO L225 Difference]: With dead ends: 347 [2018-11-18 12:13:28,709 INFO L226 Difference]: Without dead ends: 347 [2018-11-18 12:13:28,709 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:13:28,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-11-18 12:13:28,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 343. [2018-11-18 12:13:28,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-11-18 12:13:28,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 391 transitions. [2018-11-18 12:13:28,714 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 391 transitions. Word has length 52 [2018-11-18 12:13:28,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:28,714 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 391 transitions. [2018-11-18 12:13:28,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 12:13:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 391 transitions. [2018-11-18 12:13:28,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 12:13:28,714 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:28,715 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:13:28,715 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr36REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 12:13:28,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:28,715 INFO L82 PathProgramCache]: Analyzing trace with hash -87377192, now seen corresponding path program 1 times [2018-11-18 12:13:28,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:28,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:28,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:28,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:28,717 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:28,857 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:28,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:13:28,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:13:28,857 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 55 with the following transitions: [2018-11-18 12:13:28,859 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [12], [17], [21], [27], [30], [31], [56], [57], [60], [65], [66], [69], [75], [79], [85], [89], [91], [94], [203], [207], [212], [216], [224], [228], [230], [231], [234], [238], [242], [327], [332], [336], [342], [345], [351], [357], [358], [359], [361], [428], [430], [433], [435], [437], [444], [445], [446] [2018-11-18 12:13:28,861 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:13:28,861 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:13:28,945 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 12:13:28,945 INFO L272 AbstractInterpreter]: Visited 51 different actions 72 times. Merged at 20 different actions 20 times. Never widened. Performed 392 root evaluator evaluations with a maximum evaluation depth of 3. Performed 392 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 36 variables. [2018-11-18 12:13:28,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:28,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 12:13:28,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:13:28,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6617d65d-9a31-4ce4-961b-a6fabbb0fbfa/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:13:28,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:28,966 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 12:13:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:28,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:13:29,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 12:13:29,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 12:13:29,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:13:29,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:13:29,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 12:13:29,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 12:13:29,020 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:13:29,022 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:13:29,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:13:29,028 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-11-18 12:13:29,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-18 12:13:29,204 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:13:29,213 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:13:29,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2018-11-18 12:13:29,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 12:13:29,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:13:29,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-18 12:13:29,255 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:13:29,257 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:13:29,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2018-11-18 12:13:29,263 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-18 12:13:29,274 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:13:29,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:13:29,285 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:18 [2018-11-18 12:13:29,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:29,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:13:29,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:29,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 12:13:29,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 10] total 23 [2018-11-18 12:13:29,526 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 12:13:29,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 12:13:29,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 12:13:29,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2018-11-18 12:13:29,527 INFO L87 Difference]: Start difference. First operand 343 states and 391 transitions. Second operand 17 states. [2018-11-18 12:13:30,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:13:30,486 INFO L93 Difference]: Finished difference Result 632 states and 681 transitions. [2018-11-18 12:13:30,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-18 12:13:30,487 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2018-11-18 12:13:30,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:13:30,488 INFO L225 Difference]: With dead ends: 632 [2018-11-18 12:13:30,488 INFO L226 Difference]: Without dead ends: 632 [2018-11-18 12:13:30,489 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 94 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=332, Invalid=1560, Unknown=0, NotChecked=0, Total=1892 [2018-11-18 12:13:30,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-11-18 12:13:30,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 371. [2018-11-18 12:13:30,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-11-18 12:13:30,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 426 transitions. [2018-11-18 12:13:30,494 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 426 transitions. Word has length 54 [2018-11-18 12:13:30,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:13:30,494 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 426 transitions. [2018-11-18 12:13:30,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 12:13:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 426 transitions. [2018-11-18 12:13:30,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 12:13:30,495 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:13:30,495 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:13:30,495 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr36REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr42REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-11-18 12:13:30,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:30,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1617149072, now seen corresponding path program 1 times [2018-11-18 12:13:30,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:13:30,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:30,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:13:30,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:13:30,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:13:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:13:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:13:30,531 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 12:13:30,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 12:13:30 BoogieIcfgContainer [2018-11-18 12:13:30,565 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 12:13:30,565 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:13:30,565 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:13:30,565 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:13:30,566 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:13:19" (3/4) ... [2018-11-18 12:13:30,569 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 12:13:30,609 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6617d65d-9a31-4ce4-961b-a6fabbb0fbfa/bin-2019/utaipan/witness.graphml [2018-11-18 12:13:30,609 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:13:30,610 INFO L168 Benchmark]: Toolchain (without parser) took 11770.23 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 293.6 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -128.4 MB). Peak memory consumption was 165.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:13:30,611 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:13:30,611 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:13:30,611 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:13:30,611 INFO L168 Benchmark]: Boogie Preprocessor took 31.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:13:30,612 INFO L168 Benchmark]: RCFGBuilder took 493.37 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: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. [2018-11-18 12:13:30,612 INFO L168 Benchmark]: TraceAbstraction took 10830.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 151.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.0 MB). Peak memory consumption was 141.0 MB. Max. memory is 11.5 GB. [2018-11-18 12:13:30,612 INFO L168 Benchmark]: Witness Printer took 44.16 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2018-11-18 12:13:30,613 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 344.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.83 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 493.37 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: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10830.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 151.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.0 MB). Peak memory consumption was 141.0 MB. Max. memory is 11.5 GB. * Witness Printer took 44.16 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1029]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L991] EXPR, FCALL malloc(sizeof(SLL)) [L991] SLL* list = malloc(sizeof(SLL)); VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L992] FCALL list->next = ((void*)0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] EXPR, FCALL malloc(sizeof(SLL)) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L993] FCALL list->inner = malloc(sizeof(SLL)) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L993] EXPR, FCALL list->inner VAL [list={10:0}, list->inner={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L993] FCALL list->inner->next = ((void*)0) VAL [list={10:0}, list->inner={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L993] EXPR, FCALL list->inner VAL [list={10:0}, list->inner={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L993] FCALL list->inner->inner = ((void*)0) VAL [list={10:0}, list->inner={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L993] EXPR, FCALL list->inner VAL [list={10:0}, list->inner={12:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={10:0}, list->inner={12:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L993] COND FALSE !(0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L995] SLL* end = list; VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1012] COND FALSE !(0) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; VAL [end={10:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1017] EXPR, FCALL end->inner VAL [end={10:0}, end->inner={12:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={10:0}, inner={12:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={10:0}, inner={12:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={10:0}, inner={12:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1024] COND FALSE !(0) VAL [end={10:0}, inner={12:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1025] EXPR, FCALL inner->inner VAL [end={10:0}, inner={12:0}, inner->inner={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1025] COND FALSE !(0) VAL [end={10:0}, inner={12:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1026] EXPR, FCALL inner->next VAL [end={10:0}, inner={12:0}, inner->next={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1026] COND FALSE !(0) VAL [end={10:0}, inner={12:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1027] EXPR, FCALL inner->inner VAL [end={10:0}, inner={12:0}, inner->inner={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1027] inner = inner->inner [L1028] COND TRUE len == 1 VAL [end={10:0}, inner={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1029] FCALL inner->inner - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 184 locations, 65 error locations. UNSAFE Result, 10.7s OverallTime, 23 OverallIterations, 2 TraceHistogramMax, 7.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3550 SDtfs, 6917 SDslu, 12003 SDs, 0 SdLazy, 8420 SolverSat, 458 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 471 GetRequests, 200 SyntacticMatches, 20 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=371occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 2456 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 847 NumberOfCodeBlocks, 847 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 863 ConstructedInterpolants, 9 QuantifiedInterpolants, 407272 SizeOfPredicates, 24 NumberOfNonLiveVariables, 315 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 26 InterpolantComputations, 20 PerfectInterpolantSequences, 8/26 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...