./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_11_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_1207f287-29ac-43ca-af2b-f4e6991ec2b3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1207f287-29ac-43ca-af2b-f4e6991ec2b3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1207f287-29ac-43ca-af2b-f4e6991ec2b3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1207f287-29ac-43ca-af2b-f4e6991ec2b3/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_1207f287-29ac-43ca-af2b-f4e6991ec2b3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1207f287-29ac-43ca-af2b-f4e6991ec2b3/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 56f043bec3037ec37b4a132611abd4a337934428 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 10:28:32,090 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:28:32,090 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:28:32,097 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:28:32,097 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:28:32,098 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:28:32,099 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:28:32,100 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:28:32,101 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:28:32,101 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:28:32,102 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:28:32,102 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:28:32,103 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:28:32,104 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:28:32,104 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:28:32,105 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:28:32,105 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:28:32,106 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:28:32,108 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:28:32,109 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:28:32,109 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:28:32,110 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:28:32,112 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:28:32,112 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:28:32,112 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:28:32,113 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:28:32,113 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:28:32,114 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:28:32,114 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:28:32,115 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:28:32,115 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:28:32,116 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:28:32,116 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:28:32,116 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:28:32,117 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:28:32,117 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:28:32,117 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1207f287-29ac-43ca-af2b-f4e6991ec2b3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 10:28:32,126 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:28:32,126 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:28:32,127 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 10:28:32,127 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 10:28:32,127 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 10:28:32,127 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 10:28:32,127 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 10:28:32,127 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 10:28:32,128 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 10:28:32,128 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 10:28:32,128 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 10:28:32,128 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 10:28:32,128 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 10:28:32,128 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:28:32,129 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:28:32,129 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:28:32,129 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:28:32,129 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:28:32,129 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 10:28:32,129 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 10:28:32,129 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 10:28:32,130 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:28:32,130 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:28:32,130 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:28:32,130 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 10:28:32,130 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:28:32,130 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:28:32,130 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 10:28:32,131 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 10:28:32,131 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 10:28:32,131 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:28:32,131 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 10:28:32,131 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 10:28:32,131 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 10:28:32,131 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 10:28:32,131 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 10:28:32,132 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 10:28:32,132 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_1207f287-29ac-43ca-af2b-f4e6991ec2b3/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 -> 56f043bec3037ec37b4a132611abd4a337934428 [2018-11-18 10:28:32,153 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:28:32,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:28:32,162 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:28:32,163 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:28:32,163 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:28:32,164 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1207f287-29ac-43ca-af2b-f4e6991ec2b3/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 10:28:32,199 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1207f287-29ac-43ca-af2b-f4e6991ec2b3/bin-2019/utaipan/data/1c98ece2f/f238ffdda2e4417e98c2c12b5dd48003/FLAG46364c5b1 [2018-11-18 10:28:32,503 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:28:32,504 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1207f287-29ac-43ca-af2b-f4e6991ec2b3/sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 10:28:32,508 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1207f287-29ac-43ca-af2b-f4e6991ec2b3/bin-2019/utaipan/data/1c98ece2f/f238ffdda2e4417e98c2c12b5dd48003/FLAG46364c5b1 [2018-11-18 10:28:32,518 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1207f287-29ac-43ca-af2b-f4e6991ec2b3/bin-2019/utaipan/data/1c98ece2f/f238ffdda2e4417e98c2c12b5dd48003 [2018-11-18 10:28:32,520 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:28:32,521 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:28:32,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:28:32,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:28:32,524 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:28:32,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:28:32" (1/1) ... [2018-11-18 10:28:32,526 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bc33b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:32, skipping insertion in model container [2018-11-18 10:28:32,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:28:32" (1/1) ... [2018-11-18 10:28:32,534 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:28:32,551 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:28:32,664 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:28:32,667 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:28:32,686 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:28:32,697 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:28:32,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:32 WrapperNode [2018-11-18 10:28:32,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:28:32,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:28:32,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:28:32,698 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:28:32,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:32" (1/1) ... [2018-11-18 10:28:32,707 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:32" (1/1) ... [2018-11-18 10:28:32,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:28:32,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:28:32,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:28:32,711 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:28:32,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:32" (1/1) ... [2018-11-18 10:28:32,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:32" (1/1) ... [2018-11-18 10:28:32,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:32" (1/1) ... [2018-11-18 10:28:32,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:32" (1/1) ... [2018-11-18 10:28:32,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:32" (1/1) ... [2018-11-18 10:28:32,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:32" (1/1) ... [2018-11-18 10:28:32,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:32" (1/1) ... [2018-11-18 10:28:32,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:28:32,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:28:32,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:28:32,765 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:28:32,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1207f287-29ac-43ca-af2b-f4e6991ec2b3/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 10:28:32,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 10:28:32,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 10:28:32,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:28:32,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:28:32,808 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 10:28:32,808 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 10:28:32,999 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:28:32,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:28:32 BoogieIcfgContainer [2018-11-18 10:28:32,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:28:32,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 10:28:33,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 10:28:33,002 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 10:28:33,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:28:32" (1/3) ... [2018-11-18 10:28:33,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3e0b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:28:33, skipping insertion in model container [2018-11-18 10:28:33,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:28:32" (2/3) ... [2018-11-18 10:28:33,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a3e0b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:28:33, skipping insertion in model container [2018-11-18 10:28:33,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:28:32" (3/3) ... [2018-11-18 10:28:33,005 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 10:28:33,013 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 10:28:33,022 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 10:28:33,035 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 10:28:33,063 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 10:28:33,063 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 10:28:33,063 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 10:28:33,063 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:28:33,063 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:28:33,063 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 10:28:33,063 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:28:33,064 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 10:28:33,078 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-11-18 10:28:33,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 10:28:33,083 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:33,084 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 10:28:33,086 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:33,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:33,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1514281487, now seen corresponding path program 1 times [2018-11-18 10:28:33,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:33,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:33,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:33,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:33,132 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:33,224 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 10:28:33,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:33,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:33,226 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:33,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:33,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:33,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:33,244 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2018-11-18 10:28:33,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:33,278 INFO L93 Difference]: Finished difference Result 95 states and 164 transitions. [2018-11-18 10:28:33,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:33,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 10:28:33,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:33,286 INFO L225 Difference]: With dead ends: 95 [2018-11-18 10:28:33,286 INFO L226 Difference]: Without dead ends: 80 [2018-11-18 10:28:33,288 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 10:28:33,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-18 10:28:33,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 55. [2018-11-18 10:28:33,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-18 10:28:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 98 transitions. [2018-11-18 10:28:33,315 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 98 transitions. Word has length 22 [2018-11-18 10:28:33,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:33,315 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 98 transitions. [2018-11-18 10:28:33,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:33,315 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 98 transitions. [2018-11-18 10:28:33,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 10:28:33,316 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:33,316 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 10:28:33,316 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:33,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:33,316 INFO L82 PathProgramCache]: Analyzing trace with hash 503164237, now seen corresponding path program 1 times [2018-11-18 10:28:33,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:33,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:33,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:33,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:33,318 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:33,356 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 10:28:33,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:33,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:33,356 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:33,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:33,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:33,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:33,358 INFO L87 Difference]: Start difference. First operand 55 states and 98 transitions. Second operand 3 states. [2018-11-18 10:28:33,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:33,385 INFO L93 Difference]: Finished difference Result 130 states and 235 transitions. [2018-11-18 10:28:33,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:33,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 10:28:33,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:33,386 INFO L225 Difference]: With dead ends: 130 [2018-11-18 10:28:33,387 INFO L226 Difference]: Without dead ends: 80 [2018-11-18 10:28:33,387 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 10:28:33,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-18 10:28:33,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-11-18 10:28:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-18 10:28:33,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 139 transitions. [2018-11-18 10:28:33,395 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 139 transitions. Word has length 22 [2018-11-18 10:28:33,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:33,395 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 139 transitions. [2018-11-18 10:28:33,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:33,396 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 139 transitions. [2018-11-18 10:28:33,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 10:28:33,396 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:33,396 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 10:28:33,396 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:33,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:33,397 INFO L82 PathProgramCache]: Analyzing trace with hash -301701102, now seen corresponding path program 1 times [2018-11-18 10:28:33,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:33,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:33,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:33,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:33,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:33,428 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 10:28:33,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:33,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:33,428 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:33,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:33,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:33,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:33,429 INFO L87 Difference]: Start difference. First operand 78 states and 139 transitions. Second operand 3 states. [2018-11-18 10:28:33,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:33,456 INFO L93 Difference]: Finished difference Result 121 states and 211 transitions. [2018-11-18 10:28:33,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:33,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 10:28:33,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:33,458 INFO L225 Difference]: With dead ends: 121 [2018-11-18 10:28:33,458 INFO L226 Difference]: Without dead ends: 84 [2018-11-18 10:28:33,458 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 10:28:33,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-18 10:28:33,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-11-18 10:28:33,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-18 10:28:33,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 142 transitions. [2018-11-18 10:28:33,467 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 142 transitions. Word has length 23 [2018-11-18 10:28:33,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:33,467 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 142 transitions. [2018-11-18 10:28:33,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:33,467 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 142 transitions. [2018-11-18 10:28:33,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 10:28:33,468 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:33,468 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 10:28:33,468 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:33,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:33,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1581564780, now seen corresponding path program 1 times [2018-11-18 10:28:33,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:33,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:33,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:33,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:33,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:33,506 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 10:28:33,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:33,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:33,506 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:33,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:33,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:33,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:33,507 INFO L87 Difference]: Start difference. First operand 82 states and 142 transitions. Second operand 3 states. [2018-11-18 10:28:33,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:33,522 INFO L93 Difference]: Finished difference Result 153 states and 269 transitions. [2018-11-18 10:28:33,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:33,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 10:28:33,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:33,524 INFO L225 Difference]: With dead ends: 153 [2018-11-18 10:28:33,524 INFO L226 Difference]: Without dead ends: 151 [2018-11-18 10:28:33,524 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 10:28:33,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-18 10:28:33,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 107. [2018-11-18 10:28:33,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-18 10:28:33,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 187 transitions. [2018-11-18 10:28:33,531 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 187 transitions. Word has length 23 [2018-11-18 10:28:33,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:33,532 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 187 transitions. [2018-11-18 10:28:33,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:33,532 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 187 transitions. [2018-11-18 10:28:33,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 10:28:33,533 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:33,533 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 10:28:33,533 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:33,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:33,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1702285266, now seen corresponding path program 1 times [2018-11-18 10:28:33,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:33,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:33,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:33,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:33,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:33,557 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 10:28:33,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:33,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:33,557 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:33,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:33,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:33,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:33,558 INFO L87 Difference]: Start difference. First operand 107 states and 187 transitions. Second operand 3 states. [2018-11-18 10:28:33,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:33,594 INFO L93 Difference]: Finished difference Result 251 states and 445 transitions. [2018-11-18 10:28:33,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:33,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 10:28:33,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:33,595 INFO L225 Difference]: With dead ends: 251 [2018-11-18 10:28:33,595 INFO L226 Difference]: Without dead ends: 153 [2018-11-18 10:28:33,596 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 10:28:33,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-18 10:28:33,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-11-18 10:28:33,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-18 10:28:33,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 263 transitions. [2018-11-18 10:28:33,604 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 263 transitions. Word has length 23 [2018-11-18 10:28:33,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:33,604 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 263 transitions. [2018-11-18 10:28:33,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:33,605 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 263 transitions. [2018-11-18 10:28:33,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 10:28:33,605 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:33,605 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 10:28:33,606 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:33,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:33,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1783654526, now seen corresponding path program 1 times [2018-11-18 10:28:33,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:33,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:33,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:33,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:33,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:33,630 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 10:28:33,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:33,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:33,630 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:33,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:33,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:33,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:33,631 INFO L87 Difference]: Start difference. First operand 151 states and 263 transitions. Second operand 3 states. [2018-11-18 10:28:33,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:33,652 INFO L93 Difference]: Finished difference Result 226 states and 392 transitions. [2018-11-18 10:28:33,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:33,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 10:28:33,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:33,653 INFO L225 Difference]: With dead ends: 226 [2018-11-18 10:28:33,653 INFO L226 Difference]: Without dead ends: 155 [2018-11-18 10:28:33,654 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 10:28:33,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-18 10:28:33,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-11-18 10:28:33,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-18 10:28:33,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 263 transitions. [2018-11-18 10:28:33,661 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 263 transitions. Word has length 24 [2018-11-18 10:28:33,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:33,661 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 263 transitions. [2018-11-18 10:28:33,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:33,661 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 263 transitions. [2018-11-18 10:28:33,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 10:28:33,662 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:33,662 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 10:28:33,662 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:33,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:33,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1231449092, now seen corresponding path program 1 times [2018-11-18 10:28:33,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:33,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:33,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:33,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:33,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:33,691 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 10:28:33,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:33,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:33,691 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:33,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:33,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:33,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:33,692 INFO L87 Difference]: Start difference. First operand 153 states and 263 transitions. Second operand 3 states. [2018-11-18 10:28:33,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:33,707 INFO L93 Difference]: Finished difference Result 285 states and 497 transitions. [2018-11-18 10:28:33,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:33,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 10:28:33,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:33,708 INFO L225 Difference]: With dead ends: 285 [2018-11-18 10:28:33,708 INFO L226 Difference]: Without dead ends: 283 [2018-11-18 10:28:33,708 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 10:28:33,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-11-18 10:28:33,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 205. [2018-11-18 10:28:33,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-11-18 10:28:33,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 351 transitions. [2018-11-18 10:28:33,717 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 351 transitions. Word has length 24 [2018-11-18 10:28:33,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:33,717 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 351 transitions. [2018-11-18 10:28:33,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:33,718 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 351 transitions. [2018-11-18 10:28:33,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 10:28:33,719 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:33,719 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 10:28:33,719 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:33,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:33,719 INFO L82 PathProgramCache]: Analyzing trace with hash 220331842, now seen corresponding path program 1 times [2018-11-18 10:28:33,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:33,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:33,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:33,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:33,720 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:33,739 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 10:28:33,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:33,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:33,739 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:33,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:33,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:33,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:33,740 INFO L87 Difference]: Start difference. First operand 205 states and 351 transitions. Second operand 3 states. [2018-11-18 10:28:33,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:33,767 INFO L93 Difference]: Finished difference Result 485 states and 837 transitions. [2018-11-18 10:28:33,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:33,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 10:28:33,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:33,769 INFO L225 Difference]: With dead ends: 485 [2018-11-18 10:28:33,769 INFO L226 Difference]: Without dead ends: 291 [2018-11-18 10:28:33,770 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 10:28:33,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-11-18 10:28:33,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2018-11-18 10:28:33,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-18 10:28:33,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 491 transitions. [2018-11-18 10:28:33,779 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 491 transitions. Word has length 24 [2018-11-18 10:28:33,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:33,779 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 491 transitions. [2018-11-18 10:28:33,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:33,779 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 491 transitions. [2018-11-18 10:28:33,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 10:28:33,780 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:33,781 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:33,781 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:33,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:33,781 INFO L82 PathProgramCache]: Analyzing trace with hash -479570073, now seen corresponding path program 1 times [2018-11-18 10:28:33,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:33,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:33,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:33,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:33,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:33,806 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 10:28:33,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:33,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:33,806 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:33,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:33,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:33,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:33,807 INFO L87 Difference]: Start difference. First operand 289 states and 491 transitions. Second operand 3 states. [2018-11-18 10:28:33,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:33,821 INFO L93 Difference]: Finished difference Result 433 states and 733 transitions. [2018-11-18 10:28:33,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:33,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 10:28:33,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:33,822 INFO L225 Difference]: With dead ends: 433 [2018-11-18 10:28:33,822 INFO L226 Difference]: Without dead ends: 295 [2018-11-18 10:28:33,823 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 10:28:33,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-11-18 10:28:33,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2018-11-18 10:28:33,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-11-18 10:28:33,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 491 transitions. [2018-11-18 10:28:33,832 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 491 transitions. Word has length 25 [2018-11-18 10:28:33,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:33,832 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 491 transitions. [2018-11-18 10:28:33,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:33,832 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 491 transitions. [2018-11-18 10:28:33,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 10:28:33,833 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:33,834 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:33,834 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:33,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:33,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1759433751, now seen corresponding path program 1 times [2018-11-18 10:28:33,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:33,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:33,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:33,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:33,835 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:33,862 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 10:28:33,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:33,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:33,863 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:33,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:33,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:33,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:33,864 INFO L87 Difference]: Start difference. First operand 293 states and 491 transitions. Second operand 3 states. [2018-11-18 10:28:33,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:33,885 INFO L93 Difference]: Finished difference Result 541 states and 921 transitions. [2018-11-18 10:28:33,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:33,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 10:28:33,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:33,887 INFO L225 Difference]: With dead ends: 541 [2018-11-18 10:28:33,887 INFO L226 Difference]: Without dead ends: 539 [2018-11-18 10:28:33,888 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 10:28:33,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-11-18 10:28:33,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 401. [2018-11-18 10:28:33,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-11-18 10:28:33,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 663 transitions. [2018-11-18 10:28:33,901 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 663 transitions. Word has length 25 [2018-11-18 10:28:33,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:33,901 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 663 transitions. [2018-11-18 10:28:33,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:33,901 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 663 transitions. [2018-11-18 10:28:33,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 10:28:33,902 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:33,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, 1, 1] [2018-11-18 10:28:33,903 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:33,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:33,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1524416295, now seen corresponding path program 1 times [2018-11-18 10:28:33,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:33,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:33,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:33,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:33,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:33,923 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 10:28:33,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:33,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:33,924 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:33,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:33,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:33,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:33,924 INFO L87 Difference]: Start difference. First operand 401 states and 663 transitions. Second operand 3 states. [2018-11-18 10:28:33,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:33,958 INFO L93 Difference]: Finished difference Result 949 states and 1577 transitions. [2018-11-18 10:28:33,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:33,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 10:28:33,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:33,960 INFO L225 Difference]: With dead ends: 949 [2018-11-18 10:28:33,960 INFO L226 Difference]: Without dead ends: 563 [2018-11-18 10:28:33,961 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 10:28:33,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-11-18 10:28:33,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 561. [2018-11-18 10:28:33,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-11-18 10:28:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 919 transitions. [2018-11-18 10:28:33,973 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 919 transitions. Word has length 25 [2018-11-18 10:28:33,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:33,973 INFO L480 AbstractCegarLoop]: Abstraction has 561 states and 919 transitions. [2018-11-18 10:28:33,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:33,973 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 919 transitions. [2018-11-18 10:28:33,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 10:28:33,974 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:33,974 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:33,974 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:33,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:33,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1292342647, now seen corresponding path program 1 times [2018-11-18 10:28:33,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:33,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:33,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:33,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:33,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:34,000 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 10:28:34,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:34,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:34,000 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:34,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:34,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:34,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:34,001 INFO L87 Difference]: Start difference. First operand 561 states and 919 transitions. Second operand 3 states. [2018-11-18 10:28:34,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:34,019 INFO L93 Difference]: Finished difference Result 841 states and 1373 transitions. [2018-11-18 10:28:34,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:34,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 10:28:34,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:34,021 INFO L225 Difference]: With dead ends: 841 [2018-11-18 10:28:34,021 INFO L226 Difference]: Without dead ends: 571 [2018-11-18 10:28:34,022 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 10:28:34,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-11-18 10:28:34,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 569. [2018-11-18 10:28:34,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2018-11-18 10:28:34,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 919 transitions. [2018-11-18 10:28:34,032 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 919 transitions. Word has length 26 [2018-11-18 10:28:34,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:34,033 INFO L480 AbstractCegarLoop]: Abstraction has 569 states and 919 transitions. [2018-11-18 10:28:34,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:34,033 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 919 transitions. [2018-11-18 10:28:34,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 10:28:34,033 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:34,034 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:34,034 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:34,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:34,034 INFO L82 PathProgramCache]: Analyzing trace with hash 12478969, now seen corresponding path program 1 times [2018-11-18 10:28:34,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:34,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:34,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:34,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:34,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:34,050 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 10:28:34,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:34,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:34,050 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:34,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:34,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:34,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:34,051 INFO L87 Difference]: Start difference. First operand 569 states and 919 transitions. Second operand 3 states. [2018-11-18 10:28:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:34,080 INFO L93 Difference]: Finished difference Result 1645 states and 2649 transitions. [2018-11-18 10:28:34,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:34,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 10:28:34,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:34,083 INFO L225 Difference]: With dead ends: 1645 [2018-11-18 10:28:34,083 INFO L226 Difference]: Without dead ends: 1099 [2018-11-18 10:28:34,084 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 10:28:34,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2018-11-18 10:28:34,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1097. [2018-11-18 10:28:34,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2018-11-18 10:28:34,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1735 transitions. [2018-11-18 10:28:34,103 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1735 transitions. Word has length 26 [2018-11-18 10:28:34,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:34,104 INFO L480 AbstractCegarLoop]: Abstraction has 1097 states and 1735 transitions. [2018-11-18 10:28:34,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:34,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1735 transitions. [2018-11-18 10:28:34,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 10:28:34,105 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:34,105 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:34,105 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:34,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:34,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1023596219, now seen corresponding path program 1 times [2018-11-18 10:28:34,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:34,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:34,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:34,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:34,107 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:34,122 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 10:28:34,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:34,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:34,123 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:34,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:34,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:34,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:34,124 INFO L87 Difference]: Start difference. First operand 1097 states and 1735 transitions. Second operand 3 states. [2018-11-18 10:28:34,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:34,150 INFO L93 Difference]: Finished difference Result 1341 states and 2169 transitions. [2018-11-18 10:28:34,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:34,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 10:28:34,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:34,154 INFO L225 Difference]: With dead ends: 1341 [2018-11-18 10:28:34,154 INFO L226 Difference]: Without dead ends: 1339 [2018-11-18 10:28:34,154 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 10:28:34,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2018-11-18 10:28:34,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1097. [2018-11-18 10:28:34,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2018-11-18 10:28:34,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1719 transitions. [2018-11-18 10:28:34,185 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1719 transitions. Word has length 26 [2018-11-18 10:28:34,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:34,185 INFO L480 AbstractCegarLoop]: Abstraction has 1097 states and 1719 transitions. [2018-11-18 10:28:34,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:34,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1719 transitions. [2018-11-18 10:28:34,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 10:28:34,186 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:34,186 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:34,186 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:34,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:34,187 INFO L82 PathProgramCache]: Analyzing trace with hash 387062460, now seen corresponding path program 1 times [2018-11-18 10:28:34,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:34,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:34,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:34,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:34,188 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:34,212 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 10:28:34,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:34,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:34,213 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:34,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:34,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:34,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:34,214 INFO L87 Difference]: Start difference. First operand 1097 states and 1719 transitions. Second operand 3 states. [2018-11-18 10:28:34,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:34,248 INFO L93 Difference]: Finished difference Result 1981 states and 3161 transitions. [2018-11-18 10:28:34,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:34,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 10:28:34,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:34,254 INFO L225 Difference]: With dead ends: 1981 [2018-11-18 10:28:34,254 INFO L226 Difference]: Without dead ends: 1979 [2018-11-18 10:28:34,254 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 10:28:34,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2018-11-18 10:28:34,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1561. [2018-11-18 10:28:34,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2018-11-18 10:28:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2391 transitions. [2018-11-18 10:28:34,297 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2391 transitions. Word has length 27 [2018-11-18 10:28:34,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:34,298 INFO L480 AbstractCegarLoop]: Abstraction has 1561 states and 2391 transitions. [2018-11-18 10:28:34,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:34,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2391 transitions. [2018-11-18 10:28:34,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 10:28:34,300 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:34,300 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:34,300 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:34,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:34,300 INFO L82 PathProgramCache]: Analyzing trace with hash -624054790, now seen corresponding path program 1 times [2018-11-18 10:28:34,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:34,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:34,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:34,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:34,301 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:34,322 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 10:28:34,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:34,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:34,323 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:34,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:34,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:34,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:34,324 INFO L87 Difference]: Start difference. First operand 1561 states and 2391 transitions. Second operand 3 states. [2018-11-18 10:28:34,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:34,366 INFO L93 Difference]: Finished difference Result 3677 states and 5657 transitions. [2018-11-18 10:28:34,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:34,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 10:28:34,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:34,372 INFO L225 Difference]: With dead ends: 3677 [2018-11-18 10:28:34,372 INFO L226 Difference]: Without dead ends: 2139 [2018-11-18 10:28:34,374 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 10:28:34,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2018-11-18 10:28:34,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2137. [2018-11-18 10:28:34,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2137 states. [2018-11-18 10:28:34,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 3239 transitions. [2018-11-18 10:28:34,430 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 3239 transitions. Word has length 27 [2018-11-18 10:28:34,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:34,430 INFO L480 AbstractCegarLoop]: Abstraction has 2137 states and 3239 transitions. [2018-11-18 10:28:34,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:34,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 3239 transitions. [2018-11-18 10:28:34,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 10:28:34,432 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:34,433 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:34,433 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:34,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:34,433 INFO L82 PathProgramCache]: Analyzing trace with hash -885750866, now seen corresponding path program 1 times [2018-11-18 10:28:34,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:34,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:34,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:34,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:34,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:34,446 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 10:28:34,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:34,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:34,447 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:34,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:34,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:34,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:34,448 INFO L87 Difference]: Start difference. First operand 2137 states and 3239 transitions. Second operand 3 states. [2018-11-18 10:28:34,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:34,498 INFO L93 Difference]: Finished difference Result 3229 states and 4889 transitions. [2018-11-18 10:28:34,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:34,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 10:28:34,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:34,503 INFO L225 Difference]: With dead ends: 3229 [2018-11-18 10:28:34,503 INFO L226 Difference]: Without dead ends: 2187 [2018-11-18 10:28:34,505 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 10:28:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2018-11-18 10:28:34,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2185. [2018-11-18 10:28:34,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2185 states. [2018-11-18 10:28:34,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2185 states to 2185 states and 3271 transitions. [2018-11-18 10:28:34,588 INFO L78 Accepts]: Start accepts. Automaton has 2185 states and 3271 transitions. Word has length 28 [2018-11-18 10:28:34,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:34,588 INFO L480 AbstractCegarLoop]: Abstraction has 2185 states and 3271 transitions. [2018-11-18 10:28:34,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:34,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 3271 transitions. [2018-11-18 10:28:34,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 10:28:34,590 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:34,590 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:34,591 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:34,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:34,591 INFO L82 PathProgramCache]: Analyzing trace with hash 2129352752, now seen corresponding path program 1 times [2018-11-18 10:28:34,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:34,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:34,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:34,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:34,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:34,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 10:28:34,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:34,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:34,616 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:34,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:34,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:34,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:34,617 INFO L87 Difference]: Start difference. First operand 2185 states and 3271 transitions. Second operand 3 states. [2018-11-18 10:28:34,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:34,685 INFO L93 Difference]: Finished difference Result 3853 states and 5865 transitions. [2018-11-18 10:28:34,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:34,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 10:28:34,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:34,694 INFO L225 Difference]: With dead ends: 3853 [2018-11-18 10:28:34,695 INFO L226 Difference]: Without dead ends: 3851 [2018-11-18 10:28:34,696 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 10:28:34,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2018-11-18 10:28:34,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 3145. [2018-11-18 10:28:34,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3145 states. [2018-11-18 10:28:34,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 4583 transitions. [2018-11-18 10:28:34,771 INFO L78 Accepts]: Start accepts. Automaton has 3145 states and 4583 transitions. Word has length 28 [2018-11-18 10:28:34,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:34,771 INFO L480 AbstractCegarLoop]: Abstraction has 3145 states and 4583 transitions. [2018-11-18 10:28:34,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:34,771 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 4583 transitions. [2018-11-18 10:28:34,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 10:28:34,774 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:34,774 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:34,775 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:34,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:34,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1118235502, now seen corresponding path program 1 times [2018-11-18 10:28:34,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:34,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:34,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:34,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:34,776 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:34,802 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 10:28:34,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:34,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:34,803 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:34,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:34,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:34,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:34,803 INFO L87 Difference]: Start difference. First operand 3145 states and 4583 transitions. Second operand 3 states. [2018-11-18 10:28:34,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:34,901 INFO L93 Difference]: Finished difference Result 7309 states and 10665 transitions. [2018-11-18 10:28:34,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:34,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 10:28:34,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:34,912 INFO L225 Difference]: With dead ends: 7309 [2018-11-18 10:28:34,912 INFO L226 Difference]: Without dead ends: 4235 [2018-11-18 10:28:34,916 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 10:28:34,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4235 states. [2018-11-18 10:28:35,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4235 to 4233. [2018-11-18 10:28:35,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4233 states. [2018-11-18 10:28:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4233 states to 4233 states and 6087 transitions. [2018-11-18 10:28:35,023 INFO L78 Accepts]: Start accepts. Automaton has 4233 states and 6087 transitions. Word has length 28 [2018-11-18 10:28:35,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:35,023 INFO L480 AbstractCegarLoop]: Abstraction has 4233 states and 6087 transitions. [2018-11-18 10:28:35,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:35,023 INFO L276 IsEmpty]: Start isEmpty. Operand 4233 states and 6087 transitions. [2018-11-18 10:28:35,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 10:28:35,026 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:35,026 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:35,027 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:35,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:35,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1585640975, now seen corresponding path program 1 times [2018-11-18 10:28:35,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:35,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:35,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:35,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:35,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:35,054 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 10:28:35,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:35,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:35,055 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:35,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:35,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:35,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:35,057 INFO L87 Difference]: Start difference. First operand 4233 states and 6087 transitions. Second operand 3 states. [2018-11-18 10:28:35,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:35,119 INFO L93 Difference]: Finished difference Result 6349 states and 9097 transitions. [2018-11-18 10:28:35,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:35,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 10:28:35,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:35,130 INFO L225 Difference]: With dead ends: 6349 [2018-11-18 10:28:35,130 INFO L226 Difference]: Without dead ends: 4299 [2018-11-18 10:28:35,133 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 10:28:35,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4299 states. [2018-11-18 10:28:35,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4299 to 4297. [2018-11-18 10:28:35,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4297 states. [2018-11-18 10:28:35,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4297 states to 4297 states and 6087 transitions. [2018-11-18 10:28:35,232 INFO L78 Accepts]: Start accepts. Automaton has 4297 states and 6087 transitions. Word has length 29 [2018-11-18 10:28:35,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:35,232 INFO L480 AbstractCegarLoop]: Abstraction has 4297 states and 6087 transitions. [2018-11-18 10:28:35,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:35,232 INFO L276 IsEmpty]: Start isEmpty. Operand 4297 states and 6087 transitions. [2018-11-18 10:28:35,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 10:28:35,236 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:35,236 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:35,236 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:35,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:35,236 INFO L82 PathProgramCache]: Analyzing trace with hash 305777297, now seen corresponding path program 1 times [2018-11-18 10:28:35,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:35,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:35,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:35,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:35,237 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:35,261 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 10:28:35,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:35,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:35,261 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:35,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:35,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:35,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:35,262 INFO L87 Difference]: Start difference. First operand 4297 states and 6087 transitions. Second operand 3 states. [2018-11-18 10:28:35,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:35,354 INFO L93 Difference]: Finished difference Result 7437 states and 10697 transitions. [2018-11-18 10:28:35,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:35,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 10:28:35,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:35,366 INFO L225 Difference]: With dead ends: 7437 [2018-11-18 10:28:35,367 INFO L226 Difference]: Without dead ends: 7435 [2018-11-18 10:28:35,369 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 10:28:35,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2018-11-18 10:28:35,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 6281. [2018-11-18 10:28:35,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6281 states. [2018-11-18 10:28:35,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6281 states to 6281 states and 8647 transitions. [2018-11-18 10:28:35,491 INFO L78 Accepts]: Start accepts. Automaton has 6281 states and 8647 transitions. Word has length 29 [2018-11-18 10:28:35,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:35,491 INFO L480 AbstractCegarLoop]: Abstraction has 6281 states and 8647 transitions. [2018-11-18 10:28:35,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:35,491 INFO L276 IsEmpty]: Start isEmpty. Operand 6281 states and 8647 transitions. [2018-11-18 10:28:35,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 10:28:35,499 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:35,499 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:35,499 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:35,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:35,500 INFO L82 PathProgramCache]: Analyzing trace with hash -705339953, now seen corresponding path program 1 times [2018-11-18 10:28:35,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:35,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:35,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:35,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:35,501 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:35,523 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 10:28:35,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:35,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:35,523 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:35,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:35,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:35,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:35,524 INFO L87 Difference]: Start difference. First operand 6281 states and 8647 transitions. Second operand 3 states. [2018-11-18 10:28:35,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:35,659 INFO L93 Difference]: Finished difference Result 14477 states and 19913 transitions. [2018-11-18 10:28:35,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:35,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 10:28:35,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:35,674 INFO L225 Difference]: With dead ends: 14477 [2018-11-18 10:28:35,674 INFO L226 Difference]: Without dead ends: 8331 [2018-11-18 10:28:35,683 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 10:28:35,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8331 states. [2018-11-18 10:28:35,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8331 to 8329. [2018-11-18 10:28:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8329 states. [2018-11-18 10:28:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8329 states to 8329 states and 11271 transitions. [2018-11-18 10:28:35,874 INFO L78 Accepts]: Start accepts. Automaton has 8329 states and 11271 transitions. Word has length 29 [2018-11-18 10:28:35,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:35,874 INFO L480 AbstractCegarLoop]: Abstraction has 8329 states and 11271 transitions. [2018-11-18 10:28:35,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:35,874 INFO L276 IsEmpty]: Start isEmpty. Operand 8329 states and 11271 transitions. [2018-11-18 10:28:35,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 10:28:35,881 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:35,881 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:35,881 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:35,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:35,881 INFO L82 PathProgramCache]: Analyzing trace with hash 889377059, now seen corresponding path program 1 times [2018-11-18 10:28:35,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:35,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:35,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:35,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:35,882 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:35,915 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 10:28:35,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:35,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:35,915 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:35,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:35,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:35,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:35,916 INFO L87 Difference]: Start difference. First operand 8329 states and 11271 transitions. Second operand 3 states. [2018-11-18 10:28:36,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:36,018 INFO L93 Difference]: Finished difference Result 12493 states and 16841 transitions. [2018-11-18 10:28:36,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:36,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 10:28:36,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:36,030 INFO L225 Difference]: With dead ends: 12493 [2018-11-18 10:28:36,031 INFO L226 Difference]: Without dead ends: 8459 [2018-11-18 10:28:36,037 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 10:28:36,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8459 states. [2018-11-18 10:28:36,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8459 to 8457. [2018-11-18 10:28:36,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8457 states. [2018-11-18 10:28:36,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8457 states to 8457 states and 11271 transitions. [2018-11-18 10:28:36,180 INFO L78 Accepts]: Start accepts. Automaton has 8457 states and 11271 transitions. Word has length 30 [2018-11-18 10:28:36,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:36,180 INFO L480 AbstractCegarLoop]: Abstraction has 8457 states and 11271 transitions. [2018-11-18 10:28:36,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:36,180 INFO L276 IsEmpty]: Start isEmpty. Operand 8457 states and 11271 transitions. [2018-11-18 10:28:36,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 10:28:36,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:36,184 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:36,185 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:36,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:36,185 INFO L82 PathProgramCache]: Analyzing trace with hash -390486619, now seen corresponding path program 1 times [2018-11-18 10:28:36,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:36,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:36,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:36,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:36,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:36,206 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 10:28:36,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:36,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:36,206 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:36,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:36,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:36,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:36,207 INFO L87 Difference]: Start difference. First operand 8457 states and 11271 transitions. Second operand 3 states. [2018-11-18 10:28:36,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:36,306 INFO L93 Difference]: Finished difference Result 14349 states and 19337 transitions. [2018-11-18 10:28:36,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:36,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 10:28:36,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:36,319 INFO L225 Difference]: With dead ends: 14349 [2018-11-18 10:28:36,319 INFO L226 Difference]: Without dead ends: 14347 [2018-11-18 10:28:36,321 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 10:28:36,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14347 states. [2018-11-18 10:28:36,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14347 to 12553. [2018-11-18 10:28:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12553 states. [2018-11-18 10:28:36,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12553 states to 12553 states and 16263 transitions. [2018-11-18 10:28:36,461 INFO L78 Accepts]: Start accepts. Automaton has 12553 states and 16263 transitions. Word has length 30 [2018-11-18 10:28:36,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:36,461 INFO L480 AbstractCegarLoop]: Abstraction has 12553 states and 16263 transitions. [2018-11-18 10:28:36,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:36,462 INFO L276 IsEmpty]: Start isEmpty. Operand 12553 states and 16263 transitions. [2018-11-18 10:28:36,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 10:28:36,469 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:36,469 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:36,469 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:36,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:36,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1401603869, now seen corresponding path program 1 times [2018-11-18 10:28:36,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:36,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:36,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:36,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:36,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:36,490 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 10:28:36,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:36,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:36,491 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:36,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:36,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:36,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:36,491 INFO L87 Difference]: Start difference. First operand 12553 states and 16263 transitions. Second operand 3 states. [2018-11-18 10:28:36,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:36,663 INFO L93 Difference]: Finished difference Result 28685 states and 37001 transitions. [2018-11-18 10:28:36,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:36,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 10:28:36,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:36,675 INFO L225 Difference]: With dead ends: 28685 [2018-11-18 10:28:36,675 INFO L226 Difference]: Without dead ends: 16395 [2018-11-18 10:28:36,683 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 10:28:36,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16395 states. [2018-11-18 10:28:36,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16395 to 16393. [2018-11-18 10:28:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16393 states. [2018-11-18 10:28:36,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16393 states to 16393 states and 20743 transitions. [2018-11-18 10:28:36,869 INFO L78 Accepts]: Start accepts. Automaton has 16393 states and 20743 transitions. Word has length 30 [2018-11-18 10:28:36,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:36,869 INFO L480 AbstractCegarLoop]: Abstraction has 16393 states and 20743 transitions. [2018-11-18 10:28:36,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:36,869 INFO L276 IsEmpty]: Start isEmpty. Operand 16393 states and 20743 transitions. [2018-11-18 10:28:36,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 10:28:36,875 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:36,875 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:36,875 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:36,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:36,875 INFO L82 PathProgramCache]: Analyzing trace with hash 780032484, now seen corresponding path program 1 times [2018-11-18 10:28:36,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:36,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:36,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:36,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:36,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:36,894 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 10:28:36,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:36,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:36,894 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:36,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:36,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:36,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:36,895 INFO L87 Difference]: Start difference. First operand 16393 states and 20743 transitions. Second operand 3 states. [2018-11-18 10:28:37,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:37,027 INFO L93 Difference]: Finished difference Result 24589 states and 30985 transitions. [2018-11-18 10:28:37,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:37,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 10:28:37,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:37,041 INFO L225 Difference]: With dead ends: 24589 [2018-11-18 10:28:37,041 INFO L226 Difference]: Without dead ends: 16651 [2018-11-18 10:28:37,048 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 10:28:37,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16651 states. [2018-11-18 10:28:37,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16651 to 16649. [2018-11-18 10:28:37,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16649 states. [2018-11-18 10:28:37,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16649 states to 16649 states and 20743 transitions. [2018-11-18 10:28:37,333 INFO L78 Accepts]: Start accepts. Automaton has 16649 states and 20743 transitions. Word has length 31 [2018-11-18 10:28:37,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:37,333 INFO L480 AbstractCegarLoop]: Abstraction has 16649 states and 20743 transitions. [2018-11-18 10:28:37,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:37,333 INFO L276 IsEmpty]: Start isEmpty. Operand 16649 states and 20743 transitions. [2018-11-18 10:28:37,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 10:28:37,338 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:37,338 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:37,338 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:37,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:37,339 INFO L82 PathProgramCache]: Analyzing trace with hash -499831194, now seen corresponding path program 1 times [2018-11-18 10:28:37,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:37,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:37,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:37,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:37,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:37,363 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 10:28:37,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:37,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:37,364 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:37,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:37,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:37,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:37,364 INFO L87 Difference]: Start difference. First operand 16649 states and 20743 transitions. Second operand 3 states. [2018-11-18 10:28:37,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:37,609 INFO L93 Difference]: Finished difference Result 27661 states and 34569 transitions. [2018-11-18 10:28:37,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:37,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 10:28:37,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:37,625 INFO L225 Difference]: With dead ends: 27661 [2018-11-18 10:28:37,625 INFO L226 Difference]: Without dead ends: 27659 [2018-11-18 10:28:37,629 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 10:28:37,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27659 states. [2018-11-18 10:28:37,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27659 to 25097. [2018-11-18 10:28:37,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25097 states. [2018-11-18 10:28:37,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25097 states to 25097 states and 30471 transitions. [2018-11-18 10:28:37,880 INFO L78 Accepts]: Start accepts. Automaton has 25097 states and 30471 transitions. Word has length 31 [2018-11-18 10:28:37,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:37,880 INFO L480 AbstractCegarLoop]: Abstraction has 25097 states and 30471 transitions. [2018-11-18 10:28:37,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:37,880 INFO L276 IsEmpty]: Start isEmpty. Operand 25097 states and 30471 transitions. [2018-11-18 10:28:37,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 10:28:37,890 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:37,890 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:37,890 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:37,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:37,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1510948444, now seen corresponding path program 1 times [2018-11-18 10:28:37,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:37,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:37,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:37,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:37,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:37,922 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 10:28:37,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:37,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:37,922 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:37,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:37,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:37,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:37,923 INFO L87 Difference]: Start difference. First operand 25097 states and 30471 transitions. Second operand 3 states. [2018-11-18 10:28:38,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:38,286 INFO L93 Difference]: Finished difference Result 56845 states and 68361 transitions. [2018-11-18 10:28:38,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:38,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 10:28:38,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:38,302 INFO L225 Difference]: With dead ends: 56845 [2018-11-18 10:28:38,302 INFO L226 Difference]: Without dead ends: 32267 [2018-11-18 10:28:38,317 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 10:28:38,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32267 states. [2018-11-18 10:28:38,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32267 to 32265. [2018-11-18 10:28:38,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32265 states. [2018-11-18 10:28:38,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32265 states to 32265 states and 37895 transitions. [2018-11-18 10:28:38,689 INFO L78 Accepts]: Start accepts. Automaton has 32265 states and 37895 transitions. Word has length 31 [2018-11-18 10:28:38,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:38,689 INFO L480 AbstractCegarLoop]: Abstraction has 32265 states and 37895 transitions. [2018-11-18 10:28:38,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:38,690 INFO L276 IsEmpty]: Start isEmpty. Operand 32265 states and 37895 transitions. [2018-11-18 10:28:38,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 10:28:38,699 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:38,699 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:38,699 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:38,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:38,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1685318296, now seen corresponding path program 1 times [2018-11-18 10:28:38,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:38,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:38,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:38,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:38,700 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:38,726 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 10:28:38,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:38,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:38,727 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:38,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:38,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:38,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:38,727 INFO L87 Difference]: Start difference. First operand 32265 states and 37895 transitions. Second operand 3 states. [2018-11-18 10:28:39,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:39,105 INFO L93 Difference]: Finished difference Result 48397 states and 56585 transitions. [2018-11-18 10:28:39,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:39,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 10:28:39,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:39,122 INFO L225 Difference]: With dead ends: 48397 [2018-11-18 10:28:39,123 INFO L226 Difference]: Without dead ends: 32779 [2018-11-18 10:28:39,132 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 10:28:39,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32779 states. [2018-11-18 10:28:39,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32779 to 32777. [2018-11-18 10:28:39,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32777 states. [2018-11-18 10:28:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32777 states to 32777 states and 37895 transitions. [2018-11-18 10:28:39,522 INFO L78 Accepts]: Start accepts. Automaton has 32777 states and 37895 transitions. Word has length 32 [2018-11-18 10:28:39,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:39,522 INFO L480 AbstractCegarLoop]: Abstraction has 32777 states and 37895 transitions. [2018-11-18 10:28:39,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:39,522 INFO L276 IsEmpty]: Start isEmpty. Operand 32777 states and 37895 transitions. [2018-11-18 10:28:39,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 10:28:39,531 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:39,531 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:39,531 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:39,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:39,531 INFO L82 PathProgramCache]: Analyzing trace with hash 405454618, now seen corresponding path program 1 times [2018-11-18 10:28:39,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:39,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:39,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:39,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:39,532 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:39,566 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 10:28:39,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:39,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:39,566 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:39,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:39,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:39,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:39,567 INFO L87 Difference]: Start difference. First operand 32777 states and 37895 transitions. Second operand 3 states. [2018-11-18 10:28:40,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:40,044 INFO L93 Difference]: Finished difference Result 53259 states and 60936 transitions. [2018-11-18 10:28:40,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:40,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 10:28:40,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:40,079 INFO L225 Difference]: With dead ends: 53259 [2018-11-18 10:28:40,079 INFO L226 Difference]: Without dead ends: 53257 [2018-11-18 10:28:40,087 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 10:28:40,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53257 states. [2018-11-18 10:28:40,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53257 to 50185. [2018-11-18 10:28:40,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50185 states. [2018-11-18 10:28:40,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50185 states to 50185 states and 56839 transitions. [2018-11-18 10:28:40,753 INFO L78 Accepts]: Start accepts. Automaton has 50185 states and 56839 transitions. Word has length 32 [2018-11-18 10:28:40,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:40,753 INFO L480 AbstractCegarLoop]: Abstraction has 50185 states and 56839 transitions. [2018-11-18 10:28:40,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:40,753 INFO L276 IsEmpty]: Start isEmpty. Operand 50185 states and 56839 transitions. [2018-11-18 10:28:40,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 10:28:40,772 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:28:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:28:40,772 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:28:40,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:28:40,772 INFO L82 PathProgramCache]: Analyzing trace with hash -605662632, now seen corresponding path program 1 times [2018-11-18 10:28:40,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:28:40,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:40,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:28:40,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:28:40,773 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:28:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:28:40,798 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 10:28:40,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:28:40,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:28:40,798 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:28:40,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:28:40,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:28:40,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:28:40,799 INFO L87 Difference]: Start difference. First operand 50185 states and 56839 transitions. Second operand 3 states. [2018-11-18 10:28:41,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:28:41,369 INFO L93 Difference]: Finished difference Result 112649 states and 125447 transitions. [2018-11-18 10:28:41,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:28:41,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 10:28:41,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:28:41,370 INFO L225 Difference]: With dead ends: 112649 [2018-11-18 10:28:41,370 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 10:28:41,418 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 10:28:41,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 10:28:41,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 10:28:41,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 10:28:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 10:28:41,418 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-11-18 10:28:41,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:28:41,418 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:28:41,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:28:41,419 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 10:28:41,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 10:28:41,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 10:28:41,454 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 10:28:41,454 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 10:28:41,454 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 10:28:41,454 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 10:28:41,455 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 10:28:41,455 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 10:28:41,455 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 177) no Hoare annotation was computed. [2018-11-18 10:28:41,455 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-18 10:28:41,455 INFO L425 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2018-11-18 10:28:41,455 INFO L425 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2018-11-18 10:28:41,455 INFO L425 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-11-18 10:28:41,455 INFO L421 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2018-11-18 10:28:41,455 INFO L425 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 10:28:41,455 INFO L425 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 10:28:41,455 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 10:28:41,455 INFO L425 ceAbstractionStarter]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 10:28:41,455 INFO L425 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2018-11-18 10:28:41,456 INFO L425 ceAbstractionStarter]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 10:28:41,456 INFO L425 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-11-18 10:28:41,456 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 10:28:41,456 INFO L425 ceAbstractionStarter]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 10:28:41,456 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 177) no Hoare annotation was computed. [2018-11-18 10:28:41,456 INFO L425 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 10:28:41,456 INFO L425 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2018-11-18 10:28:41,456 INFO L425 ceAbstractionStarter]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2018-11-18 10:28:41,456 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 10:28:41,456 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 177) the Hoare annotation is: true [2018-11-18 10:28:41,456 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-18 10:28:41,456 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-18 10:28:41,456 INFO L425 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 10:28:41,456 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 10:28:41,457 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2018-11-18 10:28:41,457 INFO L425 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-11-18 10:28:41,457 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-18 10:28:41,457 INFO L428 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2018-11-18 10:28:41,457 INFO L425 ceAbstractionStarter]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 10:28:41,457 INFO L425 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 10:28:41,457 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 10:28:41,457 INFO L425 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 10:28:41,457 INFO L425 ceAbstractionStarter]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 10:28:41,465 INFO L425 ceAbstractionStarter]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 10:28:41,466 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 10:28:41,466 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 10:28:41,466 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-18 10:28:41,466 INFO L425 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2018-11-18 10:28:41,466 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 10:28:41,466 INFO L425 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2018-11-18 10:28:41,466 INFO L428 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2018-11-18 10:28:41,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:28:41 BoogieIcfgContainer [2018-11-18 10:28:41,479 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 10:28:41,479 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:28:41,479 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:28:41,479 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:28:41,480 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:28:32" (3/4) ... [2018-11-18 10:28:41,483 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 10:28:41,489 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 10:28:41,489 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 10:28:41,493 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-18 10:28:41,493 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 10:28:41,494 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 10:28:41,539 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1207f287-29ac-43ca-af2b-f4e6991ec2b3/bin-2019/utaipan/witness.graphml [2018-11-18 10:28:41,539 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:28:41,540 INFO L168 Benchmark]: Toolchain (without parser) took 9019.53 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 897.6 MB). Free memory was 959.8 MB in the beginning and 674.8 MB in the end (delta: 285.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-11-18 10:28:41,541 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:28:41,542 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.31 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 946.2 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-18 10:28:41,542 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.50 ms. Allocated memory is still 1.0 GB. Free memory is still 946.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:28:41,542 INFO L168 Benchmark]: Boogie Preprocessor took 53.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 946.2 MB in the beginning and 1.2 GB in the end (delta: -219.2 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-18 10:28:41,542 INFO L168 Benchmark]: RCFGBuilder took 234.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2018-11-18 10:28:41,542 INFO L168 Benchmark]: TraceAbstraction took 8479.26 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 727.2 MB). Free memory was 1.1 GB in the beginning and 674.8 MB in the end (delta: 469.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-11-18 10:28:41,543 INFO L168 Benchmark]: Witness Printer took 60.07 ms. Allocated memory is still 1.9 GB. Free memory is still 674.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:28:41,544 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 176.31 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 946.2 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.50 ms. Allocated memory is still 1.0 GB. Free memory is still 946.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 946.2 MB in the beginning and 1.2 GB in the end (delta: -219.2 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 234.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8479.26 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 727.2 MB). Free memory was 1.1 GB in the beginning and 674.8 MB in the end (delta: 469.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 60.07 ms. Allocated memory is still 1.9 GB. Free memory is still 674.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 42]: 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, 48 locations, 1 error locations. SAFE Result, 8.4s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2942 SDtfs, 1433 SDslu, 1995 SDs, 0 SdLazy, 165 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50185occurred in iteration=30, 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: 3.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 10271 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 2058 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 842 NumberOfCodeBlocks, 842 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 811 ConstructedInterpolants, 0 QuantifiedInterpolants, 42564 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...