./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c --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_25fd73cb-bdae-4ab0-9084-4c11c2480e90/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_25fd73cb-bdae-4ab0-9084-4c11c2480e90/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_25fd73cb-bdae-4ab0-9084-4c11c2480e90/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_25fd73cb-bdae-4ab0-9084-4c11c2480e90/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_25fd73cb-bdae-4ab0-9084-4c11c2480e90/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_25fd73cb-bdae-4ab0-9084-4c11c2480e90/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 ccd6d122756047ddb1225c106ac06a6748e14c22 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 16:08:49,588 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:08:49,589 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:08:49,597 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:08:49,597 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:08:49,598 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:08:49,598 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:08:49,599 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:08:49,600 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:08:49,601 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:08:49,602 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:08:49,602 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:08:49,603 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:08:49,604 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:08:49,604 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:08:49,605 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:08:49,605 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:08:49,607 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:08:49,608 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:08:49,610 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:08:49,611 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:08:49,611 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:08:49,613 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:08:49,613 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:08:49,613 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:08:49,615 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:08:49,615 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:08:49,616 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:08:49,616 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:08:49,617 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:08:49,617 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:08:49,618 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:08:49,618 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:08:49,619 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:08:49,619 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:08:49,620 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:08:49,620 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_25fd73cb-bdae-4ab0-9084-4c11c2480e90/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 16:08:49,631 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:08:49,631 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:08:49,631 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:08:49,631 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 16:08:49,632 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 16:08:49,632 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 16:08:49,632 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 16:08:49,632 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 16:08:49,632 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 16:08:49,632 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 16:08:49,632 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 16:08:49,632 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 16:08:49,632 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 16:08:49,633 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:08:49,633 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:08:49,633 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:08:49,633 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:08:49,633 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:08:49,634 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 16:08:49,635 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:08:49,635 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 16:08:49,635 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:08:49,635 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:08:49,635 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:08:49,635 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 16:08:49,635 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:08:49,636 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:08:49,636 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:08:49,636 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 16:08:49,636 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:08:49,636 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:08:49,636 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:08:49,636 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 16:08:49,636 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 16:08:49,636 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:08:49,636 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 16:08:49,636 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 16:08:49,637 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_25fd73cb-bdae-4ab0-9084-4c11c2480e90/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 -> ccd6d122756047ddb1225c106ac06a6748e14c22 [2018-11-18 16:08:49,661 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:08:49,670 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:08:49,673 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:08:49,674 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:08:49,674 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:08:49,675 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_25fd73cb-bdae-4ab0-9084-4c11c2480e90/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 16:08:49,719 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25fd73cb-bdae-4ab0-9084-4c11c2480e90/bin-2019/utaipan/data/47767acdf/8914ca80a5ca4480b62449f301cbf60e/FLAG8d82c84e5 [2018-11-18 16:08:50,052 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:08:50,053 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_25fd73cb-bdae-4ab0-9084-4c11c2480e90/sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 16:08:50,058 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25fd73cb-bdae-4ab0-9084-4c11c2480e90/bin-2019/utaipan/data/47767acdf/8914ca80a5ca4480b62449f301cbf60e/FLAG8d82c84e5 [2018-11-18 16:08:50,489 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_25fd73cb-bdae-4ab0-9084-4c11c2480e90/bin-2019/utaipan/data/47767acdf/8914ca80a5ca4480b62449f301cbf60e [2018-11-18 16:08:50,491 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:08:50,493 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:08:50,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:08:50,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:08:50,495 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:08:50,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:08:50" (1/1) ... [2018-11-18 16:08:50,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4de76a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:08:50, skipping insertion in model container [2018-11-18 16:08:50,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:08:50" (1/1) ... [2018-11-18 16:08:50,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:08:50,516 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:08:50,625 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:08:50,627 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:08:50,640 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:08:50,650 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:08:50,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:08:50 WrapperNode [2018-11-18 16:08:50,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:08:50,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:08:50,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:08:50,651 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:08:50,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:08:50" (1/1) ... [2018-11-18 16:08:50,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:08:50" (1/1) ... [2018-11-18 16:08:50,662 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:08:50,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:08:50,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:08:50,663 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:08:50,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:08:50" (1/1) ... [2018-11-18 16:08:50,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:08:50" (1/1) ... [2018-11-18 16:08:50,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:08:50" (1/1) ... [2018-11-18 16:08:50,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:08:50" (1/1) ... [2018-11-18 16:08:50,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:08:50" (1/1) ... [2018-11-18 16:08:50,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:08:50" (1/1) ... [2018-11-18 16:08:50,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:08:50" (1/1) ... [2018-11-18 16:08:50,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:08:50,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:08:50,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:08:50,677 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:08:50,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:08:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25fd73cb-bdae-4ab0-9084-4c11c2480e90/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 16:08:50,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 16:08:50,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 16:08:50,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:08:50,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:08:50,746 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 16:08:50,746 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 16:08:50,884 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:08:50,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:08:50 BoogieIcfgContainer [2018-11-18 16:08:50,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:08:50,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 16:08:50,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 16:08:50,887 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 16:08:50,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:08:50" (1/3) ... [2018-11-18 16:08:50,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22705c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:08:50, skipping insertion in model container [2018-11-18 16:08:50,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:08:50" (2/3) ... [2018-11-18 16:08:50,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22705c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:08:50, skipping insertion in model container [2018-11-18 16:08:50,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:08:50" (3/3) ... [2018-11-18 16:08:50,889 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 16:08:50,896 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 16:08:50,901 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 16:08:50,909 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 16:08:50,927 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 16:08:50,927 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 16:08:50,928 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 16:08:50,928 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:08:50,928 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:08:50,928 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 16:08:50,928 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:08:50,928 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 16:08:50,943 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-18 16:08:50,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 16:08:50,950 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:50,950 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:50,952 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:50,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:50,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1900455195, now seen corresponding path program 1 times [2018-11-18 16:08:50,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:50,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:50,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:50,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:50,992 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:51,061 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 16:08:51,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:51,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:51,063 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:51,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:51,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:51,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:51,079 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2018-11-18 16:08:51,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:51,118 INFO L93 Difference]: Finished difference Result 71 states and 116 transitions. [2018-11-18 16:08:51,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:51,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 16:08:51,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:51,126 INFO L225 Difference]: With dead ends: 71 [2018-11-18 16:08:51,126 INFO L226 Difference]: Without dead ends: 56 [2018-11-18 16:08:51,128 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 16:08:51,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-18 16:08:51,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 39. [2018-11-18 16:08:51,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 16:08:51,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. [2018-11-18 16:08:51,151 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 18 [2018-11-18 16:08:51,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:51,152 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 66 transitions. [2018-11-18 16:08:51,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:51,152 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 66 transitions. [2018-11-18 16:08:51,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 16:08:51,152 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:51,152 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:51,153 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:51,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:51,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1507428185, now seen corresponding path program 1 times [2018-11-18 16:08:51,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:51,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:51,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:51,191 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 16:08:51,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:51,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:51,192 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:51,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:51,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:51,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:51,194 INFO L87 Difference]: Start difference. First operand 39 states and 66 transitions. Second operand 3 states. [2018-11-18 16:08:51,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:51,219 INFO L93 Difference]: Finished difference Result 90 states and 155 transitions. [2018-11-18 16:08:51,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:51,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 16:08:51,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:51,220 INFO L225 Difference]: With dead ends: 90 [2018-11-18 16:08:51,220 INFO L226 Difference]: Without dead ends: 56 [2018-11-18 16:08:51,221 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 16:08:51,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-18 16:08:51,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-11-18 16:08:51,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-18 16:08:51,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 91 transitions. [2018-11-18 16:08:51,227 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 91 transitions. Word has length 18 [2018-11-18 16:08:51,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:51,227 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 91 transitions. [2018-11-18 16:08:51,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:51,228 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 91 transitions. [2018-11-18 16:08:51,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 16:08:51,228 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:51,228 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:51,228 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:51,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:51,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1215216746, now seen corresponding path program 1 times [2018-11-18 16:08:51,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:51,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:51,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,230 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:51,249 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 16:08:51,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:51,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:51,250 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:51,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:51,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:51,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:51,251 INFO L87 Difference]: Start difference. First operand 54 states and 91 transitions. Second operand 3 states. [2018-11-18 16:08:51,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:51,274 INFO L93 Difference]: Finished difference Result 85 states and 139 transitions. [2018-11-18 16:08:51,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:51,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 16:08:51,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:51,275 INFO L225 Difference]: With dead ends: 85 [2018-11-18 16:08:51,275 INFO L226 Difference]: Without dead ends: 60 [2018-11-18 16:08:51,276 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 16:08:51,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-18 16:08:51,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-18 16:08:51,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-18 16:08:51,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 94 transitions. [2018-11-18 16:08:51,280 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 94 transitions. Word has length 19 [2018-11-18 16:08:51,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:51,280 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 94 transitions. [2018-11-18 16:08:51,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:51,280 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 94 transitions. [2018-11-18 16:08:51,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 16:08:51,281 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:51,281 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:51,281 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:51,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:51,281 INFO L82 PathProgramCache]: Analyzing trace with hash -514152168, now seen corresponding path program 1 times [2018-11-18 16:08:51,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:51,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:51,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:51,319 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 16:08:51,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:51,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:51,319 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:51,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:51,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:51,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:51,320 INFO L87 Difference]: Start difference. First operand 58 states and 94 transitions. Second operand 3 states. [2018-11-18 16:08:51,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:51,334 INFO L93 Difference]: Finished difference Result 105 states and 173 transitions. [2018-11-18 16:08:51,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:51,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 16:08:51,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:51,335 INFO L225 Difference]: With dead ends: 105 [2018-11-18 16:08:51,335 INFO L226 Difference]: Without dead ends: 103 [2018-11-18 16:08:51,336 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 16:08:51,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-18 16:08:51,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 75. [2018-11-18 16:08:51,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-18 16:08:51,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 123 transitions. [2018-11-18 16:08:51,340 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 123 transitions. Word has length 19 [2018-11-18 16:08:51,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:51,340 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 123 transitions. [2018-11-18 16:08:51,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:51,341 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 123 transitions. [2018-11-18 16:08:51,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 16:08:51,341 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:51,341 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:51,341 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:51,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:51,342 INFO L82 PathProgramCache]: Analyzing trace with hash -907179178, now seen corresponding path program 1 times [2018-11-18 16:08:51,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:51,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:51,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:51,361 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 16:08:51,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:51,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:51,361 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:51,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:51,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:51,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:51,362 INFO L87 Difference]: Start difference. First operand 75 states and 123 transitions. Second operand 3 states. [2018-11-18 16:08:51,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:51,377 INFO L93 Difference]: Finished difference Result 171 states and 285 transitions. [2018-11-18 16:08:51,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:51,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 16:08:51,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:51,379 INFO L225 Difference]: With dead ends: 171 [2018-11-18 16:08:51,379 INFO L226 Difference]: Without dead ends: 105 [2018-11-18 16:08:51,380 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 16:08:51,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-18 16:08:51,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-11-18 16:08:51,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-18 16:08:51,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 167 transitions. [2018-11-18 16:08:51,388 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 167 transitions. Word has length 19 [2018-11-18 16:08:51,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:51,388 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 167 transitions. [2018-11-18 16:08:51,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:51,389 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 167 transitions. [2018-11-18 16:08:51,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 16:08:51,389 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:51,389 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:51,389 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:51,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:51,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1241366670, now seen corresponding path program 1 times [2018-11-18 16:08:51,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:51,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:51,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,391 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:51,414 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 16:08:51,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:51,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:51,415 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:51,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:51,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:51,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:51,415 INFO L87 Difference]: Start difference. First operand 103 states and 167 transitions. Second operand 3 states. [2018-11-18 16:08:51,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:51,433 INFO L93 Difference]: Finished difference Result 154 states and 248 transitions. [2018-11-18 16:08:51,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:51,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 16:08:51,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:51,434 INFO L225 Difference]: With dead ends: 154 [2018-11-18 16:08:51,435 INFO L226 Difference]: Without dead ends: 107 [2018-11-18 16:08:51,435 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 16:08:51,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-18 16:08:51,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-11-18 16:08:51,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-18 16:08:51,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 167 transitions. [2018-11-18 16:08:51,442 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 167 transitions. Word has length 20 [2018-11-18 16:08:51,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:51,442 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 167 transitions. [2018-11-18 16:08:51,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:51,442 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 167 transitions. [2018-11-18 16:08:51,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 16:08:51,443 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:51,443 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:51,443 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:51,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:51,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1942431248, now seen corresponding path program 1 times [2018-11-18 16:08:51,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:51,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:51,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:51,479 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 16:08:51,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:51,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:51,479 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:51,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:51,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:51,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:51,480 INFO L87 Difference]: Start difference. First operand 105 states and 167 transitions. Second operand 3 states. [2018-11-18 16:08:51,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:51,492 INFO L93 Difference]: Finished difference Result 189 states and 305 transitions. [2018-11-18 16:08:51,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:51,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 16:08:51,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:51,494 INFO L225 Difference]: With dead ends: 189 [2018-11-18 16:08:51,494 INFO L226 Difference]: Without dead ends: 187 [2018-11-18 16:08:51,494 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 16:08:51,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-18 16:08:51,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 141. [2018-11-18 16:08:51,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-18 16:08:51,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 223 transitions. [2018-11-18 16:08:51,504 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 223 transitions. Word has length 20 [2018-11-18 16:08:51,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:51,504 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 223 transitions. [2018-11-18 16:08:51,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:51,504 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 223 transitions. [2018-11-18 16:08:51,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 16:08:51,505 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:51,505 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:51,506 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:51,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:51,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1549404238, now seen corresponding path program 1 times [2018-11-18 16:08:51,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:51,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:51,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:51,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:08:51,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:51,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:51,531 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:51,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:51,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:51,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:51,532 INFO L87 Difference]: Start difference. First operand 141 states and 223 transitions. Second operand 3 states. [2018-11-18 16:08:51,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:51,546 INFO L93 Difference]: Finished difference Result 325 states and 517 transitions. [2018-11-18 16:08:51,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:51,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 16:08:51,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:51,547 INFO L225 Difference]: With dead ends: 325 [2018-11-18 16:08:51,547 INFO L226 Difference]: Without dead ends: 195 [2018-11-18 16:08:51,548 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 16:08:51,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-18 16:08:51,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2018-11-18 16:08:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-11-18 16:08:51,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 299 transitions. [2018-11-18 16:08:51,554 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 299 transitions. Word has length 20 [2018-11-18 16:08:51,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:51,554 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 299 transitions. [2018-11-18 16:08:51,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:51,554 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 299 transitions. [2018-11-18 16:08:51,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 16:08:51,555 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:51,555 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] [2018-11-18 16:08:51,555 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:51,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:51,555 INFO L82 PathProgramCache]: Analyzing trace with hash 86041579, now seen corresponding path program 1 times [2018-11-18 16:08:51,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:51,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:51,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,556 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:51,578 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 16:08:51,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:51,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:51,579 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:51,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:51,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:51,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:51,580 INFO L87 Difference]: Start difference. First operand 193 states and 299 transitions. Second operand 3 states. [2018-11-18 16:08:51,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:51,593 INFO L93 Difference]: Finished difference Result 289 states and 445 transitions. [2018-11-18 16:08:51,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:51,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 16:08:51,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:51,594 INFO L225 Difference]: With dead ends: 289 [2018-11-18 16:08:51,594 INFO L226 Difference]: Without dead ends: 199 [2018-11-18 16:08:51,594 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 16:08:51,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-18 16:08:51,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2018-11-18 16:08:51,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-18 16:08:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 299 transitions. [2018-11-18 16:08:51,600 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 299 transitions. Word has length 21 [2018-11-18 16:08:51,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:51,600 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 299 transitions. [2018-11-18 16:08:51,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:51,600 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 299 transitions. [2018-11-18 16:08:51,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 16:08:51,601 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:51,601 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] [2018-11-18 16:08:51,601 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:51,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:51,601 INFO L82 PathProgramCache]: Analyzing trace with hash 787106157, now seen corresponding path program 1 times [2018-11-18 16:08:51,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:51,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:51,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:51,616 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 16:08:51,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:51,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:51,617 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:51,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:51,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:51,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:51,617 INFO L87 Difference]: Start difference. First operand 197 states and 299 transitions. Second operand 3 states. [2018-11-18 16:08:51,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:51,634 INFO L93 Difference]: Finished difference Result 349 states and 537 transitions. [2018-11-18 16:08:51,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:51,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 16:08:51,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:51,636 INFO L225 Difference]: With dead ends: 349 [2018-11-18 16:08:51,636 INFO L226 Difference]: Without dead ends: 347 [2018-11-18 16:08:51,636 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 16:08:51,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-11-18 16:08:51,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 273. [2018-11-18 16:08:51,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-11-18 16:08:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 407 transitions. [2018-11-18 16:08:51,644 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 407 transitions. Word has length 21 [2018-11-18 16:08:51,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:51,644 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 407 transitions. [2018-11-18 16:08:51,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:51,644 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 407 transitions. [2018-11-18 16:08:51,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 16:08:51,645 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:51,645 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:51,645 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:51,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:51,646 INFO L82 PathProgramCache]: Analyzing trace with hash 394079147, now seen corresponding path program 1 times [2018-11-18 16:08:51,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:51,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:51,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:51,663 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 16:08:51,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:51,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:51,664 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:51,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:51,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:51,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:51,664 INFO L87 Difference]: Start difference. First operand 273 states and 407 transitions. Second operand 3 states. [2018-11-18 16:08:51,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:51,688 INFO L93 Difference]: Finished difference Result 629 states and 937 transitions. [2018-11-18 16:08:51,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:51,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 16:08:51,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:51,689 INFO L225 Difference]: With dead ends: 629 [2018-11-18 16:08:51,689 INFO L226 Difference]: Without dead ends: 371 [2018-11-18 16:08:51,690 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 16:08:51,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-11-18 16:08:51,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 369. [2018-11-18 16:08:51,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-11-18 16:08:51,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 535 transitions. [2018-11-18 16:08:51,703 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 535 transitions. Word has length 21 [2018-11-18 16:08:51,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:51,704 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 535 transitions. [2018-11-18 16:08:51,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:51,704 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 535 transitions. [2018-11-18 16:08:51,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 16:08:51,705 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:51,705 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 16:08:51,705 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:51,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:51,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1369297533, now seen corresponding path program 1 times [2018-11-18 16:08:51,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:51,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:51,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:51,732 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 16:08:51,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:51,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:51,732 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:51,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:51,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:51,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:51,733 INFO L87 Difference]: Start difference. First operand 369 states and 535 transitions. Second operand 3 states. [2018-11-18 16:08:51,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:51,757 INFO L93 Difference]: Finished difference Result 553 states and 797 transitions. [2018-11-18 16:08:51,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:51,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 16:08:51,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:51,759 INFO L225 Difference]: With dead ends: 553 [2018-11-18 16:08:51,759 INFO L226 Difference]: Without dead ends: 379 [2018-11-18 16:08:51,760 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 16:08:51,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-18 16:08:51,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 377. [2018-11-18 16:08:51,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-11-18 16:08:51,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 535 transitions. [2018-11-18 16:08:51,770 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 535 transitions. Word has length 22 [2018-11-18 16:08:51,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:51,771 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 535 transitions. [2018-11-18 16:08:51,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:51,771 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 535 transitions. [2018-11-18 16:08:51,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 16:08:51,772 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:51,772 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 16:08:51,772 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:51,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:51,772 INFO L82 PathProgramCache]: Analyzing trace with hash -668232955, now seen corresponding path program 1 times [2018-11-18 16:08:51,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:51,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:51,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,773 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:51,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:08:51,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:51,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:51,791 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:51,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:51,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:51,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:51,792 INFO L87 Difference]: Start difference. First operand 377 states and 535 transitions. Second operand 3 states. [2018-11-18 16:08:51,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:51,812 INFO L93 Difference]: Finished difference Result 1069 states and 1497 transitions. [2018-11-18 16:08:51,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:51,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 16:08:51,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:51,814 INFO L225 Difference]: With dead ends: 1069 [2018-11-18 16:08:51,814 INFO L226 Difference]: Without dead ends: 715 [2018-11-18 16:08:51,815 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 16:08:51,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2018-11-18 16:08:51,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 713. [2018-11-18 16:08:51,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-11-18 16:08:51,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 967 transitions. [2018-11-18 16:08:51,829 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 967 transitions. Word has length 22 [2018-11-18 16:08:51,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:51,829 INFO L480 AbstractCegarLoop]: Abstraction has 713 states and 967 transitions. [2018-11-18 16:08:51,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:51,830 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 967 transitions. [2018-11-18 16:08:51,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 16:08:51,830 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:51,831 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 16:08:51,831 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:51,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:51,831 INFO L82 PathProgramCache]: Analyzing trace with hash -275205945, now seen corresponding path program 1 times [2018-11-18 16:08:51,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:51,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:51,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:51,851 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 16:08:51,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:51,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:51,852 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:51,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:51,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:51,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:51,852 INFO L87 Difference]: Start difference. First operand 713 states and 967 transitions. Second operand 3 states. [2018-11-18 16:08:51,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:51,882 INFO L93 Difference]: Finished difference Result 829 states and 1145 transitions. [2018-11-18 16:08:51,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:51,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 16:08:51,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:51,885 INFO L225 Difference]: With dead ends: 829 [2018-11-18 16:08:51,885 INFO L226 Difference]: Without dead ends: 827 [2018-11-18 16:08:51,885 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 16:08:51,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2018-11-18 16:08:51,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 713. [2018-11-18 16:08:51,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-11-18 16:08:51,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 951 transitions. [2018-11-18 16:08:51,900 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 951 transitions. Word has length 22 [2018-11-18 16:08:51,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:51,900 INFO L480 AbstractCegarLoop]: Abstraction has 713 states and 951 transitions. [2018-11-18 16:08:51,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:51,901 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 951 transitions. [2018-11-18 16:08:51,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 16:08:51,901 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:51,902 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 16:08:51,902 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:51,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:51,902 INFO L82 PathProgramCache]: Analyzing trace with hash 759830592, now seen corresponding path program 1 times [2018-11-18 16:08:51,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:51,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:51,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:51,919 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 16:08:51,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:51,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:51,920 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:51,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:51,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:51,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:51,921 INFO L87 Difference]: Start difference. First operand 713 states and 951 transitions. Second operand 3 states. [2018-11-18 16:08:51,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:51,945 INFO L93 Difference]: Finished difference Result 1213 states and 1625 transitions. [2018-11-18 16:08:51,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:51,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 16:08:51,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:51,948 INFO L225 Difference]: With dead ends: 1213 [2018-11-18 16:08:51,948 INFO L226 Difference]: Without dead ends: 1211 [2018-11-18 16:08:51,949 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 16:08:51,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2018-11-18 16:08:51,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1049. [2018-11-18 16:08:51,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1049 states. [2018-11-18 16:08:51,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1367 transitions. [2018-11-18 16:08:51,970 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1367 transitions. Word has length 23 [2018-11-18 16:08:51,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:51,970 INFO L480 AbstractCegarLoop]: Abstraction has 1049 states and 1367 transitions. [2018-11-18 16:08:51,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:51,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1367 transitions. [2018-11-18 16:08:51,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 16:08:51,972 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:51,972 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 16:08:51,972 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:51,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:51,972 INFO L82 PathProgramCache]: Analyzing trace with hash 366803582, now seen corresponding path program 1 times [2018-11-18 16:08:51,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:51,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:51,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:51,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:51,991 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 16:08:51,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:51,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:51,991 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:51,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:51,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:51,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:51,992 INFO L87 Difference]: Start difference. First operand 1049 states and 1367 transitions. Second operand 3 states. [2018-11-18 16:08:52,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:52,021 INFO L93 Difference]: Finished difference Result 2397 states and 3097 transitions. [2018-11-18 16:08:52,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:52,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 16:08:52,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:52,024 INFO L225 Difference]: With dead ends: 2397 [2018-11-18 16:08:52,024 INFO L226 Difference]: Without dead ends: 1371 [2018-11-18 16:08:52,025 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 16:08:52,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2018-11-18 16:08:52,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1369. [2018-11-18 16:08:52,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1369 states. [2018-11-18 16:08:52,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1703 transitions. [2018-11-18 16:08:52,055 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1703 transitions. Word has length 23 [2018-11-18 16:08:52,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:52,055 INFO L480 AbstractCegarLoop]: Abstraction has 1369 states and 1703 transitions. [2018-11-18 16:08:52,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:52,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1703 transitions. [2018-11-18 16:08:52,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 16:08:52,057 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:52,057 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:52,057 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:52,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:52,057 INFO L82 PathProgramCache]: Analyzing trace with hash 2080127930, now seen corresponding path program 1 times [2018-11-18 16:08:52,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:52,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:52,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:52,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:52,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:52,074 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 16:08:52,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:52,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:52,075 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:52,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:52,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:52,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:52,076 INFO L87 Difference]: Start difference. First operand 1369 states and 1703 transitions. Second operand 3 states. [2018-11-18 16:08:52,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:52,107 INFO L93 Difference]: Finished difference Result 2077 states and 2585 transitions. [2018-11-18 16:08:52,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:52,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 16:08:52,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:52,110 INFO L225 Difference]: With dead ends: 2077 [2018-11-18 16:08:52,110 INFO L226 Difference]: Without dead ends: 1419 [2018-11-18 16:08:52,111 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 16:08:52,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-11-18 16:08:52,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1417. [2018-11-18 16:08:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1417 states. [2018-11-18 16:08:52,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1735 transitions. [2018-11-18 16:08:52,140 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 1735 transitions. Word has length 24 [2018-11-18 16:08:52,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:52,140 INFO L480 AbstractCegarLoop]: Abstraction has 1417 states and 1735 transitions. [2018-11-18 16:08:52,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:52,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1735 transitions. [2018-11-18 16:08:52,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 16:08:52,141 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:52,141 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:52,142 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:52,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:52,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1513774788, now seen corresponding path program 1 times [2018-11-18 16:08:52,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:52,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:52,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:52,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:52,143 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:52,158 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 16:08:52,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:52,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:52,159 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:52,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:52,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:52,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:52,159 INFO L87 Difference]: Start difference. First operand 1417 states and 1735 transitions. Second operand 3 states. [2018-11-18 16:08:52,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:52,200 INFO L93 Difference]: Finished difference Result 2315 states and 2792 transitions. [2018-11-18 16:08:52,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:52,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 16:08:52,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:52,205 INFO L225 Difference]: With dead ends: 2315 [2018-11-18 16:08:52,205 INFO L226 Difference]: Without dead ends: 2313 [2018-11-18 16:08:52,206 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 16:08:52,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2018-11-18 16:08:52,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 2121. [2018-11-18 16:08:52,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2121 states. [2018-11-18 16:08:52,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 2535 transitions. [2018-11-18 16:08:52,246 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 2535 transitions. Word has length 24 [2018-11-18 16:08:52,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:52,246 INFO L480 AbstractCegarLoop]: Abstraction has 2121 states and 2535 transitions. [2018-11-18 16:08:52,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:52,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2535 transitions. [2018-11-18 16:08:52,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 16:08:52,248 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:08:52,248 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:08:52,249 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:08:52,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:08:52,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1906801798, now seen corresponding path program 1 times [2018-11-18 16:08:52,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:08:52,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:52,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:08:52,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:08:52,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:08:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:08:52,271 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 16:08:52,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:08:52,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:08:52,271 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:08:52,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:08:52,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:08:52,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:08:52,272 INFO L87 Difference]: Start difference. First operand 2121 states and 2535 transitions. Second operand 3 states. [2018-11-18 16:08:52,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:08:52,351 INFO L93 Difference]: Finished difference Result 4745 states and 5543 transitions. [2018-11-18 16:08:52,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:08:52,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 16:08:52,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:08:52,352 INFO L225 Difference]: With dead ends: 4745 [2018-11-18 16:08:52,352 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 16:08:52,355 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 16:08:52,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 16:08:52,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 16:08:52,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 16:08:52,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 16:08:52,356 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-11-18 16:08:52,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:08:52,356 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:08:52,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:08:52,357 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 16:08:52,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 16:08:52,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 16:08:52,384 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 16:08:52,384 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 16:08:52,384 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 16:08:52,384 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 16:08:52,384 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 16:08:52,384 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 16:08:52,384 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 121) no Hoare annotation was computed. [2018-11-18 16:08:52,384 INFO L425 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-11-18 16:08:52,384 INFO L425 ceAbstractionStarter]: For program point L86-1(lines 30 116) no Hoare annotation was computed. [2018-11-18 16:08:52,384 INFO L428 ceAbstractionStarter]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2018-11-18 16:08:52,384 INFO L425 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-11-18 16:08:52,385 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-18 16:08:52,385 INFO L421 ceAbstractionStarter]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2018-11-18 16:08:52,385 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 121) no Hoare annotation was computed. [2018-11-18 16:08:52,385 INFO L425 ceAbstractionStarter]: For program point L71-1(lines 30 116) no Hoare annotation was computed. [2018-11-18 16:08:52,385 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 30 116) no Hoare annotation was computed. [2018-11-18 16:08:52,385 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 30 116) no Hoare annotation was computed. [2018-11-18 16:08:52,385 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2018-11-18 16:08:52,385 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 30 116) no Hoare annotation was computed. [2018-11-18 16:08:52,385 INFO L425 ceAbstractionStarter]: For program point L55-1(lines 30 116) no Hoare annotation was computed. [2018-11-18 16:08:52,385 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-18 16:08:52,385 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 30 116) no Hoare annotation was computed. [2018-11-18 16:08:52,386 INFO L425 ceAbstractionStarter]: For program point L106-1(lines 30 116) no Hoare annotation was computed. [2018-11-18 16:08:52,386 INFO L425 ceAbstractionStarter]: For program point L32(lines 32 34) no Hoare annotation was computed. [2018-11-18 16:08:52,386 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-18 16:08:52,386 INFO L425 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2018-11-18 16:08:52,386 INFO L425 ceAbstractionStarter]: For program point L91-1(lines 30 116) no Hoare annotation was computed. [2018-11-18 16:08:52,386 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2018-11-18 16:08:52,386 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 30 116) no Hoare annotation was computed. [2018-11-18 16:08:52,386 INFO L425 ceAbstractionStarter]: For program point L67-1(lines 30 116) no Hoare annotation was computed. [2018-11-18 16:08:52,386 INFO L425 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2018-11-18 16:08:52,386 INFO L425 ceAbstractionStarter]: For program point L59-1(lines 30 116) no Hoare annotation was computed. [2018-11-18 16:08:52,386 INFO L428 ceAbstractionStarter]: At program point L117(lines 5 121) the Hoare annotation is: true [2018-11-18 16:08:52,387 INFO L425 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2018-11-18 16:08:52,387 INFO L425 ceAbstractionStarter]: For program point L51-2(lines 30 116) no Hoare annotation was computed. [2018-11-18 16:08:52,387 INFO L425 ceAbstractionStarter]: For program point L101-1(lines 30 116) no Hoare annotation was computed. [2018-11-18 16:08:52,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 04:08:52 BoogieIcfgContainer [2018-11-18 16:08:52,392 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 16:08:52,392 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:08:52,393 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:08:52,393 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:08:52,393 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:08:50" (3/4) ... [2018-11-18 16:08:52,397 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 16:08:52,401 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 16:08:52,401 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 16:08:52,404 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-18 16:08:52,405 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 16:08:52,405 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 16:08:52,441 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_25fd73cb-bdae-4ab0-9084-4c11c2480e90/bin-2019/utaipan/witness.graphml [2018-11-18 16:08:52,442 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:08:52,442 INFO L168 Benchmark]: Toolchain (without parser) took 1950.34 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 233.3 MB). Free memory was 959.2 MB in the beginning and 1.2 GB in the end (delta: -249.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:08:52,443 INFO L168 Benchmark]: CDTParser took 0.17 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 16:08:52,443 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.35 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:08:52,444 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.86 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:08:52,444 INFO L168 Benchmark]: Boogie Preprocessor took 13.82 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:08:52,444 INFO L168 Benchmark]: RCFGBuilder took 207.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-18 16:08:52,444 INFO L168 Benchmark]: TraceAbstraction took 1507.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 102.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -109.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:08:52,445 INFO L168 Benchmark]: Witness Printer took 49.13 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2018-11-18 16:08:52,446 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.17 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 157.35 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.86 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.82 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 207.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1507.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 102.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -109.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 49.13 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 36 locations, 1 error locations. SAFE Result, 1.4s OverallTime, 19 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1222 SDtfs, 563 SDslu, 809 SDs, 0 SdLazy, 101 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2121occurred in iteration=18, 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.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 655 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 138 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 400 NumberOfCodeBlocks, 400 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 381 ConstructedInterpolants, 0 QuantifiedInterpolants, 14032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...