./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-01_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_63b9a8d3-e36b-4905-94bb-6b87c9740e11/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_63b9a8d3-e36b-4905-94bb-6b87c9740e11/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_63b9a8d3-e36b-4905-94bb-6b87c9740e11/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_63b9a8d3-e36b-4905-94bb-6b87c9740e11/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-01_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_63b9a8d3-e36b-4905-94bb-6b87c9740e11/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_63b9a8d3-e36b-4905-94bb-6b87c9740e11/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7feccaf382e9f358fe7bd48bccc9b98dfa2aebd .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 12:40:47,075 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:40:47,076 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:40:47,084 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:40:47,084 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:40:47,085 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:40:47,086 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:40:47,087 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:40:47,088 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:40:47,089 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:40:47,089 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:40:47,089 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:40:47,090 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:40:47,091 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:40:47,091 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:40:47,093 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:40:47,093 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:40:47,094 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:40:47,095 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:40:47,097 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:40:47,098 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:40:47,098 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:40:47,100 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:40:47,100 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:40:47,101 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:40:47,101 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:40:47,101 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:40:47,102 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:40:47,102 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:40:47,103 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:40:47,103 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:40:47,104 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:40:47,104 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:40:47,104 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:40:47,105 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:40:47,105 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:40:47,105 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_63b9a8d3-e36b-4905-94bb-6b87c9740e11/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 12:40:47,112 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:40:47,112 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:40:47,113 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 12:40:47,113 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 12:40:47,113 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 12:40:47,113 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 12:40:47,113 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 12:40:47,113 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 12:40:47,113 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 12:40:47,114 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 12:40:47,114 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 12:40:47,114 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 12:40:47,114 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 12:40:47,114 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:40:47,115 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 12:40:47,115 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:40:47,115 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 12:40:47,115 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:40:47,115 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 12:40:47,115 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 12:40:47,115 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 12:40:47,115 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 12:40:47,116 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:40:47,116 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:40:47,116 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 12:40:47,116 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:40:47,116 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:40:47,116 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 12:40:47,116 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 12:40:47,116 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:40:47,116 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:40:47,116 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 12:40:47,117 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 12:40:47,117 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 12:40:47,117 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 12:40:47,117 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 12:40:47,117 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 12:40:47,117 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_63b9a8d3-e36b-4905-94bb-6b87c9740e11/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 ! call(__VERIFIER_error())) ) 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 -> b7feccaf382e9f358fe7bd48bccc9b98dfa2aebd [2018-11-18 12:40:47,137 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:40:47,145 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:40:47,147 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:40:47,148 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:40:47,148 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:40:47,148 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_63b9a8d3-e36b-4905-94bb-6b87c9740e11/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/dll-01_false-unreach-call_false-valid-memcleanup.i [2018-11-18 12:40:47,180 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63b9a8d3-e36b-4905-94bb-6b87c9740e11/bin-2019/utaipan/data/c4ee9eba6/93c1b13cdc0044339c0deb3fd10267d6/FLAG520a7f5f8 [2018-11-18 12:40:47,601 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:40:47,601 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_63b9a8d3-e36b-4905-94bb-6b87c9740e11/sv-benchmarks/c/forester-heap/dll-01_false-unreach-call_false-valid-memcleanup.i [2018-11-18 12:40:47,607 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63b9a8d3-e36b-4905-94bb-6b87c9740e11/bin-2019/utaipan/data/c4ee9eba6/93c1b13cdc0044339c0deb3fd10267d6/FLAG520a7f5f8 [2018-11-18 12:40:47,616 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_63b9a8d3-e36b-4905-94bb-6b87c9740e11/bin-2019/utaipan/data/c4ee9eba6/93c1b13cdc0044339c0deb3fd10267d6 [2018-11-18 12:40:47,618 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:40:47,619 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:40:47,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:40:47,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:40:47,621 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:40:47,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:40:47" (1/1) ... [2018-11-18 12:40:47,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e459b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:40:47, skipping insertion in model container [2018-11-18 12:40:47,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:40:47" (1/1) ... [2018-11-18 12:40:47,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:40:47,658 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:40:47,848 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:40:47,854 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:40:47,890 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:40:47,958 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:40:47,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:40:47 WrapperNode [2018-11-18 12:40:47,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:40:47,959 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:40:47,959 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:40:47,959 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:40:47,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:40:47" (1/1) ... [2018-11-18 12:40:47,975 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:40:47" (1/1) ... [2018-11-18 12:40:47,980 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:40:47,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:40:47,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:40:47,981 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:40:47,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:40:47" (1/1) ... [2018-11-18 12:40:47,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:40:47" (1/1) ... [2018-11-18 12:40:47,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:40:47" (1/1) ... [2018-11-18 12:40:47,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:40:47" (1/1) ... [2018-11-18 12:40:47,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:40:47" (1/1) ... [2018-11-18 12:40:48,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:40:47" (1/1) ... [2018-11-18 12:40:48,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:40:47" (1/1) ... [2018-11-18 12:40:48,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:40:48,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:40:48,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:40:48,011 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:40:48,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:40:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63b9a8d3-e36b-4905-94bb-6b87c9740e11/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:40:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:40:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 12:40:48,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 12:40:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 12:40:48,054 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 12:40:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 12:40:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 12:40:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 12:40:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:40:48,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:40:48,434 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:40:48,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:40:48 BoogieIcfgContainer [2018-11-18 12:40:48,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:40:48,435 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 12:40:48,435 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 12:40:48,437 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 12:40:48,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:40:47" (1/3) ... [2018-11-18 12:40:48,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178d5f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:40:48, skipping insertion in model container [2018-11-18 12:40:48,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:40:47" (2/3) ... [2018-11-18 12:40:48,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178d5f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:40:48, skipping insertion in model container [2018-11-18 12:40:48,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:40:48" (3/3) ... [2018-11-18 12:40:48,440 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-01_false-unreach-call_false-valid-memcleanup.i [2018-11-18 12:40:48,446 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 12:40:48,450 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-11-18 12:40:48,460 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-11-18 12:40:48,483 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 12:40:48,483 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 12:40:48,483 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 12:40:48,483 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:40:48,484 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:40:48,484 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 12:40:48,484 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:40:48,484 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 12:40:48,497 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2018-11-18 12:40:48,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-18 12:40:48,501 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:40:48,502 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:40:48,504 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:40:48,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:40:48,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1590384440, now seen corresponding path program 1 times [2018-11-18 12:40:48,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:40:48,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:48,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:40:48,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:48,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:40:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:40:48,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:40:48,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:40:48,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:40:48,609 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:40:48,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:40:48,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:40:48,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:40:48,622 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 3 states. [2018-11-18 12:40:48,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:40:48,675 INFO L93 Difference]: Finished difference Result 210 states and 326 transitions. [2018-11-18 12:40:48,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:40:48,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-18 12:40:48,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:40:48,682 INFO L225 Difference]: With dead ends: 210 [2018-11-18 12:40:48,682 INFO L226 Difference]: Without dead ends: 112 [2018-11-18 12:40:48,685 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:40:48,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-18 12:40:48,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2018-11-18 12:40:48,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-18 12:40:48,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2018-11-18 12:40:48,712 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 9 [2018-11-18 12:40:48,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:40:48,712 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2018-11-18 12:40:48,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:40:48,713 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2018-11-18 12:40:48,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 12:40:48,713 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:40:48,713 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:40:48,714 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:40:48,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:40:48,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1798542350, now seen corresponding path program 1 times [2018-11-18 12:40:48,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:40:48,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:48,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:40:48,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:48,716 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:40:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:40:48,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:40:48,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:40:48,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:40:48,754 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:40:48,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:40:48,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:40:48,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:40:48,756 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 3 states. [2018-11-18 12:40:48,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:40:48,772 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2018-11-18 12:40:48,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:40:48,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-18 12:40:48,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:40:48,774 INFO L225 Difference]: With dead ends: 95 [2018-11-18 12:40:48,774 INFO L226 Difference]: Without dead ends: 93 [2018-11-18 12:40:48,775 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:40:48,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-18 12:40:48,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-18 12:40:48,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-18 12:40:48,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-11-18 12:40:48,780 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 15 [2018-11-18 12:40:48,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:40:48,780 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-11-18 12:40:48,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:40:48,780 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-11-18 12:40:48,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 12:40:48,780 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:40:48,780 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:40:48,781 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:40:48,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:40:48,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1798540428, now seen corresponding path program 1 times [2018-11-18 12:40:48,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:40:48,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:48,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:40:48,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:48,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:40:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:40:48,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:40:48,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:40:48,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:40:48,827 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:40:48,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:40:48,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:40:48,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:40:48,828 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 4 states. [2018-11-18 12:40:48,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:40:48,874 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2018-11-18 12:40:48,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:40:48,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-18 12:40:48,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:40:48,875 INFO L225 Difference]: With dead ends: 94 [2018-11-18 12:40:48,876 INFO L226 Difference]: Without dead ends: 92 [2018-11-18 12:40:48,876 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:40:48,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-18 12:40:48,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-11-18 12:40:48,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-18 12:40:48,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2018-11-18 12:40:48,881 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 15 [2018-11-18 12:40:48,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:40:48,881 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2018-11-18 12:40:48,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:40:48,882 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2018-11-18 12:40:48,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 12:40:48,882 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:40:48,882 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:40:48,883 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:40:48,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:40:48,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1876438388, now seen corresponding path program 1 times [2018-11-18 12:40:48,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:40:48,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:48,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:40:48,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:48,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:40:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:40:48,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:40:48,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:40:48,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:40:48,948 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:40:48,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:40:48,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:40:48,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:40:48,949 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 4 states. [2018-11-18 12:40:49,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:40:49,063 INFO L93 Difference]: Finished difference Result 228 states and 250 transitions. [2018-11-18 12:40:49,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:40:49,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-18 12:40:49,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:40:49,064 INFO L225 Difference]: With dead ends: 228 [2018-11-18 12:40:49,064 INFO L226 Difference]: Without dead ends: 151 [2018-11-18 12:40:49,064 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:40:49,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-18 12:40:49,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 92. [2018-11-18 12:40:49,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-18 12:40:49,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2018-11-18 12:40:49,070 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 22 [2018-11-18 12:40:49,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:40:49,071 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2018-11-18 12:40:49,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:40:49,071 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2018-11-18 12:40:49,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 12:40:49,071 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:40:49,071 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:40:49,072 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:40:49,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:40:49,072 INFO L82 PathProgramCache]: Analyzing trace with hash 2025501898, now seen corresponding path program 1 times [2018-11-18 12:40:49,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:40:49,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:49,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:40:49,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:49,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:40:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:40:49,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:40:49,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:40:49,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:40:49,123 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:40:49,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:40:49,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:40:49,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:40:49,124 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 5 states. [2018-11-18 12:40:49,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:40:49,216 INFO L93 Difference]: Finished difference Result 145 states and 159 transitions. [2018-11-18 12:40:49,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:40:49,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-18 12:40:49,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:40:49,217 INFO L225 Difference]: With dead ends: 145 [2018-11-18 12:40:49,217 INFO L226 Difference]: Without dead ends: 141 [2018-11-18 12:40:49,217 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:40:49,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-18 12:40:49,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 88. [2018-11-18 12:40:49,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-18 12:40:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-11-18 12:40:49,223 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 22 [2018-11-18 12:40:49,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:40:49,224 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-11-18 12:40:49,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:40:49,224 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-11-18 12:40:49,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 12:40:49,225 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:40:49,225 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:40:49,225 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:40:49,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:40:49,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1633610845, now seen corresponding path program 1 times [2018-11-18 12:40:49,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:40:49,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:49,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:40:49,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:49,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:40:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:40:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:40:49,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:40:49,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:40:49,255 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:40:49,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:40:49,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:40:49,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:40:49,255 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 4 states. [2018-11-18 12:40:49,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:40:49,311 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2018-11-18 12:40:49,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:40:49,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-18 12:40:49,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:40:49,312 INFO L225 Difference]: With dead ends: 155 [2018-11-18 12:40:49,312 INFO L226 Difference]: Without dead ends: 133 [2018-11-18 12:40:49,313 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:40:49,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-18 12:40:49,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 88. [2018-11-18 12:40:49,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-18 12:40:49,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-11-18 12:40:49,319 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 23 [2018-11-18 12:40:49,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:40:49,319 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-11-18 12:40:49,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:40:49,319 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-11-18 12:40:49,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 12:40:49,320 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:40:49,320 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:40:49,321 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:40:49,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:40:49,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1868006130, now seen corresponding path program 1 times [2018-11-18 12:40:49,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:40:49,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:49,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:40:49,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:49,322 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:40:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:40:49,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:40:49,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:40:49,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:40:49,354 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:40:49,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:40:49,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:40:49,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:40:49,354 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 3 states. [2018-11-18 12:40:49,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:40:49,377 INFO L93 Difference]: Finished difference Result 164 states and 182 transitions. [2018-11-18 12:40:49,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:40:49,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 12:40:49,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:40:49,378 INFO L225 Difference]: With dead ends: 164 [2018-11-18 12:40:49,378 INFO L226 Difference]: Without dead ends: 117 [2018-11-18 12:40:49,378 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:40:49,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-18 12:40:49,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 93. [2018-11-18 12:40:49,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-18 12:40:49,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-11-18 12:40:49,384 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 30 [2018-11-18 12:40:49,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:40:49,384 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-11-18 12:40:49,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:40:49,385 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-11-18 12:40:49,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 12:40:49,385 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:40:49,385 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:40:49,386 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:40:49,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:40:49,386 INFO L82 PathProgramCache]: Analyzing trace with hash -2073827367, now seen corresponding path program 1 times [2018-11-18 12:40:49,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:40:49,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:49,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:40:49,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:49,388 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:40:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:40:49,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:40:49,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:40:49,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:40:49,427 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:40:49,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:40:49,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:40:49,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:40:49,427 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 3 states. [2018-11-18 12:40:49,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:40:49,442 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2018-11-18 12:40:49,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:40:49,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 12:40:49,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:40:49,443 INFO L225 Difference]: With dead ends: 93 [2018-11-18 12:40:49,443 INFO L226 Difference]: Without dead ends: 91 [2018-11-18 12:40:49,444 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:40:49,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-18 12:40:49,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-11-18 12:40:49,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-18 12:40:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2018-11-18 12:40:49,449 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 31 [2018-11-18 12:40:49,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:40:49,449 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2018-11-18 12:40:49,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:40:49,449 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-11-18 12:40:49,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 12:40:49,450 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:40:49,450 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:40:49,450 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:40:49,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:40:49,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1656224486, now seen corresponding path program 1 times [2018-11-18 12:40:49,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:40:49,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:49,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:40:49,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:49,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:40:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:40:49,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:40:49,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:40:49,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:40:49,485 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:40:49,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:40:49,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:40:49,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:40:49,486 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 3 states. [2018-11-18 12:40:49,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:40:49,514 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2018-11-18 12:40:49,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:40:49,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 12:40:49,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:40:49,515 INFO L225 Difference]: With dead ends: 94 [2018-11-18 12:40:49,515 INFO L226 Difference]: Without dead ends: 92 [2018-11-18 12:40:49,515 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:40:49,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-18 12:40:49,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-11-18 12:40:49,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-18 12:40:49,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2018-11-18 12:40:49,520 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 31 [2018-11-18 12:40:49,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:40:49,521 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2018-11-18 12:40:49,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:40:49,521 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2018-11-18 12:40:49,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 12:40:49,521 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:40:49,522 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:40:49,522 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:40:49,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:40:49,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1656222564, now seen corresponding path program 1 times [2018-11-18 12:40:49,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:40:49,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:49,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:40:49,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:49,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:40:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:40:49,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:40:49,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:40:49,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:40:49,560 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:40:49,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:40:49,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:40:49,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:40:49,560 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 4 states. [2018-11-18 12:40:49,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:40:49,605 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2018-11-18 12:40:49,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:40:49,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-11-18 12:40:49,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:40:49,606 INFO L225 Difference]: With dead ends: 93 [2018-11-18 12:40:49,607 INFO L226 Difference]: Without dead ends: 91 [2018-11-18 12:40:49,607 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:40:49,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-18 12:40:49,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2018-11-18 12:40:49,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-18 12:40:49,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-11-18 12:40:49,611 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 31 [2018-11-18 12:40:49,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:40:49,611 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-11-18 12:40:49,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:40:49,611 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-11-18 12:40:49,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 12:40:49,612 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:40:49,612 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:40:49,614 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:40:49,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:40:49,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1717574904, now seen corresponding path program 1 times [2018-11-18 12:40:49,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:40:49,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:49,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:40:49,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:49,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:40:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:40:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:40:49,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:40:49,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 12:40:49,681 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:40:49,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:40:49,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:40:49,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:40:49,682 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 6 states. [2018-11-18 12:40:49,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:40:49,818 INFO L93 Difference]: Finished difference Result 215 states and 239 transitions. [2018-11-18 12:40:49,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 12:40:49,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-11-18 12:40:49,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:40:49,819 INFO L225 Difference]: With dead ends: 215 [2018-11-18 12:40:49,819 INFO L226 Difference]: Without dead ends: 165 [2018-11-18 12:40:49,820 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-18 12:40:49,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-18 12:40:49,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 103. [2018-11-18 12:40:49,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-18 12:40:49,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-11-18 12:40:49,824 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 34 [2018-11-18 12:40:49,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:40:49,824 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-11-18 12:40:49,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:40:49,824 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-11-18 12:40:49,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 12:40:49,825 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:40:49,825 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:40:49,825 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:40:49,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:40:49,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1364706680, now seen corresponding path program 1 times [2018-11-18 12:40:49,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:40:49,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:49,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:40:49,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:49,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:40:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:40:49,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:40:49,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:40:49,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 12:40:49,968 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:40:49,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 12:40:49,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 12:40:49,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:40:49,969 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 7 states. [2018-11-18 12:40:50,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:40:50,326 INFO L93 Difference]: Finished difference Result 284 states and 309 transitions. [2018-11-18 12:40:50,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 12:40:50,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-18 12:40:50,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:40:50,328 INFO L225 Difference]: With dead ends: 284 [2018-11-18 12:40:50,329 INFO L226 Difference]: Without dead ends: 282 [2018-11-18 12:40:50,329 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-18 12:40:50,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-18 12:40:50,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 120. [2018-11-18 12:40:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-18 12:40:50,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2018-11-18 12:40:50,334 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 34 [2018-11-18 12:40:50,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:40:50,335 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2018-11-18 12:40:50,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 12:40:50,335 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2018-11-18 12:40:50,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 12:40:50,335 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:40:50,335 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:40:50,336 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:40:50,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:40:50,336 INFO L82 PathProgramCache]: Analyzing trace with hash -179588948, now seen corresponding path program 1 times [2018-11-18 12:40:50,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:40:50,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:50,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:40:50,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:40:50,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:40:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:40:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:40:50,368 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 12:40:50,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 12:40:50 BoogieIcfgContainer [2018-11-18 12:40:50,398 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 12:40:50,399 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:40:50,399 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:40:50,399 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:40:50,399 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:40:48" (3/4) ... [2018-11-18 12:40:50,401 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 12:40:50,432 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_63b9a8d3-e36b-4905-94bb-6b87c9740e11/bin-2019/utaipan/witness.graphml [2018-11-18 12:40:50,432 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:40:50,433 INFO L168 Benchmark]: Toolchain (without parser) took 2814.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 955.5 MB in the beginning and 1.0 GB in the end (delta: -89.6 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:40:50,434 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:40:50,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -185.1 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. [2018-11-18 12:40:50,435 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:40:50,435 INFO L168 Benchmark]: Boogie Preprocessor took 30.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:40:50,435 INFO L168 Benchmark]: RCFGBuilder took 423.68 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: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2018-11-18 12:40:50,436 INFO L168 Benchmark]: TraceAbstraction took 1963.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. [2018-11-18 12:40:50,436 INFO L168 Benchmark]: Witness Printer took 33.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-18 12:40:50,438 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 339.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -185.1 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 423.68 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: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1963.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. * Witness Printer took 33.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1029]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L992] EXPR, FCALL malloc(sizeof(SLL)) [L992] SLL* list = malloc(sizeof(SLL)); [L993] FCALL list->next = ((void*)0) [L994] FCALL list->prev = ((void*)0) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L995] COND FALSE !(!(list != ((void*)0))) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L995] COND FALSE !(0) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L995] COND FALSE !(__VERIFIER_nondet_int()) [L995] EXPR, FCALL malloc(sizeof(SLL)) [L995] FCALL list->inner = malloc(sizeof(SLL)) [L995] EXPR, FCALL list->inner [L995] FCALL list->inner->next = ((void*)0) [L995] EXPR, FCALL list->inner [L995] FCALL list->inner->inner = ((void*)0) [L995] EXPR, FCALL list->inner [L995] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={14:0}, list->inner={15:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L995] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] COND FALSE !(0) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L997] SLL* end = list; VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1011] end = ((void*)0) [L1012] end = list VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1015] COND FALSE !(!(((void*)0) != end)) VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1015] COND FALSE !(0) VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1017] COND TRUE ((void*)0) != end [L1019] int len = 0; [L1020] EXPR, FCALL end->inner [L1020] SLL* inner = end->inner; [L1021] COND TRUE ((void*)0) != inner VAL [end={14:0}, inner={15:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1023] COND TRUE len == 0 [L1024] len = 1 VAL [end={14:0}, inner={15:0}, len=1, list={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1027] COND FALSE !(!(((void*)0) != inner)) VAL [end={14:0}, inner={15:0}, len=1, list={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1027] COND FALSE !(0) VAL [end={14:0}, inner={15:0}, len=1, list={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1028] EXPR, FCALL inner->inner VAL [end={14:0}, inner={15:0}, inner->inner={0:0}, len=1, list={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1028] COND FALSE !(!(((void*)0) == inner->inner)) [L1028] COND FALSE !(0) VAL [end={14:0}, inner={15:0}, len=1, list={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1029] EXPR, FCALL inner->next VAL [end={14:0}, inner={15:0}, inner->next={0:0}, len=1, list={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1029] COND TRUE !(((void*)0) != inner->next) [L1029] __VERIFIER_error() VAL [end={14:0}, inner={15:0}, len=1, list={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 99 locations, 13 error locations. UNSAFE Result, 1.9s OverallTime, 13 OverallIterations, 1 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1077 SDtfs, 994 SDslu, 1509 SDs, 0 SdLazy, 557 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 429 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 285 ConstructedInterpolants, 0 QuantifiedInterpolants, 45754 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...