./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b6b3d7c4-5ad5-440b-806a-66784cea29e5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b6b3d7c4-5ad5-440b-806a-66784cea29e5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b6b3d7c4-5ad5-440b-806a-66784cea29e5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b6b3d7c4-5ad5-440b-806a-66784cea29e5/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_b6b3d7c4-5ad5-440b-806a-66784cea29e5/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b6b3d7c4-5ad5-440b-806a-66784cea29e5/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-635dfa2 [2018-12-09 19:29:53,786 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:29:53,787 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:29:53,793 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:29:53,793 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:29:53,794 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:29:53,794 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:29:53,795 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:29:53,796 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:29:53,796 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:29:53,796 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:29:53,797 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:29:53,797 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:29:53,797 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:29:53,798 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:29:53,798 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:29:53,799 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:29:53,799 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:29:53,800 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:29:53,801 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:29:53,802 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:29:53,802 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:29:53,803 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:29:53,803 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:29:53,803 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:29:53,804 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:29:53,804 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:29:53,805 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:29:53,805 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:29:53,805 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:29:53,806 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:29:53,806 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:29:53,806 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:29:53,806 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:29:53,806 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:29:53,807 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:29:53,807 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b6b3d7c4-5ad5-440b-806a-66784cea29e5/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 19:29:53,814 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:29:53,814 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:29:53,814 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:29:53,815 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:29:53,815 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:29:53,815 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:29:53,815 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:29:53,815 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:29:53,815 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:29:53,815 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:29:53,815 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:29:53,815 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:29:53,815 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:29:53,816 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 19:29:53,816 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 19:29:53,816 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:29:53,816 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:29:53,816 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 19:29:53,816 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:29:53,816 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:29:53,816 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:29:53,816 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 19:29:53,817 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 19:29:53,817 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 19:29:53,817 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:29:53,817 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:29:53,817 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:29:53,817 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:29:53,817 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:29:53,817 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:29:53,817 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:29:53,817 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:29:53,818 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:29:53,818 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:29:53,818 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:29:53,818 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:29:53,818 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_b6b3d7c4-5ad5-440b-806a-66784cea29e5/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-12-09 19:29:53,836 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:29:53,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:29:53,847 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:29:53,848 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:29:53,848 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:29:53,849 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b6b3d7c4-5ad5-440b-806a-66784cea29e5/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-12-09 19:29:53,884 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b6b3d7c4-5ad5-440b-806a-66784cea29e5/bin-2019/utaipan/data/36f367905/38a2f7eb1d4d48b194ccbaac79e75a8b/FLAGe49ebb355 [2018-12-09 19:29:54,341 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:29:54,341 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b6b3d7c4-5ad5-440b-806a-66784cea29e5/sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-12-09 19:29:54,348 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b6b3d7c4-5ad5-440b-806a-66784cea29e5/bin-2019/utaipan/data/36f367905/38a2f7eb1d4d48b194ccbaac79e75a8b/FLAGe49ebb355 [2018-12-09 19:29:54,356 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b6b3d7c4-5ad5-440b-806a-66784cea29e5/bin-2019/utaipan/data/36f367905/38a2f7eb1d4d48b194ccbaac79e75a8b [2018-12-09 19:29:54,357 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:29:54,358 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:29:54,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:29:54,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:29:54,361 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:29:54,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:29:54" (1/1) ... [2018-12-09 19:29:54,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a04c23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:29:54, skipping insertion in model container [2018-12-09 19:29:54,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:29:54" (1/1) ... [2018-12-09 19:29:54,370 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:29:54,398 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:29:54,551 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:29:54,586 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:29:54,615 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:29:54,635 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:29:54,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:29:54 WrapperNode [2018-12-09 19:29:54,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:29:54,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:29:54,636 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:29:54,636 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:29:54,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:29:54" (1/1) ... [2018-12-09 19:29:54,650 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:29:54" (1/1) ... [2018-12-09 19:29:54,655 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:29:54,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:29:54,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:29:54,655 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:29:54,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:29:54" (1/1) ... [2018-12-09 19:29:54,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:29:54" (1/1) ... [2018-12-09 19:29:54,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:29:54" (1/1) ... [2018-12-09 19:29:54,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:29:54" (1/1) ... [2018-12-09 19:29:54,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:29:54" (1/1) ... [2018-12-09 19:29:54,678 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:29:54" (1/1) ... [2018-12-09 19:29:54,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:29:54" (1/1) ... [2018-12-09 19:29:54,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:29:54,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:29:54,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:29:54,681 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:29:54,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:29:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6b3d7c4-5ad5-440b-806a-66784cea29e5/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:29:54,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 19:29:54,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 19:29:54,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 19:29:54,715 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 19:29:54,715 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 19:29:54,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 19:29:54,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 19:29:54,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 19:29:54,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:29:54,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:29:55,040 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:29:55,040 INFO L280 CfgBuilder]: Removed 30 assue(true) statements. [2018-12-09 19:29:55,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:29:55 BoogieIcfgContainer [2018-12-09 19:29:55,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:29:55,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:29:55,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:29:55,043 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:29:55,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:29:54" (1/3) ... [2018-12-09 19:29:55,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb5c73e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:29:55, skipping insertion in model container [2018-12-09 19:29:55,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:29:54" (2/3) ... [2018-12-09 19:29:55,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb5c73e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:29:55, skipping insertion in model container [2018-12-09 19:29:55,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:29:55" (3/3) ... [2018-12-09 19:29:55,045 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-12-09 19:29:55,050 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:29:55,055 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-12-09 19:29:55,063 INFO L257 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2018-12-09 19:29:55,078 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:29:55,078 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 19:29:55,079 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:29:55,079 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:29:55,079 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:29:55,079 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:29:55,079 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:29:55,079 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:29:55,090 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states. [2018-12-09 19:29:55,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-09 19:29:55,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:55,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:29:55,097 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr51REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-12-09 19:29:55,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:55,100 INFO L82 PathProgramCache]: Analyzing trace with hash -184166463, now seen corresponding path program 1 times [2018-12-09 19:29:55,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:55,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:55,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:55,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:55,133 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:55,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:55,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:55,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:29:55,188 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:55,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:29:55,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:29:55,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:29:55,201 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 3 states. [2018-12-09 19:29:55,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:55,313 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2018-12-09 19:29:55,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:29:55,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-09 19:29:55,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:55,320 INFO L225 Difference]: With dead ends: 168 [2018-12-09 19:29:55,320 INFO L226 Difference]: Without dead ends: 164 [2018-12-09 19:29:55,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:29:55,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-09 19:29:55,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 159. [2018-12-09 19:29:55,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-09 19:29:55,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 172 transitions. [2018-12-09 19:29:55,348 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 172 transitions. Word has length 7 [2018-12-09 19:29:55,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:55,348 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 172 transitions. [2018-12-09 19:29:55,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:29:55,348 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 172 transitions. [2018-12-09 19:29:55,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-09 19:29:55,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:55,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:29:55,349 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr51REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-12-09 19:29:55,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:55,349 INFO L82 PathProgramCache]: Analyzing trace with hash -184166462, now seen corresponding path program 1 times [2018-12-09 19:29:55,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:55,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:55,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:55,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:55,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:55,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:55,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:55,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:29:55,372 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:55,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:29:55,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:29:55,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:29:55,373 INFO L87 Difference]: Start difference. First operand 159 states and 172 transitions. Second operand 3 states. [2018-12-09 19:29:55,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:55,449 INFO L93 Difference]: Finished difference Result 179 states and 191 transitions. [2018-12-09 19:29:55,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:29:55,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-09 19:29:55,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:55,451 INFO L225 Difference]: With dead ends: 179 [2018-12-09 19:29:55,451 INFO L226 Difference]: Without dead ends: 179 [2018-12-09 19:29:55,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:29:55,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-09 19:29:55,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 168. [2018-12-09 19:29:55,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-09 19:29:55,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 188 transitions. [2018-12-09 19:29:55,462 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 188 transitions. Word has length 7 [2018-12-09 19:29:55,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:55,462 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 188 transitions. [2018-12-09 19:29:55,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:29:55,462 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 188 transitions. [2018-12-09 19:29:55,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 19:29:55,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:55,463 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:29:55,463 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr51REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-12-09 19:29:55,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:55,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1025482534, now seen corresponding path program 1 times [2018-12-09 19:29:55,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:55,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:55,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:55,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:55,466 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:55,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:55,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:55,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:29:55,514 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:55,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:29:55,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:29:55,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:29:55,515 INFO L87 Difference]: Start difference. First operand 168 states and 188 transitions. Second operand 5 states. [2018-12-09 19:29:55,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:55,750 INFO L93 Difference]: Finished difference Result 288 states and 317 transitions. [2018-12-09 19:29:55,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:29:55,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-09 19:29:55,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:55,751 INFO L225 Difference]: With dead ends: 288 [2018-12-09 19:29:55,751 INFO L226 Difference]: Without dead ends: 288 [2018-12-09 19:29:55,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:29:55,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-12-09 19:29:55,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 167. [2018-12-09 19:29:55,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-09 19:29:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 187 transitions. [2018-12-09 19:29:55,758 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 187 transitions. Word has length 14 [2018-12-09 19:29:55,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:55,758 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 187 transitions. [2018-12-09 19:29:55,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:29:55,758 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 187 transitions. [2018-12-09 19:29:55,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 19:29:55,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:55,758 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:29:55,759 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr51REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-12-09 19:29:55,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:55,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1025482533, now seen corresponding path program 1 times [2018-12-09 19:29:55,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:55,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:55,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:55,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:55,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:55,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:55,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:55,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:29:55,805 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:55,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:29:55,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:29:55,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:29:55,806 INFO L87 Difference]: Start difference. First operand 167 states and 187 transitions. Second operand 5 states. [2018-12-09 19:29:56,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:56,042 INFO L93 Difference]: Finished difference Result 311 states and 350 transitions. [2018-12-09 19:29:56,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:29:56,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-09 19:29:56,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:56,043 INFO L225 Difference]: With dead ends: 311 [2018-12-09 19:29:56,043 INFO L226 Difference]: Without dead ends: 311 [2018-12-09 19:29:56,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:29:56,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-12-09 19:29:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 166. [2018-12-09 19:29:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-09 19:29:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 186 transitions. [2018-12-09 19:29:56,049 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 186 transitions. Word has length 14 [2018-12-09 19:29:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:56,049 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 186 transitions. [2018-12-09 19:29:56,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:29:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 186 transitions. [2018-12-09 19:29:56,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 19:29:56,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:56,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:29:56,050 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr51REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-12-09 19:29:56,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:56,050 INFO L82 PathProgramCache]: Analyzing trace with hash -47781002, now seen corresponding path program 1 times [2018-12-09 19:29:56,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:56,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:56,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:56,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:56,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:56,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:56,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:29:56,124 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:56,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:29:56,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:29:56,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:29:56,125 INFO L87 Difference]: Start difference. First operand 166 states and 186 transitions. Second operand 8 states. [2018-12-09 19:29:56,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:56,579 INFO L93 Difference]: Finished difference Result 290 states and 317 transitions. [2018-12-09 19:29:56,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:29:56,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-12-09 19:29:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:56,580 INFO L225 Difference]: With dead ends: 290 [2018-12-09 19:29:56,581 INFO L226 Difference]: Without dead ends: 290 [2018-12-09 19:29:56,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 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-12-09 19:29:56,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-12-09 19:29:56,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 165. [2018-12-09 19:29:56,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-09 19:29:56,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 185 transitions. [2018-12-09 19:29:56,586 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 185 transitions. Word has length 17 [2018-12-09 19:29:56,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:56,587 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 185 transitions. [2018-12-09 19:29:56,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:29:56,587 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 185 transitions. [2018-12-09 19:29:56,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 19:29:56,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:56,587 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:29:56,588 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr51REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-12-09 19:29:56,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:56,588 INFO L82 PathProgramCache]: Analyzing trace with hash -47781001, now seen corresponding path program 1 times [2018-12-09 19:29:56,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:56,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:56,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:56,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:56,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:56,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:56,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:56,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:29:56,675 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:56,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:29:56,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:29:56,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:29:56,675 INFO L87 Difference]: Start difference. First operand 165 states and 185 transitions. Second operand 8 states. [2018-12-09 19:29:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:57,227 INFO L93 Difference]: Finished difference Result 291 states and 318 transitions. [2018-12-09 19:29:57,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:29:57,228 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-12-09 19:29:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:57,229 INFO L225 Difference]: With dead ends: 291 [2018-12-09 19:29:57,229 INFO L226 Difference]: Without dead ends: 291 [2018-12-09 19:29:57,229 INFO L631 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-12-09 19:29:57,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-12-09 19:29:57,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 164. [2018-12-09 19:29:57,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-09 19:29:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 184 transitions. [2018-12-09 19:29:57,234 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 184 transitions. Word has length 17 [2018-12-09 19:29:57,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:57,234 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 184 transitions. [2018-12-09 19:29:57,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:29:57,234 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 184 transitions. [2018-12-09 19:29:57,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 19:29:57,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:57,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:29:57,235 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr51REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-12-09 19:29:57,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:57,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1248642546, now seen corresponding path program 1 times [2018-12-09 19:29:57,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:57,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:57,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:57,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:57,237 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:57,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:57,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:57,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:29:57,274 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:57,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:29:57,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:29:57,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:29:57,274 INFO L87 Difference]: Start difference. First operand 164 states and 184 transitions. Second operand 5 states. [2018-12-09 19:29:57,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:57,350 INFO L93 Difference]: Finished difference Result 243 states and 269 transitions. [2018-12-09 19:29:57,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:29:57,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-12-09 19:29:57,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:57,351 INFO L225 Difference]: With dead ends: 243 [2018-12-09 19:29:57,351 INFO L226 Difference]: Without dead ends: 243 [2018-12-09 19:29:57,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:29:57,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-12-09 19:29:57,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 167. [2018-12-09 19:29:57,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-09 19:29:57,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 187 transitions. [2018-12-09 19:29:57,354 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 187 transitions. Word has length 21 [2018-12-09 19:29:57,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:57,354 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 187 transitions. [2018-12-09 19:29:57,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:29:57,354 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 187 transitions. [2018-12-09 19:29:57,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 19:29:57,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:57,355 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:29:57,355 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr51REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-12-09 19:29:57,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:57,356 INFO L82 PathProgramCache]: Analyzing trace with hash -27278093, now seen corresponding path program 1 times [2018-12-09 19:29:57,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:57,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:57,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:57,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:57,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:57,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:57,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:57,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:29:57,392 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:57,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:29:57,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:29:57,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:29:57,393 INFO L87 Difference]: Start difference. First operand 167 states and 187 transitions. Second operand 4 states. [2018-12-09 19:29:57,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:57,504 INFO L93 Difference]: Finished difference Result 169 states and 186 transitions. [2018-12-09 19:29:57,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:29:57,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-12-09 19:29:57,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:57,505 INFO L225 Difference]: With dead ends: 169 [2018-12-09 19:29:57,505 INFO L226 Difference]: Without dead ends: 169 [2018-12-09 19:29:57,505 INFO L631 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-12-09 19:29:57,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-09 19:29:57,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 158. [2018-12-09 19:29:57,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-09 19:29:57,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 178 transitions. [2018-12-09 19:29:57,507 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 178 transitions. Word has length 23 [2018-12-09 19:29:57,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:57,508 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 178 transitions. [2018-12-09 19:29:57,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:29:57,508 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 178 transitions. [2018-12-09 19:29:57,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 19:29:57,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:57,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:29:57,509 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr51REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-12-09 19:29:57,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:57,509 INFO L82 PathProgramCache]: Analyzing trace with hash -27278092, now seen corresponding path program 1 times [2018-12-09 19:29:57,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:57,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:57,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:57,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:57,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:57,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:57,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:57,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:29:57,539 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:57,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:29:57,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:29:57,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:29:57,539 INFO L87 Difference]: Start difference. First operand 158 states and 178 transitions. Second operand 4 states. [2018-12-09 19:29:57,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:57,637 INFO L93 Difference]: Finished difference Result 207 states and 224 transitions. [2018-12-09 19:29:57,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:29:57,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-12-09 19:29:57,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:57,638 INFO L225 Difference]: With dead ends: 207 [2018-12-09 19:29:57,638 INFO L226 Difference]: Without dead ends: 207 [2018-12-09 19:29:57,638 INFO L631 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-12-09 19:29:57,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-09 19:29:57,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2018-12-09 19:29:57,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-09 19:29:57,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 212 transitions. [2018-12-09 19:29:57,642 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 212 transitions. Word has length 23 [2018-12-09 19:29:57,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:57,642 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 212 transitions. [2018-12-09 19:29:57,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:29:57,642 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 212 transitions. [2018-12-09 19:29:57,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 19:29:57,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:57,643 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:29:57,643 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr51REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-12-09 19:29:57,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:57,643 INFO L82 PathProgramCache]: Analyzing trace with hash -892784977, now seen corresponding path program 1 times [2018-12-09 19:29:57,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:57,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:57,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:57,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:57,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:57,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:57,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:57,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:29:57,688 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:57,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:29:57,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:29:57,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:29:57,689 INFO L87 Difference]: Start difference. First operand 181 states and 212 transitions. Second operand 6 states. [2018-12-09 19:29:57,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:57,875 INFO L93 Difference]: Finished difference Result 262 states and 310 transitions. [2018-12-09 19:29:57,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:29:57,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-09 19:29:57,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:57,877 INFO L225 Difference]: With dead ends: 262 [2018-12-09 19:29:57,877 INFO L226 Difference]: Without dead ends: 262 [2018-12-09 19:29:57,877 INFO L631 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-12-09 19:29:57,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-12-09 19:29:57,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 180. [2018-12-09 19:29:57,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-09 19:29:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 211 transitions. [2018-12-09 19:29:57,881 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 211 transitions. Word has length 26 [2018-12-09 19:29:57,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:57,881 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 211 transitions. [2018-12-09 19:29:57,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:29:57,882 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 211 transitions. [2018-12-09 19:29:57,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 19:29:57,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:57,882 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:29:57,882 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr51REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-12-09 19:29:57,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:57,883 INFO L82 PathProgramCache]: Analyzing trace with hash -892784976, now seen corresponding path program 1 times [2018-12-09 19:29:57,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:57,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:57,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:57,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:57,884 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:57,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:57,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:57,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:29:57,937 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:57,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:29:57,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:29:57,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:29:57,938 INFO L87 Difference]: Start difference. First operand 180 states and 211 transitions. Second operand 6 states. [2018-12-09 19:29:58,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:58,184 INFO L93 Difference]: Finished difference Result 278 states and 334 transitions. [2018-12-09 19:29:58,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:29:58,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-09 19:29:58,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:58,185 INFO L225 Difference]: With dead ends: 278 [2018-12-09 19:29:58,186 INFO L226 Difference]: Without dead ends: 278 [2018-12-09 19:29:58,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:29:58,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-09 19:29:58,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 167. [2018-12-09 19:29:58,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-09 19:29:58,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 197 transitions. [2018-12-09 19:29:58,192 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 197 transitions. Word has length 26 [2018-12-09 19:29:58,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:58,192 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 197 transitions. [2018-12-09 19:29:58,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:29:58,193 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 197 transitions. [2018-12-09 19:29:58,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 19:29:58,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:58,193 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:29:58,194 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr51REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-12-09 19:29:58,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:58,194 INFO L82 PathProgramCache]: Analyzing trace with hash -46669965, now seen corresponding path program 1 times [2018-12-09 19:29:58,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:58,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:58,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:58,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:58,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:58,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:58,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:58,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:29:58,225 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:58,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:29:58,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:29:58,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:29:58,225 INFO L87 Difference]: Start difference. First operand 167 states and 197 transitions. Second operand 4 states. [2018-12-09 19:29:58,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:58,287 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2018-12-09 19:29:58,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:29:58,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-12-09 19:29:58,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:58,288 INFO L225 Difference]: With dead ends: 188 [2018-12-09 19:29:58,288 INFO L226 Difference]: Without dead ends: 188 [2018-12-09 19:29:58,288 INFO L631 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-12-09 19:29:58,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-12-09 19:29:58,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 167. [2018-12-09 19:29:58,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-09 19:29:58,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 195 transitions. [2018-12-09 19:29:58,291 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 195 transitions. Word has length 29 [2018-12-09 19:29:58,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:58,291 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 195 transitions. [2018-12-09 19:29:58,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:29:58,291 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 195 transitions. [2018-12-09 19:29:58,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 19:29:58,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:58,292 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:29:58,292 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr51REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-12-09 19:29:58,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:58,292 INFO L82 PathProgramCache]: Analyzing trace with hash -937459016, now seen corresponding path program 1 times [2018-12-09 19:29:58,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:58,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:58,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:58,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:58,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:58,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:58,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:58,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 19:29:58,349 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:58,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:29:58,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:29:58,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:29:58,350 INFO L87 Difference]: Start difference. First operand 167 states and 195 transitions. Second operand 8 states. [2018-12-09 19:29:58,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:58,549 INFO L93 Difference]: Finished difference Result 254 states and 290 transitions. [2018-12-09 19:29:58,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:29:58,549 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-12-09 19:29:58,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:58,550 INFO L225 Difference]: With dead ends: 254 [2018-12-09 19:29:58,550 INFO L226 Difference]: Without dead ends: 254 [2018-12-09 19:29:58,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:29:58,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-12-09 19:29:58,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 179. [2018-12-09 19:29:58,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-12-09 19:29:58,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 208 transitions. [2018-12-09 19:29:58,552 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 208 transitions. Word has length 33 [2018-12-09 19:29:58,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:58,552 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 208 transitions. [2018-12-09 19:29:58,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:29:58,553 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 208 transitions. [2018-12-09 19:29:58,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 19:29:58,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:58,553 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:29:58,554 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr51REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-12-09 19:29:58,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:58,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1571824717, now seen corresponding path program 1 times [2018-12-09 19:29:58,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:58,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:58,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:58,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:58,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:58,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:58,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:29:58,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:29:58,627 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-12-09 19:29:58,628 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [6], [16], [20], [25], [28], [29], [54], [57], [62], [63], [66], [72], [76], [81], [86], [89], [192], [200], [204], [216], [217], [218], [220], [227], [310], [314], [319], [322], [414], [415], [416] [2018-12-09 19:29:58,656 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:29:58,656 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:29:58,778 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:29:58,779 INFO L272 AbstractInterpreter]: Visited 34 different actions 43 times. Merged at 9 different actions 9 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-12-09 19:29:58,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:58,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:29:58,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:29:58,786 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6b3d7c4-5ad5-440b-806a-66784cea29e5/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:29:58,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:58,793 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:29:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:58,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:29:58,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 19:29:58,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 19:29:58,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:58,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:58,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 19:29:58,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 19:29:58,860 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:58,862 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:58,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:58,866 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-12-09 19:29:58,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-09 19:29:58,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:58,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 19:29:58,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:58,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:58,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-09 19:29:58,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:58,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 19:29:58,916 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:58,919 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:58,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:58,925 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-12-09 19:29:58,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-09 19:29:58,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:58,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-09 19:29:58,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:58,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:58,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-09 19:29:58,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:29:58,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-09 19:29:58,971 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:58,973 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:58,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:58,979 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:7 [2018-12-09 19:29:58,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:58,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:29:59,006 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 19:29:59,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:59,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:59,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:1 [2018-12-09 19:29:59,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:59,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:29:59,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 10 [2018-12-09 19:29:59,026 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:29:59,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:29:59,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:29:59,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:29:59,027 INFO L87 Difference]: Start difference. First operand 179 states and 208 transitions. Second operand 10 states. [2018-12-09 19:29:59,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:59,321 INFO L93 Difference]: Finished difference Result 289 states and 320 transitions. [2018-12-09 19:29:59,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:29:59,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-12-09 19:29:59,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:59,322 INFO L225 Difference]: With dead ends: 289 [2018-12-09 19:29:59,323 INFO L226 Difference]: Without dead ends: 289 [2018-12-09 19:29:59,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-12-09 19:29:59,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-12-09 19:29:59,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 207. [2018-12-09 19:29:59,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-12-09 19:29:59,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 248 transitions. [2018-12-09 19:29:59,326 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 248 transitions. Word has length 35 [2018-12-09 19:29:59,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:59,327 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 248 transitions. [2018-12-09 19:29:59,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:29:59,327 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 248 transitions. [2018-12-09 19:29:59,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 19:29:59,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:59,328 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:29:59,328 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr51REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-12-09 19:29:59,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:59,328 INFO L82 PathProgramCache]: Analyzing trace with hash 10682228, now seen corresponding path program 1 times [2018-12-09 19:29:59,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:59,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:59,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:59,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:59,330 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:59,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:59,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:59,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:29:59,360 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:59,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:29:59,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:29:59,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:29:59,361 INFO L87 Difference]: Start difference. First operand 207 states and 248 transitions. Second operand 5 states. [2018-12-09 19:29:59,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:59,500 INFO L93 Difference]: Finished difference Result 305 states and 365 transitions. [2018-12-09 19:29:59,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:29:59,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-12-09 19:29:59,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:59,500 INFO L225 Difference]: With dead ends: 305 [2018-12-09 19:29:59,500 INFO L226 Difference]: Without dead ends: 305 [2018-12-09 19:29:59,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:29:59,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-09 19:29:59,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 206. [2018-12-09 19:29:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-09 19:29:59,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 247 transitions. [2018-12-09 19:29:59,503 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 247 transitions. Word has length 35 [2018-12-09 19:29:59,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:59,504 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 247 transitions. [2018-12-09 19:29:59,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:29:59,504 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 247 transitions. [2018-12-09 19:29:59,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 19:29:59,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:59,504 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:29:59,505 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr51REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-12-09 19:29:59,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:59,505 INFO L82 PathProgramCache]: Analyzing trace with hash 10682229, now seen corresponding path program 1 times [2018-12-09 19:29:59,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:59,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:59,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:59,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:59,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:59,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:59,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:59,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:29:59,543 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:59,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:29:59,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:29:59,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:29:59,544 INFO L87 Difference]: Start difference. First operand 206 states and 247 transitions. Second operand 5 states. [2018-12-09 19:29:59,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:59,693 INFO L93 Difference]: Finished difference Result 331 states and 398 transitions. [2018-12-09 19:29:59,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:29:59,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-12-09 19:29:59,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:59,694 INFO L225 Difference]: With dead ends: 331 [2018-12-09 19:29:59,694 INFO L226 Difference]: Without dead ends: 331 [2018-12-09 19:29:59,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:29:59,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-12-09 19:29:59,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 205. [2018-12-09 19:29:59,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-09 19:29:59,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 246 transitions. [2018-12-09 19:29:59,698 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 246 transitions. Word has length 35 [2018-12-09 19:29:59,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:59,698 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 246 transitions. [2018-12-09 19:29:59,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:29:59,698 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 246 transitions. [2018-12-09 19:29:59,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 19:29:59,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:59,699 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:29:59,699 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr51REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-12-09 19:29:59,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:59,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1952986220, now seen corresponding path program 1 times [2018-12-09 19:29:59,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:59,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:59,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:59,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:59,700 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:59,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:59,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:59,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 19:29:59,797 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:59,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:29:59,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:29:59,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:29:59,797 INFO L87 Difference]: Start difference. First operand 205 states and 246 transitions. Second operand 11 states. [2018-12-09 19:30:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:30:00,295 INFO L93 Difference]: Finished difference Result 393 states and 445 transitions. [2018-12-09 19:30:00,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:30:00,295 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-12-09 19:30:00,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:30:00,297 INFO L225 Difference]: With dead ends: 393 [2018-12-09 19:30:00,297 INFO L226 Difference]: Without dead ends: 393 [2018-12-09 19:30:00,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-12-09 19:30:00,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-12-09 19:30:00,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 208. [2018-12-09 19:30:00,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-12-09 19:30:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 248 transitions. [2018-12-09 19:30:00,301 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 248 transitions. Word has length 37 [2018-12-09 19:30:00,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:30:00,301 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 248 transitions. [2018-12-09 19:30:00,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:30:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 248 transitions. [2018-12-09 19:30:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 19:30:00,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:30:00,302 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:30:00,302 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr51REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-12-09 19:30:00,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:30:00,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1952986221, now seen corresponding path program 1 times [2018-12-09 19:30:00,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:30:00,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:30:00,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:30:00,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:30:00,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:30:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:30:00,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:30:00,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:30:00,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 19:30:00,423 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:30:00,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:30:00,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:30:00,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:30:00,424 INFO L87 Difference]: Start difference. First operand 208 states and 248 transitions. Second operand 11 states. [2018-12-09 19:30:01,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:30:01,006 INFO L93 Difference]: Finished difference Result 437 states and 490 transitions. [2018-12-09 19:30:01,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 19:30:01,006 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-12-09 19:30:01,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:30:01,007 INFO L225 Difference]: With dead ends: 437 [2018-12-09 19:30:01,007 INFO L226 Difference]: Without dead ends: 437 [2018-12-09 19:30:01,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2018-12-09 19:30:01,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-12-09 19:30:01,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 214. [2018-12-09 19:30:01,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-12-09 19:30:01,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 253 transitions. [2018-12-09 19:30:01,010 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 253 transitions. Word has length 37 [2018-12-09 19:30:01,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:30:01,011 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 253 transitions. [2018-12-09 19:30:01,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:30:01,011 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 253 transitions. [2018-12-09 19:30:01,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 19:30:01,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:30:01,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:30:01,011 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr51REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-12-09 19:30:01,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:30:01,011 INFO L82 PathProgramCache]: Analyzing trace with hash 406794632, now seen corresponding path program 1 times [2018-12-09 19:30:01,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:30:01,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:30:01,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:30:01,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:30:01,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:30:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:30:01,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:30:01,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:30:01,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:30:01,073 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:30:01,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:30:01,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:30:01,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:30:01,073 INFO L87 Difference]: Start difference. First operand 214 states and 253 transitions. Second operand 8 states. [2018-12-09 19:30:01,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:30:01,283 INFO L93 Difference]: Finished difference Result 227 states and 268 transitions. [2018-12-09 19:30:01,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:30:01,283 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-12-09 19:30:01,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:30:01,284 INFO L225 Difference]: With dead ends: 227 [2018-12-09 19:30:01,284 INFO L226 Difference]: Without dead ends: 227 [2018-12-09 19:30:01,284 INFO L631 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-12-09 19:30:01,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-12-09 19:30:01,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 213. [2018-12-09 19:30:01,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-09 19:30:01,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 252 transitions. [2018-12-09 19:30:01,287 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 252 transitions. Word has length 38 [2018-12-09 19:30:01,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:30:01,288 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 252 transitions. [2018-12-09 19:30:01,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:30:01,288 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 252 transitions. [2018-12-09 19:30:01,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 19:30:01,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:30:01,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:30:01,289 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr51REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-12-09 19:30:01,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:30:01,289 INFO L82 PathProgramCache]: Analyzing trace with hash 406794633, now seen corresponding path program 1 times [2018-12-09 19:30:01,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:30:01,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:30:01,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:30:01,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:30:01,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:30:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:30:01,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:30:01,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:30:01,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:30:01,365 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:30:01,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:30:01,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:30:01,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:30:01,365 INFO L87 Difference]: Start difference. First operand 213 states and 252 transitions. Second operand 8 states. [2018-12-09 19:30:01,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:30:01,883 INFO L93 Difference]: Finished difference Result 226 states and 267 transitions. [2018-12-09 19:30:01,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:30:01,884 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-12-09 19:30:01,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:30:01,885 INFO L225 Difference]: With dead ends: 226 [2018-12-09 19:30:01,885 INFO L226 Difference]: Without dead ends: 226 [2018-12-09 19:30:01,885 INFO L631 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-12-09 19:30:01,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-12-09 19:30:01,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 212. [2018-12-09 19:30:01,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-12-09 19:30:01,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 251 transitions. [2018-12-09 19:30:01,889 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 251 transitions. Word has length 38 [2018-12-09 19:30:01,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:30:01,889 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 251 transitions. [2018-12-09 19:30:01,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:30:01,889 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 251 transitions. [2018-12-09 19:30:01,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 19:30:01,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:30:01,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:30:01,890 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr51REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-12-09 19:30:01,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:30:01,891 INFO L82 PathProgramCache]: Analyzing trace with hash -468803627, now seen corresponding path program 1 times [2018-12-09 19:30:01,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:30:01,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:30:01,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:30:01,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:30:01,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:30:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:30:01,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:30:01,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:30:01,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:30:01,942 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:30:01,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:30:01,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:30:01,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:30:01,943 INFO L87 Difference]: Start difference. First operand 212 states and 251 transitions. Second operand 7 states. [2018-12-09 19:30:02,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:30:02,091 INFO L93 Difference]: Finished difference Result 226 states and 265 transitions. [2018-12-09 19:30:02,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:30:02,091 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-12-09 19:30:02,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:30:02,092 INFO L225 Difference]: With dead ends: 226 [2018-12-09 19:30:02,092 INFO L226 Difference]: Without dead ends: 226 [2018-12-09 19:30:02,092 INFO L631 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-12-09 19:30:02,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-12-09 19:30:02,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 221. [2018-12-09 19:30:02,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-12-09 19:30:02,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 260 transitions. [2018-12-09 19:30:02,095 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 260 transitions. Word has length 41 [2018-12-09 19:30:02,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:30:02,095 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 260 transitions. [2018-12-09 19:30:02,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:30:02,095 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 260 transitions. [2018-12-09 19:30:02,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 19:30:02,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:30:02,096 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:30:02,096 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr51REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-12-09 19:30:02,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:30:02,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1717008911, now seen corresponding path program 1 times [2018-12-09 19:30:02,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:30:02,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:30:02,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:30:02,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:30:02,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:30:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:30:02,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:30:02,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:30:02,184 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:30:02,184 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-12-09 19:30:02,184 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [6], [16], [20], [25], [28], [29], [54], [57], [62], [63], [66], [72], [76], [81], [86], [89], [192], [200], [204], [214], [216], [217], [220], [227], [310], [314], [319], [322], [333], [334], [336], [337], [398], [400], [403], [405], [407], [414], [415], [416] [2018-12-09 19:30:02,185 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:30:02,185 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:30:02,239 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:30:02,240 INFO L272 AbstractInterpreter]: Visited 43 different actions 60 times. Merged at 16 different actions 16 times. Never widened. Performed 397 root evaluator evaluations with a maximum evaluation depth of 3. Performed 397 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-12-09 19:30:02,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:30:02,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:30:02,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:30:02,241 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6b3d7c4-5ad5-440b-806a-66784cea29e5/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:30:02,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:30:02,252 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:30:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:30:02,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:30:02,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 19:30:02,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 19:30:02,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:30:02,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:30:02,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 19:30:02,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 19:30:02,306 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:30:02,309 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:30:02,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:30:02,313 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-12-09 19:30:02,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-09 19:30:02,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:30:02,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:30:02,440 INFO L478 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-12-09 19:30:02,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 19:30:02,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 19:30:02,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-09 19:30:02,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:30:02,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 19:30:02,469 INFO L478 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-12-09 19:30:02,470 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 19:30:02,476 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 19:30:02,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 19:30:02,484 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:18 [2018-12-09 19:30:02,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:30:02,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:30:02,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:30:02,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:30:02,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 10] total 23 [2018-12-09 19:30:02,669 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:30:02,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 19:30:02,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 19:30:02,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2018-12-09 19:30:02,670 INFO L87 Difference]: Start difference. First operand 221 states and 260 transitions. Second operand 17 states. [2018-12-09 19:30:03,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:30:03,734 INFO L93 Difference]: Finished difference Result 485 states and 528 transitions. [2018-12-09 19:30:03,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 19:30:03,734 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-12-09 19:30:03,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:30:03,735 INFO L225 Difference]: With dead ends: 485 [2018-12-09 19:30:03,735 INFO L226 Difference]: Without dead ends: 485 [2018-12-09 19:30:03,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 74 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-12-09 19:30:03,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-12-09 19:30:03,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 243. [2018-12-09 19:30:03,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-12-09 19:30:03,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 289 transitions. [2018-12-09 19:30:03,738 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 289 transitions. Word has length 44 [2018-12-09 19:30:03,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:30:03,739 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 289 transitions. [2018-12-09 19:30:03,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 19:30:03,739 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 289 transitions. [2018-12-09 19:30:03,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 19:30:03,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:30:03,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:30:03,739 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr51REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-12-09 19:30:03,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:30:03,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1496604041, now seen corresponding path program 1 times [2018-12-09 19:30:03,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:30:03,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:30:03,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:30:03,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:30:03,740 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:30:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:30:03,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:30:03,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:30:03,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 19:30:03,826 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:30:03,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:30:03,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:30:03,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:30:03,827 INFO L87 Difference]: Start difference. First operand 243 states and 289 transitions. Second operand 10 states. [2018-12-09 19:30:04,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:30:04,194 INFO L93 Difference]: Finished difference Result 419 states and 483 transitions. [2018-12-09 19:30:04,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:30:04,195 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-12-09 19:30:04,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:30:04,196 INFO L225 Difference]: With dead ends: 419 [2018-12-09 19:30:04,196 INFO L226 Difference]: Without dead ends: 419 [2018-12-09 19:30:04,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-12-09 19:30:04,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-12-09 19:30:04,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 250. [2018-12-09 19:30:04,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-12-09 19:30:04,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 298 transitions. [2018-12-09 19:30:04,202 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 298 transitions. Word has length 45 [2018-12-09 19:30:04,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:30:04,202 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 298 transitions. [2018-12-09 19:30:04,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:30:04,202 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 298 transitions. [2018-12-09 19:30:04,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 19:30:04,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:30:04,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:30:04,203 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr51REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-12-09 19:30:04,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:30:04,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1496604042, now seen corresponding path program 1 times [2018-12-09 19:30:04,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:30:04,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:30:04,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:30:04,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:30:04,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:30:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:30:04,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:30:04,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:30:04,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 19:30:04,320 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:30:04,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:30:04,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:30:04,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:30:04,321 INFO L87 Difference]: Start difference. First operand 250 states and 298 transitions. Second operand 10 states. [2018-12-09 19:30:04,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:30:04,734 INFO L93 Difference]: Finished difference Result 422 states and 487 transitions. [2018-12-09 19:30:04,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:30:04,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-12-09 19:30:04,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:30:04,736 INFO L225 Difference]: With dead ends: 422 [2018-12-09 19:30:04,736 INFO L226 Difference]: Without dead ends: 422 [2018-12-09 19:30:04,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-12-09 19:30:04,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-12-09 19:30:04,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 256. [2018-12-09 19:30:04,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-09 19:30:04,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 303 transitions. [2018-12-09 19:30:04,740 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 303 transitions. Word has length 45 [2018-12-09 19:30:04,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:30:04,740 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 303 transitions. [2018-12-09 19:30:04,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:30:04,740 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 303 transitions. [2018-12-09 19:30:04,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 19:30:04,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:30:04,741 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:30:04,741 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr51REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-12-09 19:30:04,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:30:04,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1687667873, now seen corresponding path program 1 times [2018-12-09 19:30:04,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:30:04,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:30:04,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:30:04,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:30:04,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:30:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:30:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:30:04,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:30:04,769 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:30:04,769 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-12-09 19:30:04,769 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [6], [16], [20], [25], [28], [29], [54], [57], [62], [63], [66], [72], [76], [81], [86], [89], [192], [200], [204], [214], [216], [217], [220], [227], [310], [314], [319], [322], [331], [333], [334], [337], [398], [400], [403], [405], [407], [411], [413], [414], [415], [416] [2018-12-09 19:30:04,771 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:30:04,771 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:30:04,814 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:30:04,814 INFO L272 AbstractInterpreter]: Visited 45 different actions 62 times. Merged at 15 different actions 15 times. Never widened. Performed 396 root evaluator evaluations with a maximum evaluation depth of 3. Performed 396 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 37 variables. [2018-12-09 19:30:04,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:30:04,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:30:04,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:30:04,816 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b6b3d7c4-5ad5-440b-806a-66784cea29e5/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:30:04,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:30:04,825 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:30:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:30:04,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:30:05,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:30:05,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:30:05,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 19:30:05,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:30:05,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 6 [2018-12-09 19:30:05,364 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:30:05,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:30:05,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:30:05,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=25, Unknown=2, NotChecked=0, Total=42 [2018-12-09 19:30:05,364 INFO L87 Difference]: Start difference. First operand 256 states and 303 transitions. Second operand 6 states. [2018-12-09 19:30:05,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:30:05,430 INFO L93 Difference]: Finished difference Result 286 states and 333 transitions. [2018-12-09 19:30:05,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:30:05,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-12-09 19:30:05,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:30:05,430 INFO L225 Difference]: With dead ends: 286 [2018-12-09 19:30:05,430 INFO L226 Difference]: Without dead ends: 263 [2018-12-09 19:30:05,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=25, Unknown=2, NotChecked=0, Total=42 [2018-12-09 19:30:05,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-12-09 19:30:05,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-12-09 19:30:05,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-12-09 19:30:05,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 310 transitions. [2018-12-09 19:30:05,433 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 310 transitions. Word has length 45 [2018-12-09 19:30:05,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:30:05,433 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 310 transitions. [2018-12-09 19:30:05,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:30:05,433 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 310 transitions. [2018-12-09 19:30:05,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 19:30:05,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:30:05,433 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:30:05,434 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr61REQUIRES_VIOLATION, mainErr62ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr64ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr51REQUIRES_VIOLATION, mainErr63ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr60REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION]=== [2018-12-09 19:30:05,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:30:05,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1507570359, now seen corresponding path program 1 times [2018-12-09 19:30:05,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:30:05,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:30:05,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:30:05,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:30:05,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:30:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:30:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:30:05,463 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 19:30:05,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:30:05 BoogieIcfgContainer [2018-12-09 19:30:05,492 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:30:05,493 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:30:05,493 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:30:05,493 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:30:05,493 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:29:55" (3/4) ... [2018-12-09 19:30:05,495 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 19:30:05,532 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b6b3d7c4-5ad5-440b-806a-66784cea29e5/bin-2019/utaipan/witness.graphml [2018-12-09 19:30:05,532 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:30:05,533 INFO L168 Benchmark]: Toolchain (without parser) took 11175.22 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 375.4 MB). Free memory was 948.1 MB in the beginning and 1.2 GB in the end (delta: -276.1 MB). Peak memory consumption was 99.3 MB. Max. memory is 11.5 GB. [2018-12-09 19:30:05,534 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:30:05,534 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-09 19:30:05,535 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:30:05,535 INFO L168 Benchmark]: Boogie Preprocessor took 25.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-09 19:30:05,535 INFO L168 Benchmark]: RCFGBuilder took 359.98 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: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:30:05,535 INFO L168 Benchmark]: TraceAbstraction took 10451.34 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 233.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -151.8 MB). Peak memory consumption was 82.1 MB. Max. memory is 11.5 GB. [2018-12-09 19:30:05,535 INFO L168 Benchmark]: Witness Printer took 39.57 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:30:05,537 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 277.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 359.98 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: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10451.34 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 233.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -151.8 MB). Peak memory consumption was 82.1 MB. Max. memory is 11.5 GB. * Witness Printer took 39.57 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1029]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L991] SLL* list = malloc(sizeof(SLL)); VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L992] 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 !(__VERIFIER_nondet_int()) [L993] list->inner = malloc(sizeof(SLL)) VAL [list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] list->inner->next = ((void*)0) VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] list->inner->inner = ((void*)0) VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={10:0}, list->inner={11:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] SLL* end = list; VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; VAL [end={10:0}, len=0, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1017] EXPR end->inner VAL [end={10:0}, end->inner={11:0}, len=0, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={10:0}, inner={11:0}, len=0, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={10:0}, inner={11:0}, len=1, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={10:0}, inner={11:0}, len=1, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1025] EXPR inner->inner VAL [end={10:0}, inner={11:0}, inner->inner={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1026] EXPR inner->next VAL [end={10:0}, inner={11:0}, inner->next={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1027] EXPR inner->inner VAL [end={10:0}, inner={11:0}, inner->inner={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10: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))={11:0}, malloc(sizeof(SLL))={10:0}] [L1029] inner->inner - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 167 locations, 65 error locations. UNSAFE Result, 10.4s OverallTime, 26 OverallIterations, 2 TraceHistogramMax, 7.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3377 SDtfs, 6275 SDslu, 10826 SDs, 0 SdLazy, 9429 SolverSat, 457 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 530 GetRequests, 258 SyntacticMatches, 16 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=263occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 2261 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 902 NumberOfCodeBlocks, 902 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 949 ConstructedInterpolants, 11 QuantifiedInterpolants, 351619 SizeOfPredicates, 25 NumberOfNonLiveVariables, 470 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 31 InterpolantComputations, 22 PerfectInterpolantSequences, 12/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...